Distributed tree comparison with nodes of limited memory

DOI10.1007/978-3-642-13284-1_12MaRDI QIDQ3569122zbMATH OpenOpenAlexFDO

Authors Emanuele G. Fusco, Andrzej Pelc

Publication date 17 June 2010

Published in Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-13284-1_12

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Recommendations

• Distributed tree comparison with nodes of limited memory
• Time versus space trade-offs for rendezvous in trees
• How much memory is needed for leader election
• scientific article; zbMATH DE number 4058881
• How much memory is needed for leader election

Cited in

(1)

• Distributed tree comparison with nodes of limited memory

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3569122)