A fast and simple randomized parallel algorithm for the maximal independent set problem
Journal of Algorithms
RSA/Rabin least significant bits are 1-2- + 1/poly(log N) secure
Proceedings of CRYPTO 84 on Advances in cryptology
A simple parallel algorithm for the maximal independent set problem
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Matching is as easy as matrix inversion
Combinatorica
The Johnson-Lindenstrauss Lemma and the sphericity of some graphs
Journal of Combinatorial Theory Series A
Probabilistic construction of deterministic algorithms: approximating packing integer programs
Journal of Computer and System Sciences - 27th IEEE Conference on Foundations of Computer Science October 27-29, 1986
Pseudorandom generators for space-bounded computations
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Small-bias probability spaces: efficient constructions and applications
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Sample spaces uniform on neighborhoods
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Constructing small sample spaces satisfying given constraints
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Journal of Computer and System Sciences
The probabilistic method yields deterministic parallel algorithms
Proceedings of the 30th IEEE symposium on Foundations of computer science
.879-approximation algorithms for MAX CUT and MAX 2SAT
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
The amazing power of pairwise independence (abstract)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
New ${\bf \frac{3}{4}}$-Approximation Algorithms for the Maximum Satisfiability Problem
SIAM Journal on Discrete Mathematics
Randomized algorithms
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
Approximate graph coloring by semidefinite programming
Journal of the ACM (JACM)
Approximate nearest neighbors: towards removing the curse of dimensionality
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs
SIAM Journal on Computing
Global min-cuts in RNC, and other ramifications of a simple min-out algorithm
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Derandomizing Approximation Algorithms Based on Semidefinite Programming
SIAM Journal on Computing
New approaches to covering and packing problems
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Database-friendly random projections
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Derandomized dimensionality reduction with applications
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Solving Some Discrepancy Problems in NC
Proceedings of the 17th Conference on Foundations of Software Technology and Theoretical Computer Science
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Stable distributions, pseudorandom generators, embeddings and data stream computation
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
A fast parallel algorithm for the maximal independent set problem
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
The complexity of approximate counting
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
A complexity theoretic approach to randomness
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Algorithmic Applications of Low-Distortion Geometric Embeddings
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
The geometry of graphs and some of its algorithmic applications
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
An elementary proof of a theorem of Johnson and Lindenstrauss
Random Structures & Algorithms
Database-friendly random projections: Johnson-Lindenstrauss with binary coins
Journal of Computer and System Sciences - Special issu on PODS 2001
An approximation algorithm for scheduling two parallel machines with capacity constraints
Discrete Applied Mathematics
Compact name-independent routing with minimum stretch
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Approximation algorithms for combinatorial auctions with complement-free bidders
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Pseudorandom walks on regular digraphs and the RL vs. L problem
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
On the randomness complexity of efficient sampling
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Stable distributions, pseudorandom generators, embeddings, and data stream computation
Journal of the ACM (JACM)
Ultra-low-dimensional embeddings for doubling metrics
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Near Optimal Dimensionality Reductions That Preserve Volumes
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Explicit construction of a small epsilon-net for linear threshold functions
Proceedings of the forty-first annual ACM symposium on Theory of computing
Ultra-low-dimensional embeddings for doubling metrics
Journal of the ACM (JACM)
Pseudorandom generators for polynomial threshold functions
Proceedings of the forty-second ACM symposium on Theory of computing
Truthful mechanisms for exhibitions
WINE'10 Proceedings of the 6th international conference on Internet and network economics
Approximation algorithms for non-single-minded profit-maximization problems with limited supply
WINE'10 Proceedings of the 6th international conference on Internet and network economics
S-T connectivity on digraphs with a known stationary distribution
ACM Transactions on Algorithms (TALG)
Pseudorandom generators for combinatorial shapes
Proceedings of the forty-third annual ACM symposium on Theory of computing
Pseudo-random graphs and bit probe schemes with one-sided error
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Almost optimal explicit Johnson-Lindenstrauss families
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Explicit Construction of a Small $\epsilon$-Net for Linear Threshold Functions
SIAM Journal on Computing
Derandomized constructions of k-wise (almost) independent permutations
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Derandomization of dimensionality reduction and SDP based algorithms
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Explicit Dimension Reduction and Its Applications
SIAM Journal on Computing
| Hi-index | 0.01 |
We point out how the methods of Nisan [31, 32], originally developed for derandomizing space-bounded computations, may be applied to obtain polynomial-time and NC derandomizations of several probabilistic algorithms. Our list includes the randomized rounding steps of linear and semi-definite programming relaxations of optimization problems, parallel derandomization of discrepancy-type problems, and the Johnson--Lindenstrauss lemma, to name a few.A fascinating aspect of this style of derandomization is the fact that we often carry out the derandomizations directly from the statements about the correctness of probabilistic algorithms, rather than carefully mimicking their proofs.