Author of the publication

Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC 2011, San Jose, CA, USA, 6-8 June 2011

, and (Eds.) ACM, (2011)

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

Sophistication Revisited., and . Theory Comput. Syst., 45 (1): 150-161 (2009)On the Complexity of Succinct Zero-Sum Games., , , and . Comput. Complex., 17 (3): 353-376 (2008)Bounding Rationality by Discounting Time, and . CoRR, (2009)Multi-outcome and Multidimensional Market Scoring Rules, and . CoRR, (2012)Diagonalization.. Current Trends in Theoretical Computer Science, World Scientific, (2001)Resource-Bounded Instance Complexity (Extended Abstract)., and . STACS, volume 900 of Lecture Notes in Computer Science, page 597-608. Springer, (1995)Measure, Category and Learning Theory., , , , , , and . ICALP, volume 944 of Lecture Notes in Computer Science, page 558-569. Springer, (1995)Using Depth to Capture Average-Case Complexity., , and . FCT, volume 2751 of Lecture Notes in Computer Science, page 303-310. Springer, (2003)Does the Polynomial Hierarchy Collapse if Onto Functions are Invertible?, , , , and . Theory Comput. Syst., 46 (1): 143-156 (2010)Testing Closeness of Discrete Distributions., , , , and . J. ACM, 60 (1): 4:1-4:25 (2013)