A fast mutual exclusion algorithm
ACM Transactions on Computer Systems (TOCS)
PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
Shared-memory vs. message-passing in an asynchronous distributed environment
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Atomic snapshots of shared memory
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
A bound first-in, first-enabled solution to the 1-exclusion problem
Proceedings of the 4th international workshop on Distributed algorithms
Efficient parallel algorithms on restartable fail-stop processors
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
Adaptive solutions to the mutual exclusion problem
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
Wait-free k-set agreement is impossible: the topology of public knowledge
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
The asynchronous computability theorem for t-resilient tasks
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Efficient Atomic Snapshots Using Lattice Agreement (Extended Abstract)
WDAG '92 Proceedings of the 6th International Workshop on Distributed Algorithms
Axiomatic proof techniques for parallel programs.
Axiomatic proof techniques for parallel programs.
A simple constructive computability theorem for wait-free computation
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Using k-exclusion to implement resilient, scalable shared objects (extended abstract)
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Consensus power makes (some) sense! (extended abstract)
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Modular competitiveness for distributed algorithms
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Spreading rumors rapidly despite an adversary
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
A proof of a theorem in algebraic-topology by a distributed algorithm
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Wait-free solvability via combinatorial topology
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed 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
Long-lived renaming made adaptive
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
The topological structure of asynchronous computability
Journal of the ACM (JACM)
Long-lived and adaptive atomic snapshot and immediate snapshot (extended abstract)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Lower Bounds in Distributed Computing
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
Polynominal and Adaptive Long-Lived (2k-1)-Renaming
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
Adaptive Long-Lived O(k2)-Renaming with O(k2) Steps
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
Wait-Free n-Set Consensus When Inputs Are Restricted
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
On the Importance of Having an Identity or is Consensus Really Universal?
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
Randomized two-process wait-free test-and-set
Distributed Computing
Hundreds of impossibility results for distributed computing
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Computable obstructions to wait-free computability
Distributed Computing
Randomized naming using wait-free shared variables
Distributed Computing
Long lived adaptive splitter and applications
Distributed Computing
An adaptive collect algorithm with applications
Distributed Computing
Compositional competitiveness for distributed algorithms
Journal of Algorithms
Common2 extended to stacks and unbounded concurrency
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
On the importance of having an identity or, is consensus really universal?
Distributed Computing - Special issue: DISC 04
Failure detectors are schedulers
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Anti-Ω: the weakest failure detector for set agreement
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
New combinatorial topology upper and lower bounds for renaming
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Asynchronous exclusive selection
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
An impossibility about failure detectors in the iterated immediate snapshot model
Information Processing Letters
The Iterated Restricted Immediate Snapshot Model
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Locks Considered Harmful: A Look at Non-traditional Synchronization
SEUS '08 Proceedings of the 6th IFIP WG 10.2 international workshop on Software Technologies for Embedded and Ubiquitous Systems
The 0---1-Exclusion Families of Tasks
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
From adaptive renaming to set agreement
Theoretical Computer Science
The weakest failure detector for solving k-set agreement
Proceedings of the 28th ACM symposium on Principles of distributed computing
Brief announcement: weakest failure detectors via an egg-laying simulation
Proceedings of the 28th ACM symposium on Principles of distributed computing
Compositional competitiveness for distributed algorithms
Journal of Algorithms
From renaming to set agreement
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
The topology of shared-memory adversaries
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Note: Strong order-preserving renaming in the synchronous message passing model
Theoretical Computer Science
Distributed computing: a Glimmer of a theory
Algorithms and theory of computation handbook
Fast randomized test-and-set and renaming
DISC'10 Proceedings of the 24th international conference on Distributed computing
Recursion in distributed computing
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
On adaptive renaming under eventually limited contention
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
Optimal-time adaptive strong renaming, with applications to counting
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
A survey on some recent advances in shared memory models
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
The universe of symmetry breaking tasks
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
A non-topological proof for the impossibility of k-set agreement
SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
Renaming with k-set-consensus: an optimal algorithm into n + k - 1 slots
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Simultaneous consensus tasks: a tighter characterization of set-consensus
ICDCN'06 Proceedings of the 8th international conference on Distributed Computing and Networking
ICDCN'06 Proceedings of the 8th international conference on Distributed Computing and Networking
New combinatorial topology bounds for renaming: The upper bound
Journal of the ACM (JACM)
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Renaming in message passing systems with byzantine failures
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Subconsensus tasks: renaming is weaker than set agreement
DISC'06 Proceedings of the 20th international conference on Distributed Computing
DISC'05 Proceedings of the 19th international conference on Distributed Computing
The committee decision problem
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
An Introduction to the Topological Theory of Distributed Computing with Safe-consensus
Electronic Notes in Theoretical Computer Science (ENTCS)
The renaming problem in shared memory systems: An introduction
Computer Science Review
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
A lambda calculus for gödel---dummett logic capturing waitfreedom
FLOPS'12 Proceedings of the 11th international conference on Functional and Logic Programming
Early deciding synchronous renaming in o( logf) rounds or less
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
Increasing the power of the iterated immediate snapshot model with failure detectors
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
Computability in distributed computing: a Tutorial
ACM SIGACT News
Counting-based impossibility proofs for renaming and set agreement
DISC'12 Proceedings of the 26th international conference on Distributed Computing
A non-topological proof for the impossibility of k-set agreement
Theoretical Computer Science
| Hi-index | 0.00 |