An introduction to randomized algorithms
- 1 November 1991
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 34 (1-3) , 165-201
- https://doi.org/10.1016/0166-218x(91)90086-c
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- A Monte-Carlo Algorithm for Estimating the PermanentSIAM Journal on Computing, 1993
- A Simple Parallel Algorithm for the Maximal Independent Set ProblemSIAM Journal on Computing, 1986
- Monte-Carlo algorithms for the planar multiterminal network reliability problemJournal of Complexity, 1985
- Self-adjusting binary search treesJournal of the ACM, 1985
- How to Generate Cryptographically Strong Sequences of Pseudorandom BitsSIAM Journal on Computing, 1984
- Fast Probabilistic Algorithms for Verification of Polynomial IdentitiesJournal of the ACM, 1980
- Computational Complexity of Probabilistic Turing MachinesSIAM Journal on Computing, 1977
- A Fast Monte-Carlo Test for PrimalitySIAM Journal on Computing, 1977
- Factoring polynomials over large finite fieldsMathematics of Computation, 1970
- The Factorization of Linear GraphsJournal of the London Mathematical Society, 1947