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.

 

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

On Unapproximable Versions of NP-Complete Problems. SIAM J. Comput., 25 (6): 1293--1304 (1996)Simulating BPP Using a General Weak Random Source. Algorithmica, 16 (4/5): 367-391 (1996)Extractors for Weak Random Sources and Their Applications.. SWAT, том 1432 из Lecture Notes in Computer Science, стр. 155-157. Springer, (1998)Efficient construction of a small hitting set for combinatorial rectangles in high dimension., , , и . STOC, стр. 258-267. ACM, (1993)Pseudorandom financial derivatives.. EC, стр. 315-320. ACM, (2011)Pseudorandom generators for combinatorial shapes., , , и . STOC, стр. 253-262. ACM, (2011)Low Discrepancy Sets Yield Approximate Min-Wise Independent Permutation Families., , , и . RANDOM-APPROX, том 1671 из Lecture Notes in Computer Science, стр. 11-15. Springer, (1999)Extractor codes., и . STOC, стр. 193-199. ACM, (2001)Mining Circuit Lower Bound Proofs for Meta-Algorithms., , , , и . Electron. Colloquium Comput. Complex., (2013)Extractors from Reed-Muller codes., , и . J. Comput. Syst. Sci., 72 (5): 786-812 (2006)