Broadcast with partial knowledge (preliminary version)

Authors:
Baruch Awerbuch;Israel Cidon;Shay Kutten;Yishay Mansour;David Peleg
Affiliations:
Dept. of mathematics and Lab. for Computer Science, M.I.T., Cambridge, MA;IBM T.J. Watson Research Center, P.O. Box 704, Yorktown Heights, NY;IBM T.J. Watson Research Center, P.O. Box 704, Yorktown Heights, NY;Aiken computation Laboratory, Harvard University, Cambridge, MA;Department of Applied Mathematics and Computer Science, The Weimann Institute, Rehovot 76100, Isreal
Venue:
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
Year:
1991

Efficient dispersal of information for security, load balancing, and fault tolerance

Journal of the ACM (JACM)
Completeness theorems for non-cryptographic fault-tolerant distributed computation

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Distributed control for PARIS

PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Graph 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

The maintenance of common data in a distributed system

Journal of the ACM (JACM)
A technique for partial broadcasting in networks (abstract)

PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
A simple distributed algorithm for the maintenance of a spanning tree

VECoS'07 Proceedings of the First international conference on Verification and Evaluation of Computer and Communication Systems

Hi-index	0.00