Journal of the ACM Bibliography

Selected papers that cite this one

• Yehuda Afek, Baruch Awerbuch, Eli Gafni, Yishay Mansour, Adi Rosén, and Nir Shavit. Slide -- the key to polynomial end-to-end communication. Journal of Algorithms, 22(1):158-186, January 1997.

• Hagit Attiya, Shlomi Dolev, and Jennifer L. Welch. Connection management without retaining information. Information and Computation, 123(2):155-171, December 1995.

• Alan Fekete, Nancy Lynch, Yishay Mansour, and John Spinelli. The impossibility of implementing reliable communication in the face of crashes. Journal of the ACM, 40(5):1087-1107, November 1993.

• Richard E. Ladner, Anthony LaMarca, and Ewan Tempero. Counting protocols for reliable end-to-end transmission. Journal of Computer and System Sciences, 56(1):96-111, February 1998.

• Yishay Mansour and Baruch Schieber. The intractability of bounded protocols for on-line sequence transmission over non-FIFO channels. Journal of the ACM, 39(4):783-799, October 1992.

• Ewan D. Tempero and Richard E. Ladner. Recoverable sequence transmission protocols. Journal of the ACM, 42(5):1059-1090, September 1995.

Selected references

• Alan Fekete, Nancy Lynch, Yishay Mansour, and John Spinelli. The impossibility of implementing reliable communication in the face of crashes. Journal of the ACM, 40(5):1087-1107, November 1993.

• Joseph Y. Halpern and Lenore D. Zuck. A little knowledge goes a long way: Knowledge-based derivations and correctness proofs for a family of protocols. Journal of the ACM, 39(3):449-478, July 1992.

• Nancy A. Lynch and Eugene W. Stark. A proof of the Kahn principle for input/output automata. Information and Computation, 82(1):81-92, July 1989.

• Yishay Mansour and Baruch Schieber. The intractability of bounded protocols for on-line sequence transmission over non-FIFO channels. Journal of the ACM, 39(4):783-799, October 1992.

Shortcuts: