Pseudospheres: combinatorics, topology and distributed systems

DOI10.1007/S41468-023-00162-5MaRDI QIDQ6645918zbMATH OpenFDO

Authors Luís C. Alberto

Publication date 29 November 2024

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

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S41468-023-00162-5

zbMATH Keywords

Borsuk-Ulamdistributed computingmatroidsposets

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Partial orders, general (06A06) Simplicial sets and complexes in algebraic topology (55U10) Distributed systems (68M14)

Cites work

• A generalization of Tucker's combinatorial lemma with topological applications
• A lower bound on the number of opinions needed for fault-tolerant decentralized run-time monitoring
• A new theory of complex rays
• A note on set agreement with omission failures
• A topological perspective on distributed network algorithms
• A topological treatment of early-deciding set-agreement
• Algebraic spans
• Algebraic topology
• Algebraic topology of finite topological spaces and applications
• An overview of synchronous message-passing and topology
• Balanced Cohen-Macaulay Complexes
• Chromatic subdivision of a simplicial complex
• Combinatorial algebraic topology
• Construction of universal bundles. II
• Distributed computing through combinatorial topology
• scientific article; zbMATH DE number 4102053 (Why is no real title available?)
• scientific article; zbMATH DE number 67325 (Why is no real title available?)
• scientific article; zbMATH DE number 706263 (Why is no real title available?)
• scientific article; zbMATH DE number 3086604 (Why is no real title available?)
• K-set agreement bounds in round-based models through combinatorial topology
• Shellable and Cohen-Macaulay Partially Ordered Sets
• Shellable Nonpure Complexes and Posets. I
• Shellable nonpure complexes and posets. II
• The fundamental group of balanced simplicial complexes and posets
• The topological structure of asynchronous computability
• The topology of distributed adversaries
• Tight bounds for k-set agreement with limited-scope failure detectors
• Unifying synchronous and asynchronous message-passing models
• 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
• 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)