Dynamic asymmetric communication

Authors:
Travis Gagie
Affiliations:
Dipartimento di Informatica, Università del Piemonte Orientale, Italy
Venue:
Information Processing Letters
Year:
2008

Citing 7
Cited 1

A locally adaptive data compression scheme

Communications of the ACM
Design and analysis of dynamic Huffman codes

Journal of the ACM (JACM)
Protocols for asymmetric communication channels

Journal of Computer and System Sciences
Improved bounds for asymmetric communication protocols

Information Processing Letters
Infranet: Circumventing Web Censorship and Surveillance

Proceedings of the 11th USENIX Security Symposium
Collecting correlated information from a sensor network

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Lower bounds for asymmetric communication channels and distributed source coding

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm

Fast and Compact Prefix Codes

SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science

Quantified Score

Hi-index	0.89

Visualization

Abstract

We show how any dynamic instantaneous compression algorithm can be converted to an asymmetric communication protocol, with which a server with high bandwidth can help clients with low bandwidth send it messages. Unlike previous authors, we do not assume the server knows the messages' distribution, and our protocols are the first to use only one round of communication for each message.