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

A tool for obtaining tighter security analyses of pseudorandom function based constructions, with applications to PRP to PRF conversion., and . IACR Cryptology ePrint Archive, (1999)Hill-Climbing vs. Simulated Annealing for Planted Bisection Problems.. RANDOM-APPROX, volume 2129 of Lecture Notes in Computer Science, page 2-5. Springer, (2001)Models of Greedy Algorithms for Graph Problems., and . Algorithmica, 54 (3): 269-317 (2009)Stabbing Planes., , , , , , and . Electron. Colloquium Comput. Complex., (2017)Hard-Core Distributions for Somewhat Hard Problems.. FOCS, page 538-545. IEEE Computer Society, (1995)Decision trees and downward closures., and . SCT, page 29-38. IEEE Computer Society, (1988)Relativized Separations of Worst-Case and Average-Case Complexities for NP.. CCC, page 104-114. IEEE Computer Society, (2011)The Power of Natural Properties as Oracles., , and . CCC, volume 102 of LIPIcs, page 7:1-7:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)In Search of an Easy Witness: Exponential Time vs. Probabilistic Polynomial Time., , and . CCC, page 2-12. IEEE Computer Society, (2001)Direct Minimum-Knowledge Computations., and . CRYPTO, volume 293 of Lecture Notes in Computer Science, page 40-51. Springer, (1987)