Gürpınar, Emirhan; Romashchenko, Andrei 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 \textit{E. Gürpınar} and \textit{A. Romashchenko}, LIPIcs -- Leibniz Int. Proc. Inform. 170, Article 44, 14 p. (2020; Zbl 07559415) Full Text: DOI arXiv
Chumbalov, Daniyar; Romashchenko, Andrei 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 \textit{D. Chumbalov} and \textit{A. Romashchenko}, Lect. Notes Comput. Sci. 9235, 235--247 (2015; Zbl 1466.68038) Full Text: DOI arXiv
Romashchenko, Andrei Pseudo-random graphs and bit probe schemes with one-sided error. (English) Zbl 1319.68066 Theory Comput. Syst. 55, No. 2, 313-329 (2014). MSC: 68P05 68W20 PDFBibTeX XMLCite \textit{A. Romashchenko}, Theory Comput. Syst. 55, No. 2, 313--329 (2014; Zbl 1319.68066) Full Text: DOI arXiv
Musatov, Daniil; Romashchenko, Andrei; Shen, Alexander Variations on Muchnik’s conditional complexity theorem. (English) Zbl 1235.68089 Theory Comput. Syst. 49, No. 2, 227-245 (2011). MSC: 68Q30 PDFBibTeX XMLCite \textit{D. Musatov} et al., Theory Comput. Syst. 49, No. 2, 227--245 (2011; Zbl 1235.68089) Full Text: DOI arXiv
Romashchenko, Andrei 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). MSC: 68Q25 05C80 68Q87 68R10 68W20 PDFBibTeX XMLCite \textit{A. Romashchenko}, Lect. Notes Comput. Sci. 6651, 50--63 (2011; Zbl 1330.68123) Full Text: DOI arXiv
Musatov, Daniil; Romashchenko, Andrei; Shen, Alexander 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 \textit{D. Musatov} et al., Lect. Notes Comput. Sci. 5675, 250--262 (2009; Zbl 1248.68269) Full Text: DOI arXiv
Lee, Troy; Romashchenko, Andrei Resource bounded symmetry of information revisited. (English) Zbl 1081.68034 Theor. Comput. Sci. 345, No. 2-3, 386-405 (2005). MSC: 68Q30 PDFBibTeX XMLCite \textit{T. Lee} and \textit{A. Romashchenko}, Theor. Comput. Sci. 345, No. 2--3, 386--405 (2005; Zbl 1081.68034) Full Text: DOI