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.

 

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

Tight lower bounds for the online labeling problem., , и . STOC, стр. 1185-1198. ACM, (2012)Products and Help Bits in Decision Trees, , и . FOCS, стр. 318-329. IEEE Computer Society, (1994)An Improved Exponential-Time Algorithm for k-SAT., , , и . FOCS, стр. 628-637. IEEE Computer Society, (1998)Lower Bounds on the Randomized Communication Complexity of Read-Once Functions., и . CCC, стр. 341-350. IEEE Computer Society, (2009)Optimal Separation of EROW and CROWPRAMs., , и . CCC, стр. 93-. IEEE Computer Society, (2003)Randomization and Derandomization in Space_Bounded Computation.. CCC, стр. 128-149. IEEE Computer Society, (1996)Parallel monotonicity reconstruction., и . SODA, стр. 962-971. SIAM, (2008)Explicit dispersers with polylog degree., , и . STOC, стр. 479-488. ACM, (1995)Minimizing DNF Formulas and AC0 Circuits Given a Truth Table, , , , и . Electron. Colloquium Comput. Complex., (2005)On Randomized Online Labeling with Polynomially Many Labels., , и . ICALP (1), том 7965 из Lecture Notes in Computer Science, стр. 291-302. Springer, (2013)