Hundreds of impossibility results for distributed computing

Authors:
Faith Fich;Eric Ruppert
Affiliations:
Department of Computer Science, University of Toronto, Toronto, Canada;Department of Computer Science, York University, Toronto, Canada
Venue:
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Year:
2003

Citing 253
Cited 48

Synchronizing clocks in the presence of faults

Journal of the ACM (JACM)
Complexity of network synchronization

Journal of the ACM (JACM)
The mutual exclusion problem: partII—statement and solutions

Journal of the ACM (JACM)
Reaching approximate agreement in the presence of faults

Journal of the ACM (JACM)
Easy impossibility proofs for distributed consensus problems

Distributed Computing
A fast mutual exclusion algorithm

ACM Transactions on Computer Systems (TOCS)
On the minimal synchronism needed for distributed consensus

Journal of the ACM (JACM)
Electing a leader in a synchronous ring

Journal of the ACM (JACM)
On the possibility and impossibility of achieving clock synchronization

Journal of Computer and System Sciences
Upper and lower time bounds for parallel random access machines without simultaneous writes

SIAM Journal on Computing
Transaction commitment at minimal communication cost

PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A knowledge-theoretic analysis of atomic commitment protocols

PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Optimal clock synchronization

Journal of the ACM (JACM)
Simulating synchronous processors

Information and Computation
A lower bound for probabilistic distributed algorithms

Journal of Algorithms
The optimality of distributive constructions of minimum weight and degree restricted spanning trees in a complete network of processors

SIAM Journal on Computing
On the bit complexity of distributed computations in a ring with a leader

Information and Computation
Language complexity on the synchronous anonymous ring

Theoretical Computer Science
Extended impossibility results for asynchronous complete networks

Information Processing Letters
Fault-tolerant decision making in totally asynchronous distributed systems

PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
On processor coordination using asynchronous hardware

PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Consensus in the presence of partial synchrony

Journal of the ACM (JACM)
On the existence of symmetric algorithms to find leaders in networks of communicating sequential processes

Acta Informatica
Effects of message loss on the termination of distributed protocols

Information Processing Letters
A new fault-tolerant algorithm for clock synchronization

Information and Computation
Efficient synchronization of multiprocessors with shared memory

ACM Transactions on Programming Languages and Systems (TOPLAS)
Computing on an anonymous ring

Journal of the ACM (JACM)
Parallel program design: a foundation

Parallel program design: a foundation
On achieving consensus using a shared memory

PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
The bit complexity of randomized leader election on a ring

SIAM Journal on Computing
Optimal lower bounds for some distributed algorithms for a complete network of processors

Theoretical Computer Science
Simple constant-time consensus protocols in realistic failure models

Journal of the ACM (JACM)
A hundred impossibility proofs for distributed computing

Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Tight bounds for the sequence transmission problem

Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
The ambiguity of choosing

Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
On the improbability of reaching Byzantine agreements

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Process Synchronization: Design and Performance Evaluation of Distributed Algorithms

IEEE Transactions on Software Engineering
The distributed firing squad problem

SIAM Journal on Computing
A trade-off between information and communication in broadcast protocols

Journal of the ACM (JACM)
Linearizability: a correctness condition for concurrent objects

ACM Transactions on Programming Languages and Systems (TOPLAS)
Renaming in an asynchronous environment

Journal of the ACM (JACM)
Knowledge and common knowledge in a distributed environment

Journal of the ACM (JACM)
Automatically increasing the fault-tolerance of distributed algorithms

Journal of Algorithms
A combinatorial characterization of the distributed 1-solvable tasks

Journal of Algorithms
Initial failures in distributed computations

International Journal of Parallel Programming
Cost-sensitive analysis of communication protocols

PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Early stopping in Byzantine agreement

Journal of the ACM (JACM)
Wait-free data structures in the asynchronous PRAM model

SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Symmetry breaking in distributed networks

Information and Computation
Knowledge and common knowledge in a byzantine environment: crash failures

Information and Computation
Wait-free synchronization

ACM Transactions on Programming Languages and Systems (TOPLAS)
Wait-free parallel algorithms for the union-find problem

STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Combining tentative and definite executions for very fast dependable parallel computing

STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
New lower bound techniques for distributed leader finding and other problems on rings of processors

Theoretical Computer Science
Better computing on the anonymous ring

Journal of Algorithms
Simultaneity is harder than agreement

Information and Computation
An overview of clock synchronization

Fault-tolerant distributed computing
Two lower bounds in asynchronous distributed computation

Journal of Computer and System Sciences
The need for headers: an impossibility result for communication over unreliable channels

CONCUR '90 Proceedings on Theories of concurrency : unification and extension: unification and extension
Wakeup under read/write atomicity

Proceedings of the 4th international workshop on Distributed algorithms
Impossibility results for asynchronous PRAM (extended abstract)

SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
Time and message bounds for election in synchronous and asynchronous complete networks

SIAM Journal on Computing
Distributed computing: models and methods

Handbook of theoretical computer science (vol. B)
Topology and category theory in computer science

Topology and category theory in computer science
On the complexity of global computation in the presence of link failures: the case of uni-directional faults

PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
Leader election in complete networks

PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
The impact of time on the session problem

PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
The intractability of bounded protocols for on-line sequence transmission over non-FIFO channels

Journal of the ACM (JACM)
Atomic snapshots of shared memory

Journal of the ACM (JACM)
Gap theorems for distributed computation

SIAM Journal on Computing
Time- and space-efficient randomized consensus

Journal of Algorithms
A methodology for implementing highly concurrent data objects

ACM Transactions on Programming Languages and Systems (TOPLAS)
Immediate atomic snapshots and fast renaming

PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
Resource bounds and combinations of consensus objects

PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
The power of processor consistency

SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Generalized FLP impossibility result for t-resilient asynchronous computations

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
The impossibility of implementing reliable communication in the face of crashes

Journal of the ACM (JACM)
Bounds on the time to reach agreement in the presence of timing uncertainty

Journal of the ACM (JACM)
Tight lower bounds for probabilistic solitude verification on anonymous rings

Journal of the ACM (JACM)
On randomization in sequential and distributed algorithms

ACM Computing Surveys (CSUR)
Bounds on shared memory for mutual exclusion

Information and Computation
More choices allow more faults: set consensus problems in totally asynchronous systems

Information and Computation
Sequential consistency versus linearizability

ACM Transactions on Computer Systems (TOCS)
Bounds on the Costs of Multivalued RegisterImplementations

SIAM Journal on Computing
Distributed consensus revisited

Information Processing Letters
Are wait-free algorithms fast?

Journal of the ACM (JACM)
The distributed bit complexity of the ring: from the anonymous to the non-anonymous case

Information and Computation
On the complexity of certified write-all algorithms

Journal of Algorithms
Asynchronous approximate agreement

Information and Computation
A Model for Asynchronous Shared Memory Parallel Computation

SIAM Journal on Computing
Efficiency of semisynchronous versus asynchronous networks

Mathematical Systems Theory
A theory of clock synchronization (extended abstract)

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Reliable communication over unreliable channels

Journal of the ACM (JACM)
The advantages of free choice: a symmetric and fully distributed solution for the dining philosophers problem

A classical mind
Mixed consistency: a model for parallel programming (extended abstract)

PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Set consensus using arbitrary objects (preliminary version)

PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Wait-freedom vs. t-resiliency and the robustness of wait-free hierarchies (extended abstract)

PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Set-linearizability

PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Message terminating algorithms for anonymous rings of unknown size

Information Processing Letters
Tight bounds on the round complexity of distributed 1-solvable tasks

Theoretical Computer Science
Bounds on information exchange for Byzantine agreement

Journal of the ACM (JACM)
Impossibility of distributed consensus with one faulty process

Journal of the ACM (JACM)
Asynchronous consensus and broadcast protocols

Journal of the ACM (JACM)
Time/contention trade-offs for multiprocessor synchronization

Information and Computation
What Can Be Computed Locally?

SIAM Journal on Computing
Parallel algorithms with processor failures and delays

Journal of Algorithms
Algebraic spans

Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
More on t-resilience vs. wait-freedom (extended abstract)

Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Lower bounds for convergence function based clock synchronization

Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Wait-free made fast

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Possibility and impossibility results in a shared memory environment

Acta Informatica
Unreliable failure detectors for reliable distributed systems

Journal of the ACM (JACM)
Computing with faulty shared objects

Journal of the ACM (JACM)
Contention-free complexity of shared memory algorithms

Information and Computation
Simple extensions of 1-writer atomic variable constructions to multiwriter ones

Acta Informatica
ParC—an extension of C for shared memory parallel processing

Software—Practice & Experience
The weakest failure detector for solving consensus

Journal of the ACM (JACM)
Concurrent counting

Journal of Computer and System Sciences
Capturing the power of resiliency and set consensus in distributed systems

Capturing the power of resiliency and set consensus in distributed systems
Randomized Consensus in Expected O(n log^ 2 n) Operations Per Processor

SIAM Journal on Computing
Average and Randomized Complexity of Distributed Problems

SIAM Journal on Computing
The Wakeup Problem

SIAM Journal on Computing
Space bounds for transactional synchronization

PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Crash failures can drive protocols to arbitrary states

PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
On the impossibility of group membership

PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Time-Adaptive Algorithms for Synchronization

SIAM Journal on Computing
Crash Resilient Communication in Dynamic Networks

IEEE Transactions on Computers
A lower bound on wait-free counting

Journal of Algorithms
The decidability of distributed decision tasks (extended abstract)

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
A simple algorithmically reasoned characterization of wait-free computation (extended abstract)

PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Towards a topological characterization of asynchronous complexity

PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Efficient asynchronous consensus with the weak adversary scheduler

PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
The consensus hierarchy is not robust

PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement

SIAM Journal on Computing
Robust wait-free hierarchies

Journal of the ACM (JACM)
Algorithms for the Certified Write-All Problem

SIAM Journal on Computing
Optimal time-space tradeoff for shared memory leader election

Journal of Algorithms
Contention in shared memory algorithms

Journal of the ACM (JACM)
Unifying synchronous and asynchronous message-passing models

PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Round-by-round fault detectors (extended abstract): unifying synchrony and asynchrony

PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
A lower bound on the local time complexity of universal constructions

PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
A tight lower bound for randomized synchronous consensus

PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
A time complexity lower bound for randomized implementations of some shared objects

PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Consensus numbers of multi-objects

PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
A polylog time wait-free construction for closed objects

PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Lower bounds for distributed coin-flipping and randomized consensus

Journal of the ACM (JACM)
Fault-tolerant wait-free shared objects

Journal of the ACM (JACM)
Counting protocols for reliable end-to-end transmission

Journal of Computer and System Sciences
Spreading rumors rapidly despite an adversary

Journal of Algorithms
An inherent bottleneck in distributed counting

Journal of Parallel and Distributed Computing - Parallel and distributed data structures
On the space complexity of randomized synchronization

Journal of the ACM (JACM)
The time complexity of updating snapshot memories

Information Processing Letters
Lower Bounds for Randomized Mutual Exclusion

SIAM Journal on Computing
A Correctness Condition for High-Performance Multiprocessors

SIAM Journal on Computing
Practical Byzantine fault tolerance

OSDI '99 Proceedings of the third symposium on Operating systems design and implementation
Constructing a Reliable Test&Set Bit

IEEE Transactions on Parallel and Distributed Systems
Asymptotically Optimal Election on Weighted Rings

SIAM Journal on Computing
Lower bounds for leader election and collective coin-flipping in the perfect information model

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Comparison of initial conditions for distributed algorithms on anonymous networks

Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Computing anonymously with arbitrary knowledge

Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
The complexity of end-to-end communication in memoryless networks

Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
On k-set consensus problems in asynchronous systems

Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Properties of a family of booster types

Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Solvability of Consensus: Composition Breaks Down for NonDeterministic Types

SIAM Journal on Computing
Three-Processor Tasks Are Undecidable

SIAM Journal on Computing
Wait-free implementations in message-passing systems

Theoretical Computer Science
Linearizable read/write objects

Theoretical Computer Science
Optimal space distributed order-preserving list

Journal of Algorithms
The power of multiobjects

Information and Computation
Reaching Agreement in the Presence of Faults

Journal of the ACM (JACM)
Data Requirements for Implementation of N-Process Mutual Exclusion Using a Single Shared Variable

Journal of the ACM (JACM)
Efficiency of Synchronous Versus Asynchronous Distributed Systems

Journal of the ACM (JACM)
The Weak Byzantine Generals Problem

Journal of the ACM (JACM)
Symmetry and similarity in distributed systems

Proceedings of the fourth annual ACM symposium on Principles of distributed computing
Communication-time trade-offs in network synchronization

Proceedings of the fourth annual ACM symposium on Principles of distributed computing
Memory consistency and event ordering in scalable shared-memory multiprocessors

ISCA '90 Proceedings of the 17th annual international symposium on Computer Architecture
Systematic Formal Verification for Fault-Tolerant Time-Triggered Algorithms

IEEE Transactions on Software Engineering
The topological structure of asynchronous computability

Journal of the ACM (JACM)
Solvability in Asynchronous Environments II: Finite Interactive Tasks

SIAM Journal on Computing
Self-stabilization

Self-stabilization
Two decentralized algorithms for strong interaction fairness for systems with unbounded speed variability

Theoretical Computer Science
Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge

SIAM Journal on Computing
Tight bounds for k-set agreement

Journal of the ACM (JACM)
The Byzantine Generals Problem

ACM Transactions on Programming Languages and Systems (TOPLAS)
An O(nlog n) Unidirectional Algorithm for the Circular Extrema Problem

ACM Transactions on Programming Languages and Systems (TOPLAS)
Distributed computing: fundamentals, simulations and advanced topics

Distributed computing: fundamentals, simulations and advanced topics
A new solution of Dijkstra's concurrent programming problem

Communications of the ACM
A note on reliable full-duplex transmission over half-duplex links

Communications of the ACM
Solution of a problem in concurrent programming control

Communications of the ACM
Conditions on input vectors for consensus solvability in asynchronous distributed systems

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Simplifying fault-tolerance: providing the abstraction of crash failures

Journal of the ACM (JACM)
Distributed MST for constant diameter graphs

Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
An improved lower bound for the time complexity of mutual exclusion

Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Group communication specifications: a comprehensive study

ACM Computing Surveys (CSUR)
Closed form bounds for clock synchronization under simple uncertainty assumptions

Information Processing Letters
The BG distributed simulation algorithm

Distributed Computing
Time bounds for decision problems in the presence of timing uncertainty and failures

Journal of Parallel and Distributed Computing
Distributed Algorithms

Distributed Algorithms
Fault-Tolerant Parallel Computation

Fault-Tolerant Parallel Computation
Synthesis of Parallel Algorithms

Synthesis of Parallel Algorithms
Computing in totally anonymous asynchronous shared memory systems

Information and Computation
Space-optimal multi-writer snapshot objects are slow

Proceedings of the twenty-first annual symposium on Principles of distributed computing
Optimal Clock Synchronization Under Different Delay Assumptions

SIAM Journal on Computing
The Combinatorial Structure of Wait-Free Solvable Tasks

SIAM Journal on Computing
A Layered Analysis of Consensus

SIAM Journal on Computing
A Near-Tight Lower Bound on the Time Complexity of Distributed Minimum-Weight Spanning Tree Construction

SIAM Journal on Computing
All of Us Are Smarter than Any of Us: Nondeterministic Wait-Free Hierarchies Are Not Robust

SIAM Journal on Computing
Determining Consensus Numbers

SIAM Journal on Computing
Time and Space Lower Bounds for Nonblocking Implementations

SIAM Journal on Computing
Randomized Consensus in Expected O(n²log n) Operations

WDAG '91 Proceedings of the 5th International Workshop on Distributed Algorithms
Minimal Shared Information for Concurrent Reading and Writing

WDAG '91 Proceedings of the 5th International Workshop on Distributed Algorithms
Some Results on the Impossibility, Universality, and Decidability of Consensus

WDAG '92 Proceedings of the 6th International Workshop on Distributed Algorithms
Choice Coordination with Multiple Alternatives (Preliminary Version)

WDAG '92 Proceedings of the 6th International Workshop on Distributed Algorithms
A Continuum of Failure Models for Distributed Computing

WDAG '92 Proceedings of the 6th International Workshop on Distributed Algorithms
Exotic Behaviour of Consensus Numbers

WDAG '94 Proceedings of the 8th International Workshop on Distributed Algorithms
Anomalies in the Wait-Free Hierarchy

WDAG '94 Proceedings of the 8th International Workshop on Distributed Algorithms
Wait-free Computing

WDAG '95 Proceedings of the 9th International Workshop on Distributed Algorithms
Understanding the Set Consensus Partial Order Using the Borowsky-Gafni Simulation (Extended Abstract)

WDAG '96 Proceedings of the 10th International Workshop on Distributed Algorithms
On the Robustness of h^r_m

WDAG '96 Proceedings of the 10th International Workshop on Distributed Algorithms
Fault Tolerance Bounds for Memory Consistency

WDAG '97 Proceedings of the 11th International Workshop on Distributed Algorithms
Optimal Wait-Free Clock Synchronisation Protocol on a Shared-Memory Multi-processor System

WDAG '97 Proceedings of the 11th International Workshop on Distributed Algorithms
Approximate Agreement with Mixed Mode Faults: Algorithm and Lower Bound

DISC '98 Proceedings of the 12th International Symposium on Distributed Computing
A Wait-Free Classification of Loop Agreement Tasks

DISC '98 Proceedings of the 12th International Symposium on Distributed Computing
Fairness of Shared Objects

DISC '98 Proceedings of the 12th International Symposium on Distributed Computing
Bounds for Mutual Exclusion with only Processor Consistency

DISC '00 Proceedings of the 14th International Conference on Distributed Computing
Lower Bounds in Distributed Computing

DISC '00 Proceedings of the 14th International Conference on Distributed Computing
Objects Shared by Byzantine Processes

DISC '00 Proceedings of the 14th International Conference on Distributed Computing
An Effective Characterization of Computability in Anonymous Networks

DISC '01 Proceedings of the 15th International Conference on Distributed Computing
Tight Bounds for Shared Memory Systems Accessed by Byzantine Processes

DISC '02 Proceedings of the 16th International Conference on Distributed Computing
Time is Not a Healer

STACS '89 Proceedings of the 6th Annual Symposium on Theoretical Aspects of Computer Science
Homology of Higher Dimensional Automata

CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
Notes on Data Base Operating Systems

Operating Systems, An Advanced Course
Deciding 1-sovability of distributed task is NP-hard

WG '90 Proceedings of the 16rd International Workshop on Graph-Theoretic Concepts in Computer Science
The Consensus Problem in Unreliable Distributed Systems (A Brief Survey)

Proceedings of the 1983 International FCT-Conference on Fundamentals of Computation Theory
Lower Bounds for Synchronous Networks and the Advantage of Local Information

Proceedings of the 2nd International Workshop on Distributed Algorithms
A tight time lower bound for space-optimal implementations of multi-writer snapshots

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Faster approximate agreement with multi-writer registers

FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
On the existence of booster types

FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Cryptographic protocols

STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Local and global properties in networks of processors (Extended Abstract)

STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
The inherent cost of nonblocking commitment

PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
Asynchronous Byzantine consensus

PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
A Modular Approach to Fault-Tolerant Broadcasts and Related Problems

A Modular Approach to Fault-Tolerant Broadcasts and Related Problems
Computability and complexity results for agreement problems in shared-memory distributed systems

Computability and complexity results for agreement problems in shared-memory distributed systems
Cryptography and cryptographic protocols

Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Computable obstructions to wait-free computability

Distributed Computing
An algorithm for the asynchronous Write-All problem based on process collision

Distributed Computing
On the power of shared object types to implement one-resilient Consensus

Distributed Computing
Linearizable counting networks

Distributed Computing
Closed schedulers: a novel technique for analyzing asynchronous protocols

Distributed Computing
Composite registers

Distributed Computing
Implementing hybrid consistency with high-level synchronization operations

Distributed Computing
Atomic m-register operations

Distributed Computing

A tight time lower bound for space-optimal implementations of multi-writer snapshots

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
ACM SIGACT news distributed computing column 13

ACM SIGACT News
Lower bounds for adaptive collect and related objects

Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
On the inherent weakness of conditional synchronization primitives

Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
What cannot be computed locally!

Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Fast fault-tolerant agreement algorithms

Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Information dissemination in highly dynamic graphs

DIALM-POMC '05 Proceedings of the 2005 joint workshop on Foundations of mobile computing
Linear Lower Bounds on Real-World Implementations of Concurrent Objects

FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
The price of being near-sighted

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Time-space tradeoffs for implementations of snapshots

Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Oracle size: a new measure of difficulty for communication tasks

Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Lower bound for scalable Byzantine Agreement

Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Relationships between broadcast and shared memory in reliable anonymous distributed systems

Distributed Computing - Special issue: DISC 04
On the inherent weakness of conditional primitives

Distributed Computing - Special issue: PODC 04
Time lower bounds for implementations of multi-writer snapshots

Journal of the ACM (JACM)
Trade-offs between the size of advice and broadcasting time in trees

Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Disaster avoidance mechanism for content-delivering service

Computers and Operations Research
Symmetric and Synchronous Communication in Peer-to-Peer Networks

MPC '08 Proceedings of the 9th international conference on Mathematics of Program Construction
Tree exploration with advice

Information and Computation
On the cost of uniform protocols whose memory consumption is adaptive to interval contention

Theoretical Computer Science
Graph searching with advice

Theoretical Computer Science
Fast scalable deterministic consensus for crash failures

Proceedings of the 28th ACM symposium on Principles of distributed computing
Downward communications enhancement using a robust broadcasting mechanism

Expert Systems with Applications: An International Journal
On the round complexity of Byzantine agreement without initial set-up

Information and Computation
On the Computational Power of Shared Objects

OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
Graph searching with advice

SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
Communication algorithms with advice

Journal of Computer and System Sciences
Modelling remote concurrency with Ada: case study of symmetric non-deterministic rendezvous

Ada-Europe'07 Proceedings of the 12th international conference on Reliable software technologies
The anonymous consensus hierarchy and naming problems

OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
Local algorithms for dominating and connected dominating sets of unit disk graphs with location aware nodes

LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Distributed anonymous function computation in information fusion and multiagent systems

Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
The computational structure of progress conditions

DISC'10 Proceedings of the 24th international conference on Distributed computing
Failure detectors encapsulate fairness

OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
Tight bounds for parallel randomized load balancing: extended abstract

Proceedings of the forty-third annual ACM symposium on Theory of computing
Distributed computing with rules of thumb

Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
A robust web-based approach for broadcasting downward messages in a large-scaled company

WISE'06 Proceedings of the 7th international conference on Web Information Systems
On the cost of uniform protocols whose memory consumption is adaptive to interval contention

OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
The complexity of updating multi-writer snapshot objects

ICDCN'06 Proceedings of the 8th international conference on Distributed Computing and Networking
Networks cannot compute their diameter in sublinear time

Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Tree exploration with an oracle

MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
A bridge between the asynchronous message passing model and local computations in graphs

MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
On the power of anonymous one-way communication

OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
SCOOP: concurrency made easy

Dependable Systems
Easy impossibility proofs for k-set agreement in message passing systems

OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
Defining Fairness in Reactive and Concurrent Systems

Journal of the ACM (JACM)
Distributed computing with advice: information sensitivity of graph coloring

ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Survey of local algorithms

ACM Computing Surveys (CSUR)
Best-response dynamics out of sync: complexity and characterization

Proceedings of the fourteenth ACM conference on Electronic commerce

Quantified Score

Hi-index	0.00

Visualization

Abstract

We survey results from distributed computing that show tasks to be impossible, either outright or within given resource bounds, in various models. The parameters of the models considered include synchrony, fault-tolerance, different communication media, and randomization. The resource bounds refer to time, space and message complexity. These results are useful in understanding the inherent difficulty of individual problems and in studying the power of different models of distributed computing. There is a strong emphasis in our presentation on explaining the wide variety of techniques that are used to obtain the results described.