pdfformat: 

@InProceedings{grpnar_et_al:LIPIcs:2020:12710, author = {Emirhan G{\"u}rpınar and Andrei Romashchenko}, title = {{Communication Complexity of the Secret Key Agreement in Algorithmic Information Theory}}, booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)}, pages = {44:144:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959771597}, ISSN = {18688969}, year = {2020}, volume = {170}, editor = {Javier Esparza and Daniel Kr{\'a}ľ}, publisher = {Schloss DagstuhlLeibnizZentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2020/12710}, URN = {urn:nbn:de:0030drops127102}, doi = {10.4230/LIPIcs.MFCS.2020.44}, annote = {Keywords: Kolmogorov complexity, mutual information, communication complexity, expander mixing lemma, finite geometry} }
Keywords:  Kolmogorov complexity, mutual information, communication complexity, expander mixing lemma, finite geometry  
Seminar:  45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)  
Issue date:  2020  
Date of publication:  18.08.2020 