Dynamic asymmetric communication

Authors:
Travis Gagie
Affiliations:
Department of Computer Science, University of Toronto, Toronto, Canada
Venue:
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Year:
2006

Citing 10
Cited 1

Self-adjusting binary search trees

Journal of the ACM (JACM)
Dynamic Huffman coding

Journal of Algorithms
A locally adaptive data compression scheme

Communications of the ACM
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
Protocols for Asymmetric Communication Channels

FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Dynamic Shannon Coding

DCC '04 Proceedings of the Conference on Data Compression
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

Dynamic Shannon coding

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present four new asymmetric communication protocols, with which a server with high bandwidth can help clients with low bandwidth send it messages. Three of our protocols are the first to use only a single round of communication for each message. Unlike previous authors, we do not assume the server knows the messages' distribution