The bit complexity of the predecessor problem

DOI10.1016/S0020-0190(97)00094-XzbMath1337.68121OpenAlexW2024331940MaRDI QIDQ287147

F. Blanchet-Sadri, M. Dambrine

Publication date: 26 May 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(97)00094-x

zbMATH Keywords

distributed computinganonymous ringunidirectional

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Cites Work

• Unnamed Item
• The firing squad synchronization problem for graphs
• Complexity of network synchronization
• Electing a leader in a synchronous ring
• Distributed Algorithms For Unidirectional Networks

This page was built for publication: The bit complexity of the predecessor problem