Distributed tree comparison with nodes of limited memory

DOI10.1002/net.21463zbMath1269.68058OpenAlexW2162838679MaRDI QIDQ5326772

Emanuele G. Fusco, Andrzej Pelc

Publication date: 6 August 2013

Published in: Networks (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.401.4081

zbMATH Keywords

complexitytreesisomorphismmemoryanonymous networks

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Network design and communication in computer systems (68M10) Distributed systems (68M14)

Cites Work

• How much memory is needed for leader election
• Anonymous wireless rings
• Computing Boolean functions on anonymous networks
• Computing anonymously with arbitrary knowledge
• Better computing on the anonymous ring
• Log-Logarithmic Selection Resolution Protocols in a Multiple Access Channel
• Electing a leader in a synchronous ring
• Computing on an anonymous ring
• Decentralized extrema-finding in circular configurations of processors
• An O ( n log n ) Unidirectional Algorithm for the Circular Extrema Problem

This page was built for publication: Distributed tree comparison with nodes of limited memory