The intractability of bounded protocols for non-FIFO channels

Authors:
Y. Mansour;B. Schieber
Affiliations:
Laboratory for Computer Science, Massachusetts Institute of Technology, 545 Technology Square, Cambridge, MA;IBM Research Division, T.J. Watson Reeearch Ceuter, P.0. Box 218, Yorktown Heights, NY
Venue:
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Year:
1989

Hierarchical correctness proofs for distributed algorithms

PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Data link layer: two impossibility results

PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
Tight bounds for the sequence transmission problem

Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
A note on reliable full-duplex transmission over half-duplex links

Communications of the ACM
Computer Networks

Computer Networks

Source to destination communication in the presence of faults

Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Tight bounds for weakly bounded protocols

PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Real-time sequence transmission problem

PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing

Hi-index	0.00