Citation Impact
Citing Papers
Computational Complexity: A Modern Approach
2009
Copper‐Catalyzed Enantioselective Conjugate Addition of Grignard Reagents to α,β‐Unsaturated Esters
2005 StandoutNobel
The backtracking survey propagation algorithm for solving random K-SAT problems
2016 StandoutNobel
Quantum Algorithm for Linear Systems of Equations
2009 Standout
An overview of statistical learning theory
1999 Standout
Quantum Experiments and Graphs: Multiparty States as Coherent Superpositions of Perfect Matchings
2017 StandoutNobel
Computational limitations on learning from examples
1988
Characterizing quantum supremacy in near-term devices
2018 StandoutNobel
Quantum computing, postselection, and probabilistic polynomial-time
2005
PUF Modeling Attacks on Simulated and Silicon Data
2013 Standout
Randomized Kinodynamic Planning
2001 Standout
The capacity of low-density parity-check codes under message-passing decoding
2001 Standout
Relative complexity of checking and evaluating
1976
Efficiency and Braess' Paradox under pricing in general networks
2006 StandoutNobel
A threshold of ln n for approximating set cover
1998 Standout
A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
1988 Standout
Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity
1988
Elementary gates for quantum computation
1995 Standout
Oracle Quantum Computing
1994
A concise survey of scheduling with time-dependent processing times
2003 Standout
Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes
1988
On counting problems and the polynomial-time hierarchy
1980
Aerogels
1991
Wireless sensor network localization techniques
2007 Standout
Learning Conjunctive Concepts in Structural Domains
1989
Random generation of combinatorial structures from a uniform distribution
1986 Standout
Organoboranes - The Modern Miracle
1976 StandoutNobel
Aerogels
1992
Randomized Algorithms
1995 Standout
Normalized cuts and image segmentation
2000 Standout
Space-Bounded Quantum Complexity
1999
Recursively enumerable sets and degrees
1978 Standout
Copper‐Catalyzed Enantioselective Conjugate Addition of Grignard Reagents to α,β‐Unsaturated Esters
2005 StandoutNobel
Finding Structure with Randomness: Probabilistic Algorithms for Constructing Approximate Matrix Decompositions
2011 Standout
Approximate counting, uniform generation and rapidly mixing Markov chains
1989
Promotion of tetrahedral copper(I ) dimers by chelation of 1,1′-bis(diphenylphosphino)ferrocene (dppf). Crystal structures of [{CU(µ-X)(dppf-P,P′)}2](X = O2CH, I or NO3)
1994
Theory of Simple Glasses: Exact Solutions in Infinite Dimensions
2020 StandoutNobel
The Nature of Computation
2011
Defining and detecting quantum speedup
2014 StandoutScienceNobel
The complexity of stochastic games
1992
Sensor Selection via Convex Optimization
2008 Standout
The complexity of computing the permanent
1979 Standout
Low Molecular Mass Gelators of Organic Liquids and the Properties of Their Gels
1997 Standout
A Random Linear Network Coding Approach to Multicast
2006 Standout
Crowds
1998 Standout
The polynomial hierarchy and a simple model for competitive analysis
1985
The reaction of iodine with vinyltrialkylborates derived from trialkylboranes and trisylhydrazones of methyl ketones. A new method for synthesis of 1,1-dialkylethenes
1980 StandoutNobel
Massively parallel probabilistic computing with sparse Ising machines
2022 StandoutNobel
Extracting secret keys from integrated circuits
2005 Standout
Reinforcement Learning: A Survey
1996 Standout
Active Learning Literature Survey
2009 Standout
Planning and acting in partially observable stochastic domains
1998 Standout
Semi-Supervised Learning
2006 Standout
Strengths and Weaknesses of Quantum Computing
1997
Processing Routes to Macroporous Ceramics: A Review
2006 Standout
Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
2008 Standout
The NP-completeness column: An ongoing guide
1986
A Martingale Representation for Matching Estimators
2012 StandoutNobel
Boron I. Carboranes and hydroboration annual survey covering the year 1976
1978
Entanglement detection
2009 Standout
Selection of relevant features and examples in machine learning
1997 Standout
Quantum Computing in the NISQ era and beyond
2018 Standout
Learnability and the Vapnik-Chervonenkis dimension
1989
The strength of weak learnability
1990 Standout
The Strength of Weak Learnability
1990 Standout
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
1999 Standout
A Theory of Network Localization
2006
Most Tensor Problems Are NP-Hard
2013 Standout
Chord: a scalable peer-to-peer lookup protocol for internet applications
2003 Standout
The Complexity of Enumeration and Reliability Problems
1979 Standout
SPINS: Security Protocols for Sensor Networks
2002 Standout
How to construct random functions
1986 Standout
The status of the P versus NP problem
2009
The polynomial-time hierarchy
1976
Works of John Gill being referenced
Relative to a Random OracleA, ${\bf P}^A \ne {\bf NP}^A \ne \text{co-}{\bf NP}^A $ with Probability 1
1981
Aerogel composites for radioluminescent light/power sources
1991
Transition metal hydroborate complexes. VIII. Structure of .mu.-decahydrodecaboratotetrakis(triphenylphosphine)dicopper(I)-chloroform. Bonding annalogies between boron hydrides and nido-metalloboranes
1975
On subcreative sets and S-reducibility
1974
Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question
1975
Computational Complexity of Probabilistic Turing Machines
1977