×

Found 7 Documents (Results 1–7)

Communication complexity of the secret key agreement in algorithmic information theory. (English) Zbl 07559415

Esparza, Javier (ed.) et al., 45th international symposium on mathematical foundations of computer science, MFCS 2020, August 25–26, 2020, Prague, Czech Republic. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 170, Article 44, 14 p. (2020).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Randomized polynomial time protocol for combinatorial Slepian-Wolf problem. (English) Zbl 1466.68038

Italiano, F. (ed.) et al., Mathematical foundations of computer science 2015. 40th international symposium, MFCS 2015, Milan, Italy, August 24–28, 2015. Proceedings. Part II. Berlin: Springer. Lect. Notes Comput. Sci. 9235, 235-247 (2015).
MSC:  68P30 68Q11 68W20
PDFBibTeX XMLCite
Full Text: DOI arXiv

Pseudo-random graphs and bit probe schemes with one-sided error. (English) Zbl 1330.68123

Kulikov, Alexander (ed.) et al., Computer science – theory and applications. 6th international computer science symposium in Russia, CSR 2011, St. Petersburg, Russia, June 14–18, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-20711-2/pbk). Lecture Notes in Computer Science 6651, 50-63 (2011).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Variations on Muchnik’s conditional complexity theorem. (English) Zbl 1248.68269

Frid, Anna (ed.) et al., Computer science – theory and applications. Fourth international computer science symposium in Russia, CSR 2009, Novosibirsk, Russia, August 18–23, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-03350-6/pbk). Lecture Notes in Computer Science 5675, 250-262 (2009).
MSC:  68Q30
PDFBibTeX XMLCite
Full Text: DOI arXiv

Filter Results by …

Document Type

all top 5

Year of Publication

Main Field