Lower bounds for asymmetric communication channels and distributed source coding
From MaRDI portal
Publication:3581533
DOI10.1145/1109557.1109586zbMath1192.94083OpenAlexW4256130480MaRDI QIDQ3581533
Mihai Pǎtraşcu, Nicholas J. A. Harvey, Erik D. Demaine, Micah Adler
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.1109586
Network design and communication in computer systems (68M10) Channel models (including quantum) in information and communication theory (94A40) Source coding (94A29)
Related Items (3)
On the complexity of searching in trees and partially ordered structures ⋮ Improved approximation algorithms for the average-case tree searching problem ⋮ Dynamic asymmetric communication
This page was built for publication: Lower bounds for asymmetric communication channels and distributed source coding
