On the capacity of information networks
From MaRDI portal
Publication:5901124
DOI10.1145/1109557.1109585zbMath1192.90032OpenAlexW4252452132MaRDI QIDQ5901124
No author found.
Publication date: 16 August 2010
Published in: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1109557.1109585
Communication networks in operations research (90B18) Deterministic network models in operations research (90B10) Information theory (general) (94A15)
Related Items (6)
Sorting Short Keys in Circuits of Size ${o(n \log n)}$ ⋮ Monotonicity testing and shortest-path routing on the cube ⋮ Lower Bounds for External Memory Integer Sorting via Network Coding ⋮ Lower Bounds for Multiplication via Network Coding ⋮ Network coding in undirected graphs is either very helpful or not helpful at all ⋮ Structural Routability of n-Pairs Information Networks
This page was built for publication: On the capacity of information networks
