Algebraic topology and distributed computing

DOI10.3934/FODS.2024008MaRDI QIDQ6620125zbMATH OpenFDO

Authors Xingwu Liu, Stephen Theriault, Jie Wu, Yunguang Yue

Publication date 16 October 2024

Published in Foundations of Data Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3934/FODS.2024008

zbMATH Keywords

distributed computinggeometric realizationrendezvous task

Mathematics Subject Classification ID

Homotopy theory (55P99) Distributed algorithms (68W15)

Cites work

• A classification of wait-free loop agreement tasks
• A generalization of the homology and homotopy suspension
• A generalized asynchronous computability theorem
• Classifying rendezvous tasks of arbitrary dimension
• Distributed computability in Byzantine asynchronous systems
• Fast Byzantine agreement
• From wait-free to arbitrary concurrent solo executions in colorless distributed computing
• scientific article; zbMATH DE number 996442 (Why is no real title available?)
• scientific article; zbMATH DE number 3812514 (Why is no real title available?)
• scientific article; zbMATH DE number 1559574 (Why is no real title available?)
• scientific article; zbMATH DE number 2103273 (Why is no real title available?)
• Impossibility of distributed consensus with one faulty process
• Introduction to homotopy theory
• Introduction to homotopy theory
• More \(choices\) allow more \(faults\): Set consensus problems in totally asynchronous systems
• New combinatorial topology bounds for renaming: the lower bound
• New combinatorial topology bounds for renaming: the upper bound
• On computable numbers, with an application to the Entscheidungsproblem.
• On computable numbers, with an application to the Entscheidungsproblem. A correction.
• Renaming in an asynchronous environment
• Spaces with polynomial mod-p cohomology
• The asynchronous computability theorem for t-resilient tasks
• The cohomology algebra of a space
• The complexity of obstruction-free implementations
• The complexity of synchronous iterative do-all with crashes
• The evolution of non-degenerate and degenerate rendezvous tasks
• The Steenrod problem of realizing polynomial cohomology rings
• The topological structure of asynchronous computability
• The topology of distributed adversaries
• Tight bounds for k-set agreement
• Tight bounds on the round complexity of distributed 1-solvable tasks
• Topology and groupoids
• Toward a Topological Characterization of Asynchronous Complexity

Cited in

(1)

• Preface

This page was built for publication: Algebraic topology and distributed computing

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