REVIEW 1 cited by
History Trees and Their Applications
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
In the theoretical study of distributed communication networks, "history trees" are a discrete structure that naturally models the concept that anonymous agents become distinguishable upon receiving different sets of messages from neighboring agents. By conveniently organizing temporal information in a systematic manner, history trees have been instrumental in the development of optimal deterministic algorithms for networks that are both anonymous and dynamically evolving. This note provides an accessible introduction to history trees, drawing comparisons with more traditional structures found in existing literature and reviewing the latest advancements in the applications of history trees, especially within dynamic networks. Furthermore, it expands the theoretical framework of history trees in new directions, also highlighting several open problems for further investigation.
Forward citations
Cited by 1 Pith paper
-
Computing in Anonymous Dynamic Networks with One-Bit Communications
One-bit broadcast-counting in anonymous dynamic networks supports general multiset computation in O(n³ log² n) rounds, nearly matching the congested O(n³) bound, with a matching Ω(n³) lower bound for large input universes.
Discussion (0). Continue with ORCID to comment.