Electing a leader in a synchronous ring
Journal of the ACM (JACM)
Log-logarithmic selection resolution protocols in a multiple access channel
SIAM Journal on Computing
Computing on an anonymous ring
Journal of the ACM (JACM)
Computing on an anonymous network
PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
Better computing on the anonymous ring
Journal of Algorithms
A logspace algorithm for tree canonization (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Computing Boolean functions on anonymous networks
Information and Computation
Theoretical Computer Science
Computing on Anonymous Networks: Part I-Characterizing the Solvable Cases
IEEE Transactions on Parallel and Distributed Systems
Comparison of initial conditions for distributed algorithms on anonymous networks
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Computing anonymously with arbitrary knowledge
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
An O(nlog n) Unidirectional Algorithm for the Circular Extrema Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
Decentralized extrema-finding in circular configurations of processors
Communications of the ACM
Uniform Leader Election Protocols for Radio Networks
IEEE Transactions on Parallel and Distributed Systems
Efficient algorithms for leader election in radio networks
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Electing a Leader when Processor Identity Numbers are not Distinct (Extended Abstract)
Proceedings of the 3rd International Workshop on Distributed Algorithms
Leader Election in Ad Hoc Radio Networks: A Keen Ear Helps
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
| Hi-index | 0.00 |
We consider the task of comparing two rooted trees with port labelings. Roots of the trees are joined by an edge and the comparison has to be carried out distributedly, by exchanging messages among nodes. If the two trees are isomorphic, all nodes must finish in a state YES, otherwise they have to finish in a state NO and break symmetry, nodes of one tree getting label 0 and of the other – label 1. Nodes are modeled as identical automata, and our goal is to establish trade-offs between the memory size of such an automaton and the efficiency of distributed tree comparison, measured either by the time or by the number of messages used for communication between nodes. We consider both the synchronous and the asynchronous communication and establish exact trade-offs in both scenarios. For the synchronous scenario we are concerned with memory vs. time trade-offs. We show that if the automaton has x bits of memory, where x≥clogn, for a small constant c, then the optimal time to accomplish the comparison task in the class of trees of size at most n and of height at most h1 is Θ( max (h,n/x)). For the asynchronous scenario we study memory vs. number of messages trade-offs. We show that if the automaton has x bits of memory, where n≥x≥clogΔ, then the optimal number of messages to accomplish the comparison task in the class of trees of size at most n and of maximum degree at most Δ is Θ(n2/x).