From post

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.

 

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

Universal almost Optimal Compression and Slepian-wolf Coding in Probabilistic Polynomial Time, и . Journal of the ACM, 70 (2): 1--33 (марта 2023)Simple extractors via constructions of cryptographic pseudo-random generators. Electron. Colloquium Comput. Complex., (2005)On Derandomizing Probabilistic Sublinear-Time Algorithms.. CCC, стр. 1-9. IEEE Computer Society, (2007)On a conditional inequality in Kolmogorov complexity and its applications in communication complexity., и . CoRR, (2019)Minimum Spanning Hypertrees., и . Discret. Appl. Math., 54 (1): 67-76 (1994)On the Topological Size of p-m-Complete Degrees.. Sci. Ann. Cuza Univ., (1994)A List-Decodable Code with Local Encoding and Decoding.. SNPD, стр. 232-237. IEEE Computer Society, (2005)Symmetry of Information and Bounds on Nonuniform Randomness Extraction via Kolmogorov Extractors.. CCC, стр. 148-156. IEEE Computer Society, (2011)Exposure-Resilient Extractors.. CCC, стр. 61-72. IEEE Computer Society, (2006)Algorithmically Independent Sequences., и . Developments in Language Theory, том 5257 из Lecture Notes in Computer Science, стр. 183-195. Springer, (2008)