Space-efficient Routing Tables for Almost All Networks and the Incompressibility Method
- 1 January 1999
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 28 (4), 1414-1432
- https://doi.org/10.1137/s0097539796308485
Abstract
No abstract availableThis publication has 4 references indexed in Scilit:
- Kolmogorov Random Graphs and the Incompressibility MethodSIAM Journal on Computing, 1999
- An Introduction to Kolmogorov Complexity and Its ApplicationsPublished by Springer Nature ,1997
- A trade-off between space and efficiency for routing tablesJournal of the ACM, 1989
- Fast probabilistic algorithms for hamiltonian circuits and matchingsJournal of Computer and System Sciences, 1979