Emirhan Gürpinar, Andrei E. Romashchenko. Communication Complexity of the Secret Key Agreement in Algorithmic Information Theory. In Javier Esparza, Daniel Král', editors, 45th International Symposium on Mathematical Foundations of Computer Science, MFCS 2020, August 24-28, 2020, Prague, Czech Republic. Volume 170 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. [doi]
@inproceedings{GurpinarR20,
title = {Communication Complexity of the Secret Key Agreement in Algorithmic Information Theory},
author = {Emirhan Gürpinar and Andrei E. Romashchenko},
year = {2020},
doi = {10.4230/LIPIcs.MFCS.2020.44},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2020.44},
researchr = {https://researchr.org/publication/GurpinarR20},
cites = {0},
citedby = {0},
booktitle = {45th International Symposium on Mathematical Foundations of Computer Science, MFCS 2020, August 24-28, 2020, Prague, Czech Republic},
editor = {Javier Esparza and Daniel Král'},
volume = {170},
series = {LIPIcs},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
isbn = {978-3-95977-159-7},
}