Unbounded Searching Algorithms
- 1 June 1990
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 19 (3) , 522-537
- https://doi.org/10.1137/0219035
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- On the complexity of finding the chromatic number of a recursive graph II: the unbounded caseAnnals of Pure and Applied Logic, 1989
- Searching, Merging, and Sorting in Parallel ComputationIEEE Transactions on Computers, 1983
- Supernatural NumbersPublished by Springer Nature ,1981
- An almost optimal algorithm for unbounded searchingInformation Processing Letters, 1976