Keyword

derandomization

Description: Derandomization is the removal or replacement of randomness in algorithms, typically using deterministic methods in theoretical computer science.

Primary topic: Complexity and Algorithms in Graphs (53%)

Wikidata ID: wiki/Q122466905

OpenAlex ID: keywords/derandomization

Completely Derandomized Self-Adaptation in Evolution Strategies

2001 · Nikolaus Hansen, Andreas Ostermeier · Evolutionary Computation · 4,379

Computational Complexity: A Modern Approach

2009 · Sanjeev Arora, Boaz Barak · 2,300

Computational Complexity

2009 · Sanjeev Arora, Boaz Barak · Cambridge University Press eBooks · 1,687

A Simple Parallel Algorithm for the Maximal Independent Set Problem

1986 · Michael Luby · SIAM Journal on Computing · 1,175

Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems

1998 · Sanjeev Arora · Journal of the ACM · 1,137

PDF

Handbook of Computational Geometry

2000 · Elsevier eBooks · 1,035

Color-coding

1995 · Noga Alon, Raphael Yuster, et al. · Journal of the ACM · 1,002

PDF

Untitled

2007 · David Zuckerman · Theory of Computing · 621

PDF

Computational Complexity: ADVANCED TOPICS

2009 · Sanjeev Arora, Boaz Barak · 576

Fast probabilistic algorithms for hamiltonian circuits and matchings

1979 · D. Angluin, L.G. Valiant · Journal of Computer and System Sciences · 570

Small-Bias Probability Spaces: Efficient Constructions and Applications

1993 · Joseph Naor, Moni Naor · SIAM Journal on Computing · 560

Approximation algorithms for facility location problems (extended abstract)

1997 · David B. Shmoys, Éva Tardos, et al. · ACM Symposium on Theory of Computing (STOC) · 549

PDF

Computational geometry : an introduction through randomized algorithms

1994 · Ketan Mulmuley · 542

P = BPP if E requires exponential circuits

1997 · Russell Impagliazzo, Avi Wigderson · ACM Symposium on Theory of Computing (STOC) · 536

Pseudorandom Functions and Lattices

2012 · Abhishek Banerjee, Chris Peikert, et al. · Lecture notes in computer science · 479

Pseudorandom generators for space-bounded computation

1992 · Noam Nisan · COMBINATORICA · 418

Linear degree extractors and the inapproximability of max clique and chromatic number

2006 · David Zuckerman · ACM Symposium on Theory of Computing (STOC) · 409

How to recycle random bits

1989 · R. Impagliazzo, D. Zuckerman · Annual Symposium on Foundations of Computer Science · 392

Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds

2004 · Valentine Kabanets, Russell Impagliazzo · Computational Complexity · 378

Aspects of Generic Entanglement

2006 · Patrick Hayden, Debbie W. Leung, et al. · Communications in Mathematical Physics · 361

PDF

The discrepancy method: randomness and complexity

2002 · Choice Reviews Online · 347

Two theorems on random polynomial time

1978 · Leonard Adleman · Annual Symposium on Foundations of Computer Science · 322

Splitters and near-optimal derandomization

2002 · M. Naor, L.J. Schulman, et al. · Annual Symposium on Foundations of Computer Science · 295

Infeasibility of instance compression and succinct PCPs for NP

2010 · Lance Fortnow, Rahul Santhanam · Journal of Computer and System Sciences · 288

PDF

Steiner Tree Approximation via Iterative Randomized Rounding

2013 · Jarosław Byrka, Fabrizio Grandoni, et al. · Journal of the ACM · 281

PDF

Works count: 2,253

Citation count: 48,270