Hundreds of impossibility results for distributed computing (Q5138488): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Faith E. Fich / rank
Normal rank
 
Property / author
 
Property / author: Faith E. Fich / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00446-003-0091-y / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2038924034 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Bit Complexity of Randomized Leader Election on a Ring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized function evaluation on a ring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight lower bounds for probabilistic solitude verification on anonymous rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of end-to-end communication in memoryless networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Atomic snapshots of shared memory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234103 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time and Message Bounds for Election in Synchronous and Asynchronous Complete Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing with faulty shared objects / rank
 
Normal rank
Property / cites work
 
Property / cites work: The power of multiobjects. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Time–Space Tradeoff for Shared Memory Leader Election / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixed consistency / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple bivalency proof that \(t\)-resilient consensus requires \(t+1\) rounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Causal memory: definitions, implementation, and programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Average and Randomized Complexity of Distributed Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-Adaptive Algorithms for Synchronization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contention-free complexity of shared memory algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the message complexity of binary Byzantine agreement under crash failures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time/contention trade-offs for multiprocessor synchronization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Composite registers / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved lower bound for the time complexity of mutual exclusion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the Certified Write-All Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficiency of Synchronous Versus Asynchronous Distributed Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time- and Space-Efficient Randomized Consensus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for distributed coin-flipping and randomized consensus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spreading Rumors Rapidly Despite an Adversary / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized Consensus in Expected $O(N\log ^2 N)$ Operations Per Processor / rank
 
Normal rank
Property / cites work
 
Property / cites work: Renaming in an asynchronous environment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time bounds for decision problems in the presence of timing uncertainty and failures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on the time to reach agreement in the presence of timing uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Correctness Condition for High-Performance Multiprocessors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing in totally anonymous asynchronous shared memory systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Clock Synchronization under Different Delay Assumptions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Are wait-free algorithms fast? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Language complexity on the synchronous anonymous ring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficiency of semisynchronous versus asynchronous networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Combinatorial Structure of Wait-Free Solvable Tasks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Better computing on the anonymous ring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing on an anonymous ring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4398822 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient asynchronous consensus with the weak adversary scheduler / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of network synchronization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A trade-off between information and communication in broadcast protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reliable broadcasts and communication models: tradeoffs and lower bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tight lower bound for randomized synchronous consensus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simplifying fault-tolerance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Closed form bounds for clock synchronization under simple uncertainty assumptions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial characterization of the distributed 1-solvable tasks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4028117 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight bounds on the round complexity of distributed 1-solvable tasks / rank
 
Normal rank
Property / cites work
 
Property / cites work: New lower bound techniques for distributed leader finding and other problems on rings of processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: The distributed bit complexity of the ring: From the anonymous to the non-anonymous case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing anonymously with arbitrary knowledge / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4436038 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized FLP impossibility result for <i>t</i>-resilient asynchronous computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Immediate atomic snapshots and fast renaming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple algorithmically reasoned characterization of wait-free computation (extended abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The BG distributed simulation algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the existence of symmetric algorithms to find leaders in networks of communicating sequential processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asynchronous consensus and broadcast protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on shared memory for mutual exclusion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data Requirements for Implementation of <i>N</i> -Process Mutual Exclusion Using a Single Shared Variable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Algorithms with Processor Failures and Delays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Wait-freedom vs. <i>t</i>-resiliency and the robustness of wait-free hierarchies (extended abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the impossibility of group membership / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unreliable failure detectors for reliable distributed systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The weakest failure detector for solving consensus / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polylog time wait-free construction for closed objects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692502 / rank
 
Normal rank
Property / cites work
 
Property / cites work: More \(choices\) allow more \(faults\): Set consensus problems in totally asynchronous systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight bounds for <i>k</i> -set agreement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Wait-free implementations in message-passing systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on the Costs of Multivalued Register Implementations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple constant-time consensus protocols in realistic failure models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solvability in Asynchronous Environments II: Finite Interactive Tasks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Message terminating algorithms for anonymous rings of unknown size / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Distributed Firing Squad Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simultaneity is harder than agreement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transaction commit in a realistic timing model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4137124 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On <i>k</i> -set consensus problems in asynchronous systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Byzantine generals strike again / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the minimal synchronism needed for distributed consensus / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the possibility and impossibility of achieving clock synchronization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(n log n) unidirectional distributed algorithm for extrema finding in a circle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reaching approximate agreement in the presence of faults / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on information exchange for Byzantine agreement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Early stopping in Byzantine agreement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Authenticated Algorithms for Byzantine Agreement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2782251 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two lower bounds in asynchronous distributed computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contention in shared memory algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Knowledge and common knowledge in a Byzantine environment: Crash failures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space-optimal multi-writer snapshot objects are slow / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tight time lower bound for space-optimal implementations of multi-writer snapshots / rank
 
Normal rank
Property / cites work
 
Property / cites work: The impossibility of implementing reliable communication in the face of crashes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asynchronous approximate agreement / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for convergence function based clock synchronization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the space complexity of randomized synchronization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2766858 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3666268 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound for the time to assure interactive consistency / rank
 
Normal rank
Property / cites work
 
Property / cites work: Easy impossibility proofs for distributed consensus problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Impossibility of distributed consensus with one faulty process / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Wakeup Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Electing a leader in a synchronous ring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementing hybrid consistency with high-level synchronization operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Round-by-round fault detectors (extended abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three-Processor Tasks Are Undecidable / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of global computation in the presence of link failures / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for the asynchronous Write-All problem based on process collision / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4318989 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Message-optimal protocols for Byzantine Agreement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple extensions of 1-writer atomic variable constructions to multiwriter ones / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal precision in the presence of uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Knowledge and common knowledge in a distributed environment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5137896 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set consensus using arbitrary objects (preliminary version) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic spans / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer science today. Recent trends and developments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4527026 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A classification of wait-free loop agreement tasks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4941899 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unifying synchronous and asynchronous message-passing models / rank
 
Normal rank
Property / cites work
 
Property / cites work: The topological structure of asynchronous computability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linearizable counting networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2766860 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotically Optimal Election on Weighted Rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards a topological characterization of asynchronous complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250795 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The time complexity of updating snapshot memories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetry breaking in distributed networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust wait-free hierarchies / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound on the local time complexity of universal constructions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solvability of Consensus: Composition Breaks Down for NonDeterministic Types / rank
 
Normal rank
Property / cites work
 
Property / cites work: A time complexity lower bound for randomized implementations of some shared objects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fault-tolerant wait-free shared objects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time and Space Lower Bounds for Nonblocking Implementations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crash failures can drive protocols to arbitrary states / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two decentralized algorithms for strong interaction fairness for systems with unbounded speed variability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient parallel algorithms can be made robust / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4344152 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resource bounds and combinations of consensus objects / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Optimality of Distributive Constructions of Minimum Weight and Degree Restricted Spanning Trees in a Complete Network of Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal lower bounds for some distributed algorithms for a complete network of processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4267802 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient synchronization of multiprocessors with shared memory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds for Randomized Mutual Exclusion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting protocols for reliable end-to-end transmission / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new solution of Dijkstra's concurrent programming problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Weak Byzantine Generals Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The mutual exclusion problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On interprocess communication. II: Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synchronizing clocks in the presence of faults / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Byzantine Generals Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: More on <i>t</i>-resilience vs. wait-freedom (extended abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: All of Us Are Smarter than Any of Us: Nondeterministic Wait-Free Hierarchies Are Not Robust / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the power of shared object types to implement one-resilient Consensus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed MST for constant diameter graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Closed schedulers: a novel technique for analyzing asynchronous protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: An upper and lower bound for clock synchronization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3126969 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On describing the behavior and implementation of distributed systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2766890 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The intractability of bounded protocols for on-line sequence transmission over non-FIFO channels / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the bit complexity of distributed computations in a ring with a leader / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Certified Write-All Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linearizable read/write objects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4437125 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lower Bound on Wait-Free Counting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concurrent counting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gap Theorems for Distributed Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Layered Analysis of Consensus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Programming simultaneous actions using common knowledge / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conditions on input vectors for consensus solvability in asynchronous distributed systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: What Can be Computed Locally? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed consensus revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatically increasing the fault-tolerance of distributed algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Model for Asynchronous Shared Memory Parallel Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound for probabilistic distributed algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of clock synchronization (extended abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reaching Agreement in the Presence of Faults / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Near-Tight Lower Bound on the Time Complexity of Distributed Minimum-Weight Spanning Tree Construction / rank
 
Normal rank
Property / cites work
 
Property / cites work: An <i>O</i> ( <i>n</i> log <i>n</i> ) Unidirectional Algorithm for the Circular Extrema Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The choice coordination problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4000351 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3787484 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The impact of time on the session problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5681937 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5658452 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Consensus numbers of multi-objects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determining Consensus Numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for leader election and collective coin-flipping in the perfect information model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparison of initial conditions for distributed algorithms on anonymous networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Space Distributed Order-Preserving Lists / rank
 
Normal rank
Property / cites work
 
Property / cites work: Wait-Free <i>k</i>-Set Agreement is Impossible: The Topology of Public Knowledge / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time is not a healer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252757 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Leader election in complete networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Initial failures in distributed computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Possibility and impossibility results in a shared memory environment / rank
 
Normal rank
Property / cites work
 
Property / cites work: An inherent bottleneck in distributed counting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simulating synchronous processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new fault-tolerant algorithm for clock synchronization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing functions on asynchronous anonymous networks / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 03:03, 24 July 2024

scientific article; zbMATH DE number 7281998
Language Label Description Also known as
English
Hundreds of impossibility results for distributed computing
scientific article; zbMATH DE number 7281998

    Statements

    Hundreds of impossibility results for distributed computing (English)
    0 references
    0 references
    0 references
    4 December 2020
    0 references
    distributed computing
    0 references
    complexity lower bounds
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references