Tight bounds for weakly bounded protocols

Authors:
Ewan Tempero;Richard Ladner
Affiliations:
Department of Computer Science and Engineering, University of Washington, Seattle, WA;Department of Computer Science and Engineering, University of Washington, Seattle, WA
Venue:
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Year:
1990

A little knowledge goes a long way: simple knowledge-based derivations and correctness proofs for a family of protocols

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
Computer networks

Computer networks
The intractability of bounded protocols for non-FIFO channels

Proceedings of the eighth 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

Hi-index	0.00