World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
73
Citations
24976
World Ranking
1568
National Ranking
818

Research.com Recognitions

  • 2004 - Fellow of John Simon Guggenheim Memorial Foundation
  • 1994 - Fellow of Alfred P. Sloan Foundation

Overview

Russell Impagliazzo is affiliated with the University of California, San Diego in the United States. Their research primarily spans the domain of Computer Science, with a focus on subfields such as Computational Theory and Mathematics, Artificial Intelligence, Discrete Mathematics and Combinatorics, Numerical Analysis, and Industrial and Manufacturing Engineering.

Their scholarly output includes numerous papers published in prominent venues, including:

  • The Fine-Grained Complexity of Multi-Dimensional Ordering Properties, 2021, arXiv (Cornell University)
  • The Power of Natural Properties as Oracles, 2023, Computational Complexity

Some of the most frequent publication venues for their work are:

  • arXiv (Cornell University)
  • Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • Computational Complexity
  • Algorithmica

The scientist's research covers various specialized topics, including:

  • Complexity and Algorithms in Graphs
  • Machine Learning and Algorithms
  • Advanced Graph Theory Research
  • Machine Learning and Data Classification
  • Computability, Logic, AI Algorithms
  • Advanced Optimization Algorithms Research
  • Vehicle Routing Optimization Methods

Frequent collaborators in Russell Impagliazzo's research include:

  • Toniann Pitassi
  • Rex Lei
  • Jessica Sorrell
  • Valentine Kabanets
  • Daniel M. Kane

Russell Impagliazzo's career also includes the recognition of two fellowships:

  • Fellow of John Simon Guggenheim Memorial Foundation (2004)
  • Fellow of Alfred P. Sloan Foundation (1994)

Their work reflects an engagement with a variety of complex computational problems, particularly in the areas of algorithmic graph theory, machine learning methodologies, and theoretical computer science. The diversity of publication venues and co-authors indicates a collaborative and multidisciplinary approach to research within their fields of interest.

Best Publications

  • A Pseudorandom Generator from any One-way Function

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

  • Which Problems Have Strongly Exponential Complexity

    Russell Impagliazzo;Ramamohan Paturi;Francis Zane

  • On the (im)possibility of obfuscating programs

    Boaz Barak;Oded Goldreich;Russell Impagliazzo;Steven Rudich

  • On the complexity of K -SAT

    Russell Impagliazzo;Ramamohan Paturi

  • Designated verifier proofs and their applications

    Markus Jakobsson;Kazue Sako;Russell Impagliazzo

  • Pseudo-random generation from one-way functions

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

  • Limits on the provable consequences of one-way permutations

    R. Impagliazzo;S. Rudich

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

    Russell Impagliazzo;Avi Wigderson

  • Derandomizing polynomial identity tests means proving circuit lower bounds

    Valentine Kabanets;Russell Impagliazzo

  • Complexity of k-SAT

    R. Impagliazzo;R. Paturi

  • One-way functions are essential for complexity based cryptography

    R. Impagliazzo;M. Luby

  • How to recycle random bits

    R. Impagliazzo;D. Zuckerman

  • Using the Groebner basis algorithm to find proofs of unsatisfiability

    Matthew Clegg;Jeffery Edmonds;Russell Impagliazzo

  • A personal view of average-case complexity

    R. Impagliazzo

  • Efficient cryptographic schemes provably as secure as subset sum

    Russell Impagliazzo;Moni Naor

  • Hard-core distributions for somewhat hard problems

    R. Impagliazzo

  • In search of an easy witness: exponential time vs. probabilistic polynomial time

    R. Impagliazzo;V. Kabanets;A. Wigderson

  • Extracting Randomness Using Few Independent Sources

    Boaz Barak;Russell Impagliazzo;Avi Wigderson

  • Pseudorandomness for network algorithms

    Russell Impagliazzo;Noam Nisan;Avi Wigderson

  • Exponential lower bounds for the pigeonhole principle

    Toniann Pitassi;Paul Beame;Russell Impagliazzo

  • Pseudo-random Generation from one-way functions (Extended Abstracts)

    Russell Impagliazzo;Leonid A. Levin;Michael Luby

Frequent Co-Authors

Ramamohan Paturi
Ramamohan Paturi University of California, San Diego
Toniann Pitassi
Toniann Pitassi Columbia University
Avi Wigderson
Avi Wigderson Institute for Advanced Study
Paul Beame
Paul Beame University of Washington
Moni Naor
Moni Naor Weizmann Institute of Science
Boaz Barak
Boaz Barak Harvard University
Samuel R. Buss
Samuel R. Buss University of California, San Diego
Noam Nisan
Noam Nisan Hebrew University of Jerusalem
Michael Luby
Michael Luby BitRipple
Oded Goldreich
Oded Goldreich Weizmann Institute of Science

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

Report an issue

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:

Related Online Degrees & Career Pathways

With the growing demand for tech professionals, many students are exploring diverse online options to enhance their expertise. Whether you’re starting your educational journey or seeking specialized skills, there’s a wide array of programs tailored to different interests and career stages.

If you’re looking for a flexible entry point, consider some of the best associates degrees to get. These programs offer foundational knowledge and can often be completed quickly.

For those aiming to take on leadership roles in education or academia, accredited online educational leadership programs provide convenient pathways to advanced qualifications.

Choosing a reputable institution is crucial; that’s why many students research the accredited online colleges to ensure their degree is recognized and valued by employers.

If you have a passion for creativity and gaming, pursuing a qualification from one of the best online game design degree programs can open doors to dynamic opportunities in the gaming industry.

Best Scientists Citing Russell Impagliazzo

Trending Scientists

Recently Published Articles