Calling names on nameless networks
From MaRDI portal
Publication:1333277
DOI10.1006/inco.1994.1065zbMath0942.68790OpenAlexW1988577444MaRDI QIDQ1333277
Publication date: 26 February 1996
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/inco.1994.1065
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)
Related Items
The local detection paradigm and its applications to self-stabilization, Message terminating algorithms for anonymous rings of unknown size, Deterministic leader election takes \(\Theta (D + \log n)\) bit rounds, Unnamed Item, Analysis of fully distributed splitting and naming probabilistic procedures and applications, Analysis of Fully Distributed Splitting and Naming Probabilistic Procedures and Applications
