The topology of local computing in networks

DOI10.1007/S41468-024-00185-6MaRDI QIDQ6645920

Pierre Fraigniaud, Ami Paz

Publication date: 29 November 2024

Published in: Journal of Applied and Computational Topology (Search for Journal in Brave)

zbMATH Keywords

distributed computingcombinatorial topologydistributed graph algorithms

Mathematics Subject Classification ID

Computer science (68-XX) Combinatorics (05-XX)

Cites Work

• New combinatorial topology bounds for renaming: the lower bound
• Geometric and combinatorial views on asynchronous computability
• Directed algebraic topology and concurrency. With a foreword by Maurice Herlihy and a preface by Samuel Mimram
• Unifying synchronous and asynchronous message-passing models
• Survey of local algorithms
• Simulations and reductions for colorless tasks
• The topological structure of asynchronous computability
• Toward a Topological Characterization of Asynchronous Complexity
• Impossibility of distributed consensus with one faulty process
• Locality in Distributed Graph Algorithms
• Bounds on the Step and Namespace Complexity of Renaming
• What Can be Computed Locally?
• Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge
• The BG distributed simulation algorithm
• An Automatic Speedup Theorem for Distributed Problems
• New combinatorial topology bounds for renaming
• A topological perspective on distributed network algorithms
• A Speedup Theorem for Asynchronous Computation with Applications to Consensus and Approximate Agreement

This page was built for publication: The topology of local computing in networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6645920)