The mutual exclusion problem: partII—statement and solutions
Journal of the ACM (JACM)
Extended impossibility results for asynchronous complete networks
Information Processing Letters
Efficient synchronization of multiprocessors with shared memory
ACM Transactions on Programming Languages and Systems (TOPLAS)
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
Linearizability: a correctness condition for concurrent objects
ACM Transactions on Programming Languages and Systems (TOPLAS)
A combinatorial characterization of the distributed 1-solvable tasks
Journal of Algorithms
Fast randomized consensus using shared memory
Journal of Algorithms
Initial failures in distributed computations
International Journal of Parallel Programming
Knowledge and common knowledge in a byzantine environment: crash failures
Information and Computation
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
Wakeup under read/write atomicity
Proceedings of the 4th international workshop on Distributed algorithms
Distributed computing: models and methods
Handbook of theoretical computer science (vol. B)
Deciding 1-solvability of distributed task is NP-hard (extended abstract)
WG '90 Proceedings of the 16th international workshop on Graph-theoretic concepts in computer science
Topology and category theory in computer science
Topology and category theory in computer science
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
Generalized FLP impossibility result for t-resilient asynchronous computations
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Bounds on the time to reach agreement in the presence of timing uncertainty
Journal of the ACM (JACM)
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
Are wait-free algorithms fast?
Journal of the ACM (JACM)
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
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
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
Parallel algorithms with processor failures and delays
Journal of Algorithms
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
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
Computing with faulty shared objects
Journal of the ACM (JACM)
Journal of Computer and System Sciences
Randomized Consensus in Expected O(n log^ 2 n) Operations Per Processor
SIAM Journal on Computing
Polylog randomized wait-free consensus
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Time-Adaptive Algorithms for Synchronization
SIAM Journal on Computing
All of us are smarter than any of us: wait-free hierarchies are not robust
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
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
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
Journal of the ACM (JACM)
Optimal time-space tradeoff for shared memory leader election
Journal of Algorithms
Contention in shared memory algorithms
Journal of the ACM (JACM)
The unified structure of consensus: a layered analysis approach
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
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)
On the space complexity of randomized synchronization
Journal of the ACM (JACM)
Lower Bounds for Randomized Mutual Exclusion
SIAM Journal on Computing
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
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)
The topological structure of asynchronous computability
Journal of the ACM (JACM)
Solvability in Asynchronous Environments II: Finite Interactive Tasks
SIAM Journal on Computing
Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge
SIAM Journal on Computing
The Byzantine Generals 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
Distributed Algorithms
SIAM Journal on Computing
Time and Space Lower Bounds for Nonblocking Implementations
SIAM Journal on Computing
New Perspectives in Distributed Computing
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
Randomized Consensus in Expected O(n²log n) Operations
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
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
WDAG '96 Proceedings of the 10th International Workshop on Distributed Algorithms
WDAG '96 Proceedings of the 10th International Workshop on Distributed Algorithms
The Combinatorial Structure of Wait-free Solvable Tasks (Extended Abstract)
WDAG '96 Proceedings of the 10th International Workshop on Distributed Algorithms
Computing in Totally Anonymous Asynchronous Shared Memory Systems
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
Homology of Higher Dimensional Automata
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
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
Computability and complexity results for agreement problems in shared-memory distributed systems
Computability and complexity results for agreement problems in shared-memory distributed systems
Computable obstructions to wait-free computability
Distributed Computing
Closed schedulers: a novel technique for analyzing asynchronous protocols
Distributed Computing
SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science
Asymptotically tight bounds for computing with faulty arrays of processors
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
A tight lower bound for k-set agreement
SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
The do-all problem in broadcast networks
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
A simple proof of the uniform consensus synchronous lower bound
Information Processing Letters
Operation-valency and the cost of coordination
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Hundreds of impossibility results for distributed computing
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
| Hi-index | 0.01 |