Optimal routing tables

DOI10.1145/248052.248076zbMath1321.68041OpenAlexW2018598057MaRDI QIDQ2942725

Harry Buhrman, Paul M. B. Vitányi, Jaap-Henk Hoepman

Publication date: 11 September 2015

Published in: Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing - PODC '96 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/248052.248076

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14) Network protocols (68M12) Distributed algorithms (68W15)

Related Items (3)

Average-case analysis via incompressibility ⋮ Representing graphs implicitly using almost optimal space ⋮ A survey on interval routing

This page was built for publication: Optimal routing tables