Communication Complexity of Wait-Free Computability in Dynamic Networks

DOI10.1007/978-3-030-54921-3_17OpenAlexW3045738661MaRDI QIDQ5100966

Sergio Rajsbaum, Carole Delporte-Gallet, Hugues Fauconnier

Publication date: 1 September 2022

Published in: Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-54921-3_17

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer system organization (68Mxx) Communication complexity, information complexity (68Q11)

Related Items (2)

A distributed computing perspective of unconditionally secure information transmission in Russian cards problems ⋮ A distributed computing perspective of unconditionally secure information transmission in Russian cards problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A simple characterization of asynchronous computations
• On the message complexity of binary Byzantine agreement under crash failures
• On knowledge and communication complexity in distributed systems
• Counting in one-hop beeping networks
• An Invitation to Mathematics
• The topological structure of asynchronous computability
• A combinatorial characterization of the distributed 1-solvable tasks
• Bit complexity of breaking and achieving symmetry in chains and rings
• Reaching approximate agreement in the presence of faults
• Three-Processor Tasks Are Undecidable
• Two-Bit Messages are Sufficient to Implement Atomic Read/Write Registers in Crash-prone Systems
• Structural Information and Communication Complexity

This page was built for publication: Communication Complexity of Wait-Free Computability in Dynamic Networks