Citation Impact
Citing Papers
Reinforcement Learning with Factored States and Actions
2004 StandoutNobel
Mastering the game of Go without human knowledge
2017 StandoutNatureNobel
The backtracking survey propagation algorithm for solving random K-SAT problems
2016 StandoutNobel
Random numbers certified by Bell’s theorem
2010 StandoutNature
Mastering the game of Go with deep neural networks and tree search
2016 StandoutNatureNobel
Attack vulnerability of complex networks
2002 Standout
Bayesian Networks and Decision Graphs
2007 Standout
Flooding in wireless ad hoc networks
2001
On the complexity of loading shallow neural networks
1988
Wrappers for feature subset selection
1997 Standout
A concise survey of scheduling with time-dependent processing times
2003 Standout
Extracting Randomness: A Survey and New Constructions
1999
Power-Up SRAM State as an Identifying Fingerprint and Source of True Random Numbers
2008 Standout
The Tractability of Segmentation and Scene Analysis
1998
Spatial modelling: a comprehensive framework for principal coordinate analysis of neighbour matrices (PCNM)
2006 Standout
Randomized Algorithms
1995 Standout
A Comparison of Eleven Static Heuristics for Mapping a Class of Independent Tasks onto Heterogeneous Distributed Computing Systems
2001 Standout
Fast and Frugal Heuristics: Tools of Social Rationality
2009
Explanation and Understanding
2005 Standout
Computer Go
2002
The Nature of Computation
2011
Coherence as Constraint Satisfaction
1998
Heuristic Decision Making
2010 Standout
A Survey of Monte Carlo Tree Search Methods
2012 Standout
Efficient Graph-Based Image Segmentation
2004 Standout
The computational complexity of probabilistic inference using bayesian belief networks
1990
Parameterized Complexity
2002 Standout
Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
2008 Standout
The NP-completeness column: An ongoing guide
1986
Fixed-parameter tractability and completeness IV: On completeness for W[P] and PSPACE analogues
1995
Data mining: concepts and techniques
2012 Standout
Selective search in games of different complexity
2011
Models for Spatial Weights: A Systematic Look
1998
Energy-Efficient Routing Protocols in Wireless Sensor Networks: A Survey
2012 Standout
Improving the analysis of dependable systems by mapping fault trees into Bayesian networks
2001 Standout
Allocating modules to processors in a distributed system
1989
Works of David Lichtenstein being referenced
GO Is Polynomial-Space Hard
1980
Some extremal problems arising from discrete control processes
1989
Planar Formulae and Their Uses
1982
Computing a perfect strategy for n × n chess requires time exponential in n
1981