Citation Impact
Citing Papers
Modularity and community structure in networks
2006 Standout
Combining local search and look-ahead for scheduling and constraint satisfaction problems
1997
Search in a Small World
1999
Solving the really hard problems with cooperative search
1993
Universal Behavior of Load Distribution in Scale-Free Networks
2001 Standout
Learning to Play the Chess Variant Crazyhouse Above World Champion Level With Deep Neural Networks and Human Data
2020
The Collective Dynamics of Smoking in a Large Social Network
2008 Standout
Mastering the game of Go without human knowledge
2017 StandoutNatureNobel
The backtracking survey propagation algorithm for solving random K-SAT problems
2016 StandoutNobel
Solving satisfiability problems by fluctuations: The dynamics of stochastic local search algorithms
2003
Large Deviations in the Free Energy of Mean-Field Spin Glasses
2008 StandoutNobel
RandomK
2002
Optimization with Extremal Dynamics
2001
Modelling disease outbreaks in realistic urban social networks
2004 StandoutNature
The Spread of Obesity in a Large Social Network over 32 Years
2007 Standout
Exhaustive enumeration unveils clustering and freezing in the random 3-satisfiability problem
2008
Long-Range Anomalous Decay of the Correlation in Jammed Packings
2021 StandoutNobel
Phase transitions in the coloring of random graphs
2007
Mastering the game of Go with deep neural networks and tree search
2016 StandoutNatureNobel
Scale-Free Brain Functional Networks
2005 Standout
Neuroscience-Inspired Artificial Intelligence
2017 StandoutNobel
Quantum Algorithm for Linear Systems of Equations
2009 Standout
Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality
2001 Standout
Detecting Representations of Recent and Remote Autobiographical Memories in vmPFC and Hippocampus
2012 StandoutNobel
Glassy Transition in a Disordered Model for the RNA Secondary Structure
2000 StandoutNobel
Catastrophic cascade of failures in interdependent networks
2010 StandoutNature
Behavior of heuristics on large and hard satisfiability problems
2006
Complex network measures of brain connectivity: Uses and interpretations
2009 Standout
Random geometric graphs
2002
Solving Multiclass Learning Problems via Error-Correcting Output Codes
1995
The 3-SAT problem with large number of clauses in the ∞-replica symmetry breaking scheme
2002 StandoutNobel
Guided Local Search for Solving SAT and Weighted MAX-SAT Problems
2000
Survey propagation: An algorithm for satisfiability
2005
Experimental results on the crossover point in random 3-SAT
1996
Metaheuristics in combinatorial optimization
2003 Standout
Jamming model for the extremal optimization heuristic
2002
Metaheuristics in Combinatorial Optimization
2005 Standout
The link‐prediction problem for social networks
2007 Standout
The large deviations of the whitening process in random constraint satisfaction problems
2016
ON THE GROUND STATE STRUCTURE OF P AND NP-COMPLETE RANDOM DECISION PROBLEMS
1999
Community detection in graphs
2009 Standout
Analytic and Algorithmic Solution of Random Satisfiability Problems
2002 StandoutScienceNobel
Clustering by Passing Messages Between Data Points
2007 StandoutScience
Mean-field theory of hard sphere glasses and jamming
2010 StandoutNobel
Guided local search and its application to the traveling salesman problem
1999
Finite-size corrections to disordered systems on Erdös-Rényi random graphs
2013 StandoutNobel
Dynamic Backtracking
1993
Sharp thresholds of graph properties, and the $k$-sat problem
1999
Economics and computer science of a radio spectrum reallocation
2017 StandoutNobel
Squeaky Wheel Optimization
2011
Complex networks: Structure and dynamics
2006 Standout
Resolution limit in community detection
2006 Standout
Combining the Scalability of Local Search with the Pruning Techniques of Systematic Search
2002
Determining computational complexity from characteristic ‘phase transitions’
1999 Nature
Universal spectrum of normal modes in low-temperature glasses
2015 StandoutNobel
On the survey-propagation equations in random constraint satisfiability problems
2008 StandoutNobel
Coauthorship networks and patterns of scientific collaboration
2004 Standout
A Constraint Programming Framework for Local Search Methods
1999
The Nature of Computation
2011
Defining and detecting quantum speedup
2014 StandoutScienceNobel
Statistical mechanics of complex networks
2002 Standout
Local search with constraint propagation and conflict-based heuristics
2002
Community structure in social and biological networks
2002 Standout
Threshold values of random K‐SAT from the cavity method
2005
Two-step relaxation next to dynamic arrest in mean-field glasses: Spherical and Isingp
2012 StandoutNobel
Acquisition of chess knowledge in AlphaZero
2022 StandoutNobel
Reactive search, a history-sensitive heuristic for MAX-SAT
1997
A Survey of Monte Carlo Tree Search Methods
2012 Standout
Phase transitions and the search problem
1996
Focused local search for random 3-satisfiability
2005
Can rare SAT formulae be easily recognized? On the efficiency of message-passing algorithms forK-SAT at large clause-to-variable ratios
2007
A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting
1997 Standout
Predicting research trends with semantic and neural networks with an application in quantum physics
2020 StandoutNobel
Passing Messages Between Disciplines
2003 Science
Greedy Randomized Adaptive Search Procedures
1995 Standout
Analysis of Two Simple Heuristics on a Random Instance ofk-sat
1996
Statistical mechanics methods and phase transitions in optimization problems
2001
The K-SAT Problem in a Simple Limit
2001 StandoutNobel
The Structure and Function of Complex Networks
2003 Standout
Quenched computation of the dependence of complexity on the free energy in the Sherrington-Kirkpatrick model
2004 StandoutNobel
Data Mining: Practical Machine Learning Tools and Techniques
2011 Standout
Operations for Learning with Graphical Models
1994
On metaheuristic algorithms for combinatorial optimization problems
2001
Maps of random walks on complex networks reveal community structure
2008 Standout
Monte Carlo Tree Search with heuristic evaluations using implicit minimax backups
2014
Statistical Physics of Spin Glasses and Information Processing
2001
The architecture of complex weighted networks
2004 Standout
Consensus and Cooperation in Networked Multi-Agent Systems
2007 Standout
Phase diagram and large deviations in the free energy of mean-field spin glasses
2009 StandoutNobel
Entropy landscape and non-Gibbs solutions in constraint satisfaction problems
2008
Data mining: concepts and techniques
2012 Standout
Entropy of theK-Satisfiability Problem
1996
Gradient-based learning applied to document recognition
1998 Standout
Deep optimization for spectrum repacking
2017
Information, Physics, and Computation
2009
A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
2001 Science
Works of Bart Selman being referenced
Evidence for invariants in local search
1997
Noise strategies for improving local search
1994
Boosting combinatorial search through randomization
1998
Domain-independent extensions to GSAT: solving large structured satisfiability problems
1993
Systematic versus stochastic constraint satisfaction
1995
Understanding sampling-based adversarial search methods
2010
A new method for solving hard satisfiability problems
1992
Problem structure in the presence of perturbations
1997
2+p-SAT: Relation of typical-case complexity to the nature of the phase transition
1999
Ten challenges in propositional reasoning and search
1997
Hard and easy distributions of SAT problems
1992
An empirical study of greedy local search for satisfiability testing
1993
Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems
2000
Referral Web
1997
Critical behavior in the computational cost of satisfiability testing
1996
Trade-Offs in Sampling-Based Adversarial Planning
2011
Generating hard satisfiability problems
1996
Critical Behavior in the Satisfiability of Random Boolean Expressions
1994 Science
On Adversarial Search Spaces and Sampling-Based Planning
2010
Algorithm portfolios
2001