Introduction to algorithms
Counting networks and multi-processor coordination
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Low contention linearizable counting
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
ACM SIGACT News
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Low contention load balancing on large-scale multiprocessors
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
A lower bound on wait-free counting
PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
Contention in shared memory algorithms
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Journal of the ACM (JACM)
Wait-freedom vs. bounded wait-freedom in public data structures (extended abstract)
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Coins, weights and contention in balancing networks
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
A combinatorial treatment of balancing networks
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Contention in counting networks
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
ACM Transactions on Computer Systems (TOCS)
Counting networks are practically linearizable
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Contention in shared memory algorithms
Journal of the ACM (JACM)
Public data structures: counters as a special case
Theoretical Computer Science
Linearizable counting networks
Distributed Computing
Atomic snapshots using lattice agreement
Distributed Computing
| Hi-index | 0.00 |