Author of the publication

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

Explicit List-Decodable Codes with Optimal Rate for Computationally Bounded Channels., and . Comput. Complex., 30 (1): 3 (2021)Low-end uniform hardness vs. randomness tradeoffs for AM., and . Electron. Colloquium Comput. Complex., (2007)Mining Circuit Lower Bound Proofs for Meta-Algorithms., , , , and . Electron. Colloquium Comput. Complex., (2013)On Hardness Assumptions Needed for "Extreme High-End" PRGs and Fast Derandomization., and . ITCS, volume 215 of LIPIcs, page 116:1-116:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Channels of Small Log-Ratio Leakage and Characterization of Two-Party Differentially Private Computation., , , and . CoRR, (2021)Typically-correct derandomization.. SIGACT News, 41 (2): 57-72 (2010)On the (Im)Possibility of Arthur-Merlin Witness Hiding Protocols., , and . TCC, volume 5444 of Lecture Notes in Computer Science, page 220-237. Springer, (2009)Constant-Round Oblivious Transfer in the Bounded Storage Model., , , and . TCC, volume 2951 of Lecture Notes in Computer Science, page 446-472. Springer, (2004)True Random Number Generators Secure in a Changing Environment., , and . CHES, volume 2779 of Lecture Notes in Computer Science, page 166-180. Springer, (2003)Simulating independence: new constructions of condensers, ramsey graphs, dispersers, and extractors., , , , and . STOC, page 1-10. ACM, (2005)