Time and message bounds for election in synchronous and asynchronous complete networks
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
An O(nlog n) Unidirectional Algorithm for the Circular Extrema Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
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
An improved algorithm for decentralized extrema-finding in circular configurations of processes
Communications of the ACM
A locking protocol for resource coordination in distributed databases
SIGMOD '78 Proceedings of the 1978 ACM SIGMOD international conference on management of data
A principle for resilient sharing of distributed resources
ICSE '76 Proceedings of the 2nd international conference on Software engineering
The impact of synchronous communication on the problem of electing a leader in a ring
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Distributed elections in an archimedean ring of processors
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
IEEE Transactions on Information Theory
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Lower bounds on communication complexity in distributed computer networks
Journal of the ACM (JACM)
Fault-Tolerant Distributed Algorithm for Election in Complete Networks
IEEE Transactions on Computers - Fault-Tolerant Computing
A protocol to maintain a minimum spanning tree in a dynamic topology
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
A lattice-structured proof of a minimum spanning
PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
Fast distributed construction of k-dominating sets and applications
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Optimal distributed algorithm for minimum spanning trees revisited
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Time and message bounds for election in synchronous and asynchronous complete networks
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
Election in Asynchronous Complete Networks with Intermittent Link Failures
IEEE Transactions on Computers
A faster distributed protocol for constructing a minimum spanning tree
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
A linear-time optimal-message distributed algorithm for minimum spanning trees
Distributed Computing
A highly asynchronous minimum spanning tree protocol
Distributed Computing
A faster distributed protocol for constructing a minimum spanning tree
Journal of Computer and System Sciences
Local MST computation with short advice
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Two novel algorithms for electing coordinator in distributed systems basedon bully algorithm
SEPADS'05 Proceedings of the 4th WSEAS International Conference on Software Engineering, Parallel & Distributed Systems
On the message complexity of global computations
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
Learning automata-based algorithms for solving stochastic minimum spanning tree problem
Applied Soft Computing
The Journal of Supercomputing
Simple distributed algorithms for approximating minimum steiner trees
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
A fast distributed approximation algorithm for minimum spanning trees
DISC'06 Proceedings of the 20th international conference on Distributed Computing
| Hi-index | 0.00 |