( en | de | ru )

 

Disambiguation of "Romashchenko, Andrei E."

Author of the publication

copydeleteadd this publication to your clipboard
Variations on Muchnik's Conditional Complexity Theorem.

, , and . Theory Comput. Syst., 49 (2): 227-245 (2011)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Andrei E Dymerets

Andrei Negoescu

Andrei Belitski

Andrei Lehmann

Andrei Verbovsky

 

Other publications of authors with the same name

Extracting the Mutual Information for a Triple of Binary Strings.. CCC, page 221-229. IEEE Computer Society, (2003)Randomized Polynomial Time Protocol for Combinatorial Slepian-Wolf Problem., and . MFCS (2), volume 9235 of Lecture Notes in Computer Science, page 235-247. Springer, (2015)Pseudo-random Graphs and Bit Probe Schemes with One-Sided Error.. CSR, volume 6651 of Lecture Notes in Computer Science, page 50-63. Springer, (2011)Clustering with respect to the information distance.. Theor. Comput. Sci., (2022)Inequalities for space-bounded Kolmogorov complexity., , , and . Comput., 11 (3-4): 165-185 (2022)Communication Complexity of the Secret Key Agreement in Algorithmic Information Theory., and . ACM Trans. Comput. Theory, 16 (3): 13:1-13:37 (September 2024)A Criterion for Extractability of Mutual Information for a Triple of Strings.. Probl. Inf. Transm., 39 (1): 148-157 (2003)Algorithmic Aspects of Information Theory (Dagstuhl Seminar 22301)., , , , and . Dagstuhl Reports, 12 (7): 180-204 (July 2022)Combinatorial interpretation of Kolmogorov complexity., , and . Theor. Comput. Sci., 271 (1-2): 111-123 (2002)Variations on Muchnik's Conditional Complexity Theorem., , and . Theory Comput. Syst., 49 (2): 227-245 (2011)