The complexity of parallel search
- 30 April 1988
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 36 (2), 225-253
- https://doi.org/10.1016/0022-0000(88)90027-x
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- A Simple Parallel Algorithm for the Maximal Independent Set ProblemSIAM Journal on Computing, 1986
- Constructing a perfect matching is in random NCCombinatorica, 1986
- Three Versions of a Group Testing GameSIAM Journal on Algebraic Discrete Methods, 1984
- Algorithmic versus axiomatic definitions of matroidsPublished by Springer Nature ,1981
- Fast probabilistic algorithms for hamiltonian circuits and matchingsJournal of Computer and System Sciences, 1979
- The tail of the hypergeometric distributionDiscrete Mathematics, 1979
- Probability Inequalities for Sums of Bounded Random VariablesJournal of the American Statistical Association, 1963