Dynamic Asymmetric Communication
<|reference_start|>Dynamic Asymmetric Communication: 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.<|reference_end|>
@article{gagie2005dynamic,
    title={Dynamic Asymmetric Communication},
    author={Travis Gagie},
    journal={arXiv preprint arXiv:cs/0506025},
    year={2005},
    doi={10.1109/DCC.2006.29},
    archivePrefix={arXiv},
    eprint={cs/0506025},
    primaryClass={cs.IT math.IT}
}