Oblivious Collaboration
From MaRDI portal
Publication:3095350
DOI10.1007/978-3-642-24100-0_45zbMath1350.68037arXiv1106.2065OpenAlexW3037628665MaRDI QIDQ3095350
Nathan Linial, Yehuda Afek, Eli Gafni, Yakov Babichenko, Benjamin Sudakov
Publication date: 28 October 2011
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1106.2065
Related Items (3)
Communication pattern logic: epistemic and topological views ⋮ Oblivious Collaboration ⋮ Asynchronous Coordination Under Preferences and Constraints
Cites Work
- Unnamed Item
- From adaptive renaming to set agreement
- The \(k\)-simultaneous consensus problem
- Beeping a maximal independent set
- New combinatorial topology upper and lower bounds for renaming
- Oblivious Collaboration
- The topological structure of asynchronous computability
- Renaming in an asynchronous environment
- The Committee Decision Problem
- Reaching approximate agreement in the presence of faults
- Self-stabilizing systems in spite of distributed control
- Atomic snapshots of shared memory
- Algorithms for the Certified Write-All Problem
- Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge
- Generalized FLP impossibility result for t-resilient asynchronous computations
- Distributed Computing
This page was built for publication: Oblivious Collaboration
