Slide—The Key to Polynomial End-to-End Communication
Authors:
- Yehuda AfekYAYehuda Afek
- Baruch AwerbuchBABaruch Awerbuch
- Eli GafniEGEli Gafni
- Yishay MansourYMYishay Mansour
- Adi RosénARAdi Rosén
- Nir ShavitNSNir Shavit
Open Access
- 1 January 1997
- journal article
- research article
- Published by Elsevier in Journal of Algorithms
- Vol. 22 (1) , 158-186
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Log-space polynomial end-to-end communication1995
- Reliable communication over unreliable channelsJournal of the ACM, 1994
- The slide mechanism with applications in dynamic networks1992
- Efficient dispersal of information for security, load balancing, and fault toleranceJournal of the ACM, 1989
- Reliable link initialization proceduresIEEE Transactions on Communications, 1988
- An efficient distributed orientation algorithm (Corresp.)IEEE Transactions on Information Theory, 1983
- The New Routing Algorithm for the ARPANETIEEE Transactions on Communications, 1980
- DNA: The Digital Network ArchitectureIEEE Transactions on Communications, 1980
- Deadlock Avoidance in Store-and-Forward Networks--I: Store-and-Forward DeadlockIEEE Transactions on Communications, 1980
- Resynch Procedures and a Fail-Safe Network ProtocolIEEE Transactions on Communications, 1979