Distributed algorithms for locating centers and medians in communication networks

Authors:
Mohan Sharma;Jianhua Chen;Sitharama Iyengar
Affiliations:
IBM Corporation, 11400 Burnet Road, Zip 9640, Austin, TX;Department of Computer Science, Louisiana State University, Baton Rouge, LA;Department of Computer Science, Louisiana State University, Baton Rouge, LA
Venue:
SAC '92 Proceedings of the 1992 ACM/SIGAPP symposium on Applied computing: technological challenges of the 1990's
Year:
1992

Citing 7
Cited 1

Distributed algorithms for finding centers and medians in networks

ACM Transactions on Programming Languages and Systems (TOPLAS)
Electing a leader in a synchronous ring

Journal of the ACM (JACM)
Networks and distributed computation: concepts, tools, and algorithms

Networks and distributed computation: concepts, tools, and algorithms
An Efficient Distributed Protocol for Finding Shortest Paths in Networks with Negative Weights

IEEE Transactions on Software Engineering
A Distributed Algorithm for Minimum-Weight Spanning Trees

ACM Transactions on Programming Languages and Systems (TOPLAS)
Distributed computation on graphs: shortest path algorithms

Communications of the ACM
Local and global properties in networks of processors (Extended Abstract)

STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing

A note on tree medians

SAC '96 Proceedings of the 1996 ACM symposium on Applied Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract