Computer networks
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
An O(nlog n) Unidirectional Algorithm for the Circular Extrema Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
On an improved algorithm for decentralized extrema finding in circular configurations of processors
Communications of the ACM
Decentralized extrema-finding in circular configurations of processors
Communications of the ACM
An improved algorithm for decentralized extrema-finding in circular configurations of processes
Communications of the ACM
Gap theorems for distributed computing
PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
Probabilistic solitude verification on a ring
PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
Computing on an anonymous ring
Journal of the ACM (JACM)
A hundred impossibility proofs for distributed computing
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
A modular technique for the design of efficient distributed leader finding algorithms
ACM Transactions on Programming Languages and Systems (TOPLAS)
Tight lower bounds for probabilistic solitude verification on anonymous rings
Journal of the ACM (JACM)
Computing on Anonymous Networks: Part I-Characterizing the Solvable Cases
IEEE Transactions on Parallel and Distributed Systems
A modular technique for the design of efficient distributed leader finding algorithms
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
Computing on an anonymous ring
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
Optimal Resilient Distributed Algorithms for Ring Election
IEEE Transactions on Parallel and Distributed Systems
Tight lower and upper bounds for some distributed algorithms for a complete network of processors
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Two lower bounds in asynchronous distributed computation
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
| Hi-index | 0.00 |