OPTIMAL DISTRIBUTED ALGORITHMS FOR MINIMUM WEIGHT SPANNING TREE, COUNTING, LEADER ELECTION AND RELATED PROBLEMS.

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 1987, Pages 230-240

  Awerbuch, Baruch ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL TECHNIQUES - TREES;

COMMUNICATION COMPLEXITY; DISTRIBUTED ALGORITHMS; LEADER ELECTION; MINIMUM WEIGHT SPANNING TREE;

COMPUTER PROGRAMMING;

EID: 0023581508     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/28395.28421     Document Type: Conference Paper

References (19)