The complexity of full-information iterated protocols
From MaRDI portal
Cites work
- A generalized asynchronous computability theorem
- A layered analysis of consensus
- A simple algorithmically reasoned characterization of wait-free computation (extended abstract)
- A simplicial complex model for dynamic epistemic logic to study distributed task computability
- An adaptive collect algorithm with applications
- Atomic snapshots of shared memory
- Chromatic subdivision of a simplicial complex
- Communication Complexity of Wait-Free Computability in Dynamic Networks
- Decomposition of distributed programs into communication-closed layers
- Distributed computing through combinatorial topology
- scientific article; zbMATH DE number 3043302 (Why is no real title available?)
- Immediate atomic snapshots and fast renaming
- Impossibility of distributed consensus with one faulty process
- Power and limits of distributed computing shared memory models
- Preferential Arrangements
- Reaching approximate agreement in the presence of faults
- Reducibility among combinatorial problems
- Schlegel diagram and optimizable immediate snapshot protocol
- The computational power of distributed shared-memory models with bounded-size registers
- The time complexity of consensus under oblivious message adversaries
- The topological structure of asynchronous computability
- The Topology of Randomized Symmetry-Breaking Distributed Computing
- The topology of shared-memory adversaries
- Toward a Topological Characterization of Asynchronous Complexity
- Unifying synchronous and asynchronous message-passing models
- Wait-free k-set agreement is impossible
This page was built for publication: The complexity of full-information iterated protocols
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7363126)
