SOFSEM 2005: Theory and Practice of Computer Science

DOI10.1007/b105088zbMath1117.68357OpenAlexW2543951292MaRDI QIDQ5711520

Jérémie Chalopin

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

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Graph theory (including graph drawing) in computer science (68R10)

Related Items (8)

An algorithmic framework for locally constrained homomorphisms ⋮ On the power of synchronization between two adjacent processes ⋮ How much memory is needed for leader election ⋮ Knowledge, level of symmetry, and time of leader election ⋮ Deterministic leader election takes \(\Theta (D + \log n)\) bit rounds ⋮ Leader election for anonymous asynchronous agents in arbitrary networks ⋮ Topology recognition and leader election in colored networks ⋮ Graph labelings derived from models in distributed computing: A complete complexity classification

This page was built for publication: SOFSEM 2005: Theory and Practice of Computer Science