( en | de | ru )

 

Disambiguation of "Impagliazzo, Russell"

Author of the publication

copydeleteadd this publication to your clipboard
Security-Preserving Hardness-Amplification for Any Regular One-Way Function.

, and . STOC, page 169-178. ACM, (1999)

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.

Wolter Russell

Russell Kleckley

Dieter Russell

Russell Stinson

Russell Schwartz

 

Other publications of authors with the same name

Models of Greedy Algorithms for Graph Problems., and . Algorithmica, 54 (3): 269-317 (2009)Stabbing Planes., , , , , , and . Electron. Colloquium Comput. Complex., (2017)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)Agnostic Learning from Tolerant Natural Proofs., , , and . APPROX-RANDOM, volume 81 of LIPIcs, page 35:1-35:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Decision trees and downward closures., and . SCT, page 29-38. IEEE Computer Society, (1988)Replicability in High Dimensional Statistics., , , , and . CoRR, (2024)Hard-Core Distributions for Somewhat Hard Problems.. FOCS, page 538-545. IEEE Computer Society, (1995)Toward a Model for Backtracking and Dynamic Programming., , , , , and . Comput. Complex., 20 (4): 679-740 (2011)Exponential Lower Bounds for the Pigeonhole Principle., , and . Comput. Complex., (1993)