Topology recognition and leader election in colored networks

DOI10.1016/j.tcs.2016.01.037zbMath1335.68018arXiv1601.07790OpenAlexW2266731991MaRDI QIDQ5964025

Dariusz Dereniowski, Andrzej Pelc

Publication date: 26 February 2016

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1601.07790

zbMATH Keywords

colored networkleader electionlocal modeltopology recognition

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed systems (68M14)

Related Items (1)

Setting Ports in an Anonymous Network: How to Reduce the Level of Symmetry?

Cites Work

• Unnamed Item
• Unnamed Item
• Drawing maps with advice
• Knowledge, level of symmetry, and time of leader election
• How much memory is needed for leader election
• Anonymous wireless rings
• Computing Boolean functions on anonymous networks
• Universal covers of graphs: Isomorphism to depth \(n-1\) implies isomorphism to all depths
• Sorting and election in anonymous asynchronous rings.
• Leader election for anonymous asynchronous agents in arbitrary networks
• Distinguishing views in symmetric networks: a tight lower bound
• Comparison of initial conditions for distributed algorithms on anonymous networks
• Computing anonymously with arbitrary knowledge
• Better computing on the anonymous ring
• A trade-off between information and communication in broadcast protocols
• Renaming in an asynchronous environment
• Labelled (Hyper)Graphs, Negotiations and the Naming Problem
• 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
• Distributed Computing: A Locality-Sensitive Approach
• Time vs. Information Tradeoffs for Leader Election in Anonymous Trees
• Efficient algorithms for leader election in radio networks
• Foundations of Software Science and Computation Structures
• Leader Election in Ad Hoc Radio Networks: A Keen Ear Helps
• SOFSEM 2005: Theory and Practice of Computer Science

This page was built for publication: Topology recognition and leader election in colored networks