Compact name-independent routing with minimum stretch
- 27 June 2004
- conference paper
- Published by Association for Computing Machinery (ACM)
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Compact and localized distributed data structuresDistributed Computing, 2003
- Deterministic DictionariesJournal of Algorithms, 2001
- Routing in TreesPublished by Springer Nature ,2001
- Space-Efficiency for Routing Schemes of Stretch Factor ThreeJournal of Parallel and Distributed Computing, 2001
- Routing in distributed networksACM SIGACT News, 2001
- Pseudorandom generators for space-bounded computationCombinatorica, 1992
- RL⊆SCPublished by Association for Computing Machinery (ACM) ,1992
- Improved routing strategies with succinct tablesJournal of Algorithms, 1990
- Storing a sparse tableCommunications of the ACM, 1979
- Universal classes of hash functionsJournal of Computer and System Sciences, 1979