Lower bounds for asymmetric communication channels and distributed source coding

DOI10.1145/1109557.1109586MaRDI QIDQ3581533zbMATH OpenOpenAlexFDO

Authors Erik D. Demaine, Nicholas J. A. Harvey, Mihai Patrascu, 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

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Source coding (94A29) Channel models (including quantum) in information and communication theory (94A40)

Cited in

(3)

• Improved approximation algorithms for the average-case tree searching problem
• On the complexity of searching in trees and partially ordered structures
• Dynamic asymmetric communication

This page was built for publication: Lower bounds for asymmetric communication channels and distributed source coding

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3581533)