Graph algorithms and NP-completeness
Graph algorithms and NP-completeness
Data structures and algorithms 3: multi-dimensional searching and computational geometry
Data structures and algorithms 3: multi-dimensional searching and computational geometry
Communications of the ACM
How to generate cryptographically strong sequences of pseudo-random bits
SIAM Journal on Computing
Number theory in science and communication
Number theory in science and communication
Approximate counting: a detailed analysis
BIT - Ellis Horwood series in artificial intelligence
Communicating sequential processes
Communicating sequential processes
A fast parallel algorithm for the maximal independent set problem
Journal of the ACM (JACM)
Probabilistic counting algorithms for data base applications
Journal of Computer and System Sciences
Combinatorics, complexity, and randomness
Communications of the ACM
Computational complexity of sequential and parallel algorithms
Computational complexity of sequential and parallel algorithms
How to construct random functions
Journal of the ACM (JACM)
Simulating probabilistic by deterministic algebraic computation trees
Theoretical Computer Science
A fast and simple randomized parallel algorithm for the maximal independent set problem
Journal of Algorithms
Generating quasi-random sequences from semi-random sources
Journal of Computer and System Sciences
Random generation of combinatorial structures from a uniform
Theoretical Computer Science
How hard is it to marry at random? (On the approximation of the permanent)
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Private coins versus public coins in interactive proof systems
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Almost all primes can be quickly certified
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
A simple unpredictable pseudo random number generator
SIAM Journal on Computing
Constructing a perfect matching is in random NC
Combinatorica
Sums of divisors, perfect numbers and factoring
SIAM Journal on Computing
The knowledge complexity of interactive proof-systems
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
An O(lg n) expected rounds randomized Byzantine generals protocol
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Trading group theory for randomness
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Deterministic simulation in LOGSPACE
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Some consequences of the existence of pseudorandom generators
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Efficiency considerations in using semi-random sources
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Imperfect random sources and discrete controlled processes
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
The complexity of perfect zero-knowledge
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Zero knowledge proofs of identity
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Recognizing primes in random polynomial time
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Matching is as easy as matrix inversion
Combinatorica
Does co-NP have short interactive proofs?
Information Processing Letters
A lower bound for probabilistic distributed algorithms
Journal of Algorithms
A note on randomized polynomial time
SIAM Journal on Computing
Zero-knowledge simulation of Boolean circuits
Proceedings on Advances in cryptology---CRYPTO '86
Algorithmics: the spirit of computing
Algorithmics: the spirit of computing
Randomized parallel communications on an extension of the omega network
Journal of the ACM (JACM)
Algorithmics: theory & practice
Algorithmics: theory & practice
Unbiased bits from sources of weak randomness and probabilistic communication complexity
SIAM Journal on Computing - Special issue on cryptography
Arthur-Merlin games: a randomized proof system, and a hierarchy of complexity class
Journal of Computer and System Sciences - 17th Annual ACM Symposium in the Theory of Computing, May 6-8, 1985
Expanders, randomness, or time versus space
Journal of Computer and System Sciences - Structure in Complexity Theory Conference, June 2-5, 1986
Probabilistic computation of integer polynomial GCDs
Journal of Algorithms
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
The generation of random numbers that are probably prime
Journal of Cryptology
The average complexity of deterministic and randomized parallel comparison-sorting algorithms
SIAM Journal on Computing
Completeness theorems for non-cryptographic fault-tolerant distributed computation
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Multiparty unconditionally secure protocols
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Non-interactive zero-knowledge and its applications
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Multi-prover interactive proofs: how to remove intractability assumptions
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Randomized algorithms and pseudorandom numbers
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
The bit complexity of randomized leader election on a ring
SIAM Journal on Computing
Parallel algorithms for term matching
SIAM Journal on Computing
Monte-Carlo approximation algorithms for enumeration problems
Journal of Algorithms
Two applications of inductive counting for complementation problems
SIAM Journal on Computing
Optimal and sublogarithmic time randomized parallel sorting algorithms
SIAM Journal on Computing
Maximum matchings in general graphs through randomization
Journal of Algorithms
Minimum-knowledge interactive proofs for decision problems
SIAM Journal on Computing
Multiparty protocols and logspace-hard pseudorandom sequences
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Pseudo-random generation from one-way functions
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Designing programs that check their work
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
An O(logN) deterministic packet routing scheme
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Polling: a new randomized sampling technique for computational geometry
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
On the improbability of reaching Byzantine agreements
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
The two-processor scheduling problem is in random NC
SIAM Journal on Computing
SIAM Journal on Computing
Computing
A linear-time probabilistic counting algorithm for database applications
ACM Transactions on Database Systems (TODS)
Skip lists: a probabilistic alternative to balanced trees
Communications of the ACM
Parallel depth-first search in general directed graphs
SIAM Journal on Computing
Flipping persuasively in constant time
SIAM Journal on Computing
Introduction to algorithms
Applications of random sampling in computational geometry, II
Discrete & Computational Geometry - Selected papers from the fourth ACM symposium on computational geometry, Univ. of Illinois, Urbana-Champaign, June 6 8, 1988
Uniform generation of random regular graphs of moderate degree
Journal of Algorithms
Fast randomized consensus using shared memory
Journal of Algorithms
Partitioning arrangements of lines, part II: applications
Discrete & Computational Geometry
MFCS '90 Proceedings on Mathematical foundations of computer science 1990
Non-interactive zero-knowledge with preprocessing
CRYPTO '88 Proceedings on Advances in cryptology
A new universal class of hash functions and dynamic hashing in real time
Proceedings of the seventeenth international colloquium on Automata, languages and programming
Partitioning arrangements of lines, part I: an efficient deterministic algorithm
Discrete & Computational Geometry - Selected papers from the fifth annual ACM symposium on computational geometry, Saarbrücken, Germany, June 5-11, 1989
A time complexity gap for two-way probabilistic finite-state automata
SIAM Journal on Computing
Self-testing/correcting with applications to numerical problems
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
How to distribute a dictionary in a complete network
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
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
On the power of randomization in online algorithms
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Pseudo-random generators under uniform assumptions
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Perfect zero-knowledge in constant rounds
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
A random polynomial-time algorithm for approximating the volume of convex bodies
Journal of the ACM (JACM)
Uses of randomness in algorithms and protocols
Uses of randomness in algorithms and protocols
High probability parallel transitive-closure algorithms
SIAM Journal on Computing
Handbook of algorithms and data structures: in Pascal and C (2nd ed.)
Handbook of algorithms and data structures: in Pascal and C (2nd ed.)
Fast approximation algorithms for multicommodity flow problems
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
PP is closed under intersection
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Local expansion of vertex-transitive graphs and random generation in finite groups
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Probabilistic recurrence relations
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Converting high probability into nearly-constant time—with applications to parallel hashing
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Realistic analysis of some randomized algorithms
Journal of Computer and System Sciences
The spatial complexity of oblivious k-probe Hash functions
SIAM Journal on Computing
Lower bounds to randomized algorithms for graph properties
Journal of Computer and System Sciences
Statistical zero-knowledge languages can be recognized in two rounds
Journal of Computer and System Sciences
Tests for permutation polynomials
SIAM Journal on Computing
A catalog of complexity classes
Handbook of theoretical computer science (vol. A)
Average-case analysis of algorithms and data structures
Handbook of theoretical computer science (vol. A)
Journal of the ACM (JACM)
Computational Geometry: Theory and Applications
Non-interactive oblivious transfer and applications
CRYPTO '89 Proceedings on Advances in cryptology
An optimal randomized parallel algorithm for finding connected components in a graph
SIAM Journal on Computing
SIAM Journal on Computing
Parallel tree contraction part 2: further applications
SIAM Journal on Computing
Simulating BPP using a general weak random source
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Dynamic maintenance of geometric structures made easy
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Order-preserving minimal perfect hash functions and information retrieval
ACM Transactions on Information Systems (TOIS) - Special issue on research and development in information retrieval
An a Priori Approach to the Evaluation of Signature Analysis Efficiency
IEEE Transactions on Computers
Practical minimal perfect hash functions for large databases
Communications of the ACM
New algorithms for an ancient scheduling problem
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Methods for message routing in parallel machines
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Computing Frobenius maps and factoring polynomials
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Simple algorithms for routing on butterfly networks with bounded queues
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Randomized versus nondeterministic communication complexity
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
Efficient PRAM simulation on a distributed memory machine
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
On the parallel complexity of computing a maximal independent set in a hypergraph
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
A subexponential randomized simplex algorithm (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Making zero-knowledge provers efficient
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
A note on efficient zero-knowledge proofs and arguments (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
A parallel randomized approximation scheme for shortest paths
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
e-approximations with minimum packing constraint violation (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Probably approximate learning over classes of distributions
SIAM Journal on Computing
Counting classes are at least as hard as the polynomial-time hierarchy
SIAM Journal on Computing
The average complexity of parallel comparison merging
SIAM Journal on Computing
Applications of random sampling to on-line algorithms in computational geometry
Discrete & Computational Geometry
Probabilistic estimation of the number of prefixes of a trace
Theoretical Computer Science
Theoretical Computer Science
An optimal algorithm for generating minimal perfect hash functions
Information Processing Letters
Journal of the ACM (JACM)
Fast Algorithms for Routing Around Faults in Multibutterflies and Randomly-Wired Splitter Networks
IEEE Transactions on Computers - Special issue on fault-tolerant computing
Multi-oracle interactive protocols with constant space verifiers
Journal of Computer and System Sciences
On the randomized construction of the Delaunay tree
Theoretical Computer Science
Two probabilistic results on merging
SIAM Journal on Computing
Optimal randomized algorithms for local sorting and set-maxima
SIAM Journal on Computing
Coin-flipping games immune against linear-sized coalitions
SIAM Journal on Computing
Circuit size relative to pseudorandom oracles
Theoretical Computer Science - Special issue on structure in complexity theory
The computational complexity of universal hashing
Theoretical Computer Science - Special issue on structure in complexity theory
On read-once vs. multiple access to randomness in logspace
Theoretical Computer Science - Special issue on structure in complexity theory
Fully dynamic Delaunay triangulation in logarithmic expected time per operation
Computational Geometry: Theory and Applications
On lines missing polyhedral sets in 3-space
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
A linear-time randomized algorithm for the bounded Voronoi diagram of a simple polygon
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Fast asynchronous Byzantine agreement with optimal resilience
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Lower bounds for randomized mutual exclusion
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
More deterministic simulation in logspace
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Efficient probabilistically checkable proofs and applications to approximations
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Probabilistically checkable debate systems and approximation algorithms for PSPACE-hard functions
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
An Õ(n2) algorithm for minimum cuts
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
The probabilistic method yields deterministic parallel algorithms
Proceedings of the 30th IEEE symposium on Foundations of computer science
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
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
Random Weighted Laplacians, Lovász minimum digraphs and finding minimum separators
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Efficient randomized algorithms for the repeated median line estimator
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Approximate nearest neighbor queries in fixed dimensions
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Randomized data structures for the dynamic closest-pair problem
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Chernoff-Hoeffding bounds for applications with limited independence
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Dynamic generation of discrete random variates
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
On traversing layered graphs on-line
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Searching in an unknown environment: an optimal randomized algorithm for the cow-path problem
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Fast construction of irreducible polynomials over finite fields
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Reaching Agreement in the Presence of Faults
Journal of the ACM (JACM)
Fast Probabilistic Algorithms for Verification of Polynomial Identities
Journal of the ACM (JACM)
Fast asynchronous Byzantine agreement (extended abstract)
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
Output Guards and Nondeterminism in “Communicating Sequential Processes”
ACM Transactions on Programming Languages and Systems (TOPLAS)
Synchronization in Distributed Programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
An O(nlog n) Unidirectional Algorithm for the Circular Extrema Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
An Effective Implementation for the Generalized Input-Output Construct of CSP
ACM Transactions on Programming Languages and Systems (TOPLAS)
Real-Time Synchronization of Interprocess Communications
ACM Transactions on Programming Languages and Systems (TOPLAS)
The study of an ordered minimal perfect hashing scheme
Communications of the ACM
Reciprocal hashing: a method for generating minimal perfect hashing functions
Communications of the ACM
Minimal perfect hash functions made simple
Communications of the ACM
Multidimensional divide-and-conquer
Communications of the ACM
An improved algorithm for decentralized extrema-finding in circular configurations of processes
Communications of the ACM
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Communicating sequential processes
Communications of the ACM
Perfect hashing functions: a single probe retrieving method for static sets
Communications of the ACM
Monitors: an operating system structuring concept
Communications of the ACM
Simulation and the Monte Carlo Method
Simulation and the Monte Carlo Method
POPL '81 Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Perfect Hashing Functions for Hardware Applications
Proceedings of the Seventh International Conference on Data Engineering
Probabilistic algorithms for sparse polynomials
EUROSAM '79 Proceedings of the International Symposiumon on Symbolic and Algebraic Computation
Non-Interactive Zero-Knowledge Proof Systems
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Crptograpic Applications of the Non-Interactive Metaproof and Many-Prover Systems
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
Recent Directions in Algorithmic Research
Proceedings of the 5th GI-Conference on Theoretical Computer Science
Detecting False Matches in String Matching Algorithms
CPM '93 Proceedings of the 4th Annual Symposium on Combinatorial Pattern Matching
Polynomial Hash Functions Are Reliable (Extended Abstract)
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
Probabilistic, nondeterministic, and alternating decision trees (Preliminary Version)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Las Vegas is better than determinism in VLSI and distributed computing (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Universal schemes for parallel communication
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Universal classes of hash functions (Extended Abstract)
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Riemann's Hypothesis and tests for primality
STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing
Local and global properties in networks of processors (Extended Abstract)
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Randomized parallel communication (Preliminary Version)
PODC '82 Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
Randomized speed-ups in parallel computation
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
The Complexity of Parallel Computations
The Complexity of Parallel Computations
Efficient randomized pattern-matching algorithms
IBM Journal of Research and Development - Mathematics and computing
Introduction to probabilistic automata (Computer science and applied mathematics)
Introduction to probabilistic automata (Computer science and applied mathematics)
Partial correctness for probabilistic demonic programs
Theoretical Computer Science
Reasoning about Probabilistic Lossy Channel Systems
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Randomized Non-sequential Processes
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
The verification System by Dense Timing Constraints and Probabilitie
SEEP '96 Proceedings of the 1996 International Conference on Software Engineering: Education and Practice (SE:EP '96)
Analysis of a randomized rendezvous algorithm
Information and Computation
Applications of Probabilistic Quorums to Iterative Algorithms
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
Hundreds of impossibility results for distributed computing
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
A combinatorial error bound for t-point-based sampling
Theoretical Computer Science
Randomized registers and iterative algorithms
Distributed Computing
Using random sampling to build approximate tries for efficient string sorting
Journal of Experimental Algorithmics (JEA)
Distributing Multimedia Content to Balance Quality of Service and Cost
Journal of Management Information Systems
A system for induction of oblique decision trees
Journal of Artificial Intelligence Research
Abstract compositional analysis of iterated relations: a structural approach to complex state transition systems
How fast and fat is your probabilistic model checker? an experimental performance comparison
HVC'07 Proceedings of the 3rd international Haifa verification conference on Hardware and software: verification and testing
Model checking probabilistic systems against pushdown specifications
Information Processing Letters
Fault detection of hierarchical networks with probabilistic testing algorithms
TestCom'05 Proceedings of the 17th IFIP TC6/WG 6.1 international conference on Testing of Communicating Systems
| Hi-index | 0.01 |
Probabilistic, or randomized, algorithms are fast becoming as commonplace as conventional deterministic algorithms. This survey presents five techniques that have been widely used in the design of randomized algorithms. These techniques are illustrated using 12 randomized algorithms—both sequential and distributed— that span a wide range of applications, including:primality testing (a classical problem in number theory), interactive probabilistic proof systems (a new method of program testing), dining philosophers (a classical problem in distributed computing), and Byzantine agreement (reaching agreement in the presence of malicious processors). Included with each algorithm is a discussion of its correctness and its computational complexity. Several related topics of interest are also addressed, including the theory of probabilistic automata, probabilistic analysis of conventional algorithms, deterministic amplification, and derandomization of randomized algorithms. Finally, a comprehensive annotated bibliography is given.