Author of the publication

Infinitely-Often Autoreducible Sets.

, , and . ISAAC, volume 2906 of Lecture Notes in Computer Science, page 98-107. Springer, (2003)

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.

 

Other publications of authors with the same name

Beating a Finite Automaton in the Big Match., and . TARK, page 225-234. Morgan Kaufmann, (1998)Quantum property testing., , , and . SODA, page 480-488. ACM/SIAM, (2003)The Golden Ticket - P, NP, and the Search for the Impossible.. Princeton University Press, (2013)Computational Complexity., and . Computational Logic, volume 9 of Handbook of the History of Logic, Elsevier, (2014)Tolerant Versus Intolerant Testing for Boolean Properties, and . Theory of Computing, 2 (1): 173-183 (2006)Optimality and domination in repeated games with bounded players., and . STOC, page 741-749. ACM, (1994)A computational theory of awareness and decision making., and . TARK, page 99-107. (2009)Viewpoint - Time for computer science to grow up.. Commun. ACM, 52 (8): 33-35 (2009)Repeated matching pennies with limited randomness., and . EC, page 111-118. ACM, (2011)Linear Advice for Randomized Logarithmic Space, and . Electron. Colloquium Comput. Complex., (2005)