Pseudospheres: combinatorics, topology and distributed systems
From MaRDI portal
Publication:6645918
DOI10.1007/S41468-023-00162-5MaRDI QIDQ6645918
Publication date: 29 November 2024
Published in: Journal of Applied and Computational Topology (Search for Journal in Brave)
Partial orders, general (06A06) Combinatorial aspects of matroids and geometric lattices (05B35) Distributed systems (68M14) Simplicial sets and complexes in algebraic topology (55U10)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The topology of distributed adversaries
- Construction of universal bundles. II
- Algebraic topology
- A topological treatment of early-deciding set-agreement
- The fundamental group of balanced simplicial complexes and posets
- Chromatic subdivision of a simplicial complex
- Tight bounds for \(k\)-set agreement with limited-scope failure detectors
- Algebraic topology of finite topological spaces and applications
- A lower bound on the number of opinions needed for fault-tolerant decentralized run-time monitoring
- A generalization of Tucker's combinatorial lemma with topological applications
- An overview of synchronous message-passing and topology
- Unifying synchronous and asynchronous message-passing models
- A note on set agreement with omission failures
- The topological structure of asynchronous computability
- Shellable and Cohen-Macaulay Partially Ordered Sets
- Balanced Cohen-Macaulay Complexes
- Shellable nonpure complexes and posets. II
- Algebraic spans
- Shellable Nonpure Complexes and Posets. I
- A new theory of complex rays
- K-set agreement bounds in round-based models through combinatorial topology
- Using the Borsuk-Ulam theorem. Lectures on topological methods in combinatorics and geometry. Written in cooperation with Anders Björner and Günter M. Ziegler
- A topological perspective on distributed network algorithms
- Combinatorial algebraic topology
- Wait-free solvability of equality negation tasks
This page was built for publication: Pseudospheres: combinatorics, topology and distributed systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6645918)