SOFSEM 2005: Theory and Practice of Computer Science
From MaRDI portal
Publication:5711520
DOI10.1007/b105088zbMath1117.68357MaRDI QIDQ5711520
Publication date: 7 December 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b105088
68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
68R10: Graph theory (including graph drawing) in computer science
Related Items
Topology recognition and leader election in colored networks, An algorithmic framework for locally constrained homomorphisms, Knowledge, level of symmetry, and time of leader election, On the power of synchronization between two adjacent processes, How much memory is needed for leader election, Deterministic leader election takes \(\Theta (D + \log n)\) bit rounds, Leader election for anonymous asynchronous agents in arbitrary networks, Graph labelings derived from models in distributed computing: A complete complexity classification