Amortized efficiency of list update and paging rules
Communications of the ACM
On achieving consensus using a shared memory
PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
Bounded concurrrent time-stamp systems are constructible
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Knowledge and common knowledge in a distributed environment
Journal of the ACM (JACM)
Fast randomized consensus using shared memory
Journal of Algorithms
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
A characterization of eventual Byzantine agreement
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
Knowledge and common knowledge in a byzantine environment: crash failures
Information and Computation
Common knowledge and consistent simultaneous coordination
Proceedings of the 4th international workshop on Distributed algorithms
Randomized wait-free concurrent objects (extended abstract)
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
Optimal time randomized consensus—making resilient algorithms fast in practice
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Competitive algorithms for distributed data management (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Competitive distributed job scheduling (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Performing work efficiently in the presence of faults
PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
ISTCS'92 Symposium proceedings on Theory of computing and systems
Concurrent timestamping made simple
ISTCS'92 Symposium proceedings on Theory of computing and systems
Atomic snapshots of shared memory
Journal of the ACM (JACM)
Time- and space-efficient randomized consensus
Journal of Algorithms
Atomic snapshots in O(n log n) operations
PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
Immediate atomic snapshots and fast renaming
PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
Optimal clock synchronization under different delay assumptions
PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
Linear programming without the matrix
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Competitive distributed file allocation
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Wait-Free Consensus Using Asynchronous Hardware
SIAM Journal on Computing
A theory of clock synchronization (extended abstract)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Randomized Consensus in Expected O(n log^ 2 n) Operations Per Processor
SIAM Journal on Computing
Contention in shared memory algorithms
Journal of the ACM (JACM)
Randomized Consensus in Expected O(n²log n) Operations
WDAG '91 Proceedings of the 5th International Workshop on Distributed Algorithms
Efficient Atomic Snapshots Using Lattice Agreement (Extended Abstract)
WDAG '92 Proceedings of the 6th International Workshop on Distributed Algorithms
A Concurrent Time-Stamp Scheme which is Linear in Time and Space
WDAG '92 Proceedings of the 6th International Workshop on Distributed Algorithms
Reading Many Variables in One Atomic Operation: Solutions With Linear or Sublinear Complexity
WDAG '91 Proceedings of the 5th International Workshop on Distributed Algorithms
Distributed Computing
ACM SIGACT News
Spreading rumors rapidly despite an adversary
PODC '96 Proceedings of the fifteenth 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
Contention in shared memory algorithms
Journal of the ACM (JACM)
Cooperative sharing and asynchronous consensus using single-reader single-writer registers
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Adaptability and the Usefulness of Hints (Extended Abstract)
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Algorithms adapting to point contention
Journal of the ACM (JACM)
Relative competitive analysis of cache replacement policies
Proceedings of the 2008 ACM SIGPLAN-SIGBED conference on Languages, compilers, and tools for embedded systems
| Hi-index | 0.00 |