( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Randomized Polynomial Time Protocol for Combinatorial Slepian-Wolf Problem.

, и . MFCS (2), том 9235 из Lecture Notes in Computer Science, стр. 235-247. Springer, (2015)

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.

Andrei E Dymerets

Andrei Lehmann

Andrei Belitski

Andrei Negoescu

Andrei Verbovsky

 

Другие публикации лиц с тем же именем

A Criterion for Extractability of Mutual Information for a Triple of Strings.. Probl. Inf. Transm., 39 (1): 148-157 (2003)Variations on Muchnik's Conditional Complexity Theorem., , и . Theory Comput. Syst., 49 (2): 227-245 (2011)Combinatorial Interpretation of Kolmogorov Complexity., , и . CCC, стр. 131-137. IEEE Computer Society, (2000)How to Use Undiscovered Information Inequalities: Direct Applications of the Copy Lemma., и . ISIT, стр. 1377-1381. IEEE, (2019)On OBDD-Based Algorithms and Proof Systems That Dynamically Change Order of Variables., , , и . STACS, том 66 из LIPIcs, стр. 43:1-43:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)A Random Oracle Does Not Help Extract the Mutual Information., и . MFCS, том 5162 из Lecture Notes in Computer Science, стр. 527-538. Springer, (2008)Resource-bounded Kolmogorov complexity provides an obstacle to soficness of multidimensional shifts., и . J. Comput. Syst. Sci., (2022)Pseudo-random Graphs and Bit Probe Schemes with One-Sided Error.. CSR, том 6651 из Lecture Notes in Computer Science, стр. 50-63. Springer, (2011)Randomized Polynomial Time Protocol for Combinatorial Slepian-Wolf Problem., и . MFCS (2), том 9235 из Lecture Notes in Computer Science, стр. 235-247. Springer, (2015)Clustering with respect to the information distance.. Theor. Comput. Sci., (2022)