Lower bounds on communication complexity in distributed computer networks
Journal of the ACM (JACM)
Extended impossibility results for asynchronous complete networks
Information Processing Letters
New lower bound techniques for distributed leader finding and other problems on rings of processors
Theoretical Computer Science
Two lower bounds in asynchronous distributed computation
Journal of Computer and System Sciences
Gap theorems for distributed computation
SIAM Journal on Computing
The distributed bit complexity of the ring: from the anonymous to the non-anonymous case
Information and Computation
Introduction to distributed algorithms
Introduction to distributed algorithms
The linear-array conjecture in communication complexity is false
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
A comparison of two lower-bound methods for communication complexity
MFCS '94 Selected papers from the 19th international symposium on Mathematical foundations of computer science
The linear-array problem in communication complexity resolved
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Communication complexity
A Distributed Algorithm for Minimum-Weight Spanning Trees
ACM Transactions on Programming Languages and Systems (TOPLAS)
Decentralized extrema-finding in circular configurations of processors
Communications of the ACM
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Distributed computing: fundamentals, simulations and advanced topics
Distributed computing: fundamentals, simulations and advanced topics
Distributed Algorithms
Graph Algorithms
Some complexity questions related to distributive computing(Preliminary Report)
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
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
Exact communication costs for consensus and leader in a tree
Journal of Discrete Algorithms
Two absolute bounds for distributed bit complexity
Theoretical Computer Science
Bit complexity of breaking and achieving symmetry in chains and rings
Journal of the ACM (JACM)
Two absolute bounds for distributed bit complexity
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
| Hi-index | 0.00 |