- Home
- Best Scientists - Computer Science
- Russell Impagliazzo

Discipline name
H-index
Citations
Publications
World Ranking
National Ranking

Computer Science
D-index
59
Citations
21,051
137
World Ranking
1647
National Ranking
916

2004 - Fellow of John Simon Guggenheim Memorial Foundation

1994 - Fellow of Alfred P. Sloan Foundation

- Algorithm
- Discrete mathematics
- Combinatorics

His primary scientific interests are in Discrete mathematics, Combinatorics, Theoretical computer science, Mathematical proof and Cryptography. The various areas that Russell Impagliazzo examines in his Discrete mathematics study include Polynomial identity testing and Oracle. His biological study spans a wide range of topics, including Forcing, Encryption, Pseudorandom function family and Obfuscation.

His Combinatorics study combines topics from a wide range of disciplines, such as Computational complexity theory, Upper and lower bounds and Exponential function. His Theoretical computer science research incorporates themes from Security of cryptographic hash functions, Cryptographic protocol, Composition, Random oracle and Data science. His study looks at the relationship between Mathematical proof and fields such as Algorithm, as well as how they intersect with chemical problems.

- A Pseudorandom Generator from any One-way Function (1372 citations)
- Which Problems Have Strongly Exponential Complexity (1126 citations)
- On the (Im)possibility of Obfuscating Programs (916 citations)

Russell Impagliazzo mainly investigates Discrete mathematics, Combinatorics, Upper and lower bounds, Theoretical computer science and Algorithm. His Discrete mathematics research is multidisciplinary, relying on both Computational complexity theory, Mathematical proof and Circuit complexity. His research integrates issues of Function, Polynomial and Exponential function in his study of Combinatorics.

His Polynomial research includes elements of Nondeterministic algorithm and Pseudorandomness. The concepts of his Upper and lower bounds study are interwoven with issues in Conjecture, Complexity class, Approximation algorithm and Pigeonhole principle. The Theoretical computer science study which covers Pseudorandom function family that intersects with Obfuscation.

- Discrete mathematics (57.59%)
- Combinatorics (48.66%)
- Upper and lower bounds (16.52%)

- Discrete mathematics (57.59%)
- Combinatorics (48.66%)
- Upper and lower bounds (16.52%)

The scientist’s investigation covers issues in Discrete mathematics, Combinatorics, Upper and lower bounds, Polynomial and Boolean function. His Discrete mathematics study incorporates themes from Computational complexity theory, Algebraic number, Class, Exponential function and Entropy. His studies link Nondeterministic algorithm with Combinatorics.

His Nondeterministic algorithm course of study focuses on Randomized algorithm and Pseudorandom generator. His Upper and lower bounds research incorporates themes from Circuit complexity, Complexity class and Oracle. His Boolean function study deals with Fourier analysis intersecting with Inequality, Elementary proof and Quadratic equation.

- Nondeterministic Extensions of the Strong Exponential Time Hypothesis and Consequences for Non-reducibility (59 citations)
- AM with Multiple Merlins (27 citations)
- 0-1 Integer Linear Programming with a Linear Number of Constraints (26 citations)

- Algorithm
- Algebra
- Combinatorics

Russell Impagliazzo spends much of his time researching Combinatorics, Discrete mathematics, Upper and lower bounds, Polynomial and Complexity class. His research in Combinatorics intersects with topics in Fourier analysis and Exponential function. As a member of one scientific family, he mostly works in the field of Discrete mathematics, focusing on Exact algorithm and, on occasion, Linear number.

His work carried out in the field of Upper and lower bounds brings together such families of science as Algorithm, Circuit complexity and Class. His Polynomial research is multidisciplinary, incorporating elements of Matching, Approximation algorithm, Binary logarithm and Boolean satisfiability problem. His Complexity class research is multidisciplinary, incorporating perspectives in Oracle, Obfuscation and Special case.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

Which Problems Have Strongly Exponential Complexity

Russell Impagliazzo;Ramamohan Paturi;Francis Zane.

Journal of Computer and System Sciences **(2001)**

1822 Citations

A Pseudorandom Generator from any One-way Function

Johan HÅstad;Russell Impagliazzo;Leonid A. Levin;Michael Luby.

SIAM Journal on Computing **(1999)**

1360 Citations

On the complexity of K -SAT

Russell Impagliazzo;Ramamohan Paturi.

conference on computational complexity **(2001)**

1096 Citations

Designated verifier proofs and their applications

Markus Jakobsson;Kazue Sako;Russell Impagliazzo.

theory and application of cryptographic techniques **(1996)**

1093 Citations

On the (Im)possibility of Obfuscating Programs

Boaz Barak;Oded Goldreich;Russell Impagliazzo;Steven Rudich.

international cryptology conference **(2001)**

975 Citations

Pseudo-random generation from one-way functions

R. Impagliazzo;L. A. Levin;M. Luby.

symposium on the theory of computing **(1989)**

884 Citations

Complexity of k-SAT

R. Impagliazzo;R. Paturi.

conference on computational complexity **(1999)**

670 Citations

P = BPP if E requires exponential circuits: derandomizing the XOR lemma

Russell Impagliazzo;Avi Wigderson.

symposium on the theory of computing **(1997)**

664 Citations

Limits on the provable consequences of one-way permutations

R. Impagliazzo;S. Rudich.

symposium on the theory of computing **(1989)**

659 Citations

Derandomizing polynomial identity tests means proving circuit lower bounds

Valentine Kabanets;Russell Impagliazzo.

compiler construction **(2004)**

532 Citations

If you think any of the details on this page are incorrect, let us know.

Contact us

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

University of Toronto

Institute for Advanced Study

University of Washington

Czech Academy of Sciences

Tel Aviv University

University of California, San Diego

Weizmann Institute of Science

Hebrew University of Jerusalem

BitRipple

University of California, Los Angeles

Something went wrong. Please try again later.