The complexity of searching an ordered random table
- 1 October 1976
- conference paper
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 173-177
- https://doi.org/10.1109/sfcs.1976.32
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Partial-Match Retrieval AlgorithmsSIAM Journal on Computing, 1976
- A Note on the Efficiency of Hashing FunctionsJournal of the ACM, 1972
- Parallel minimax search for a maximumJournal of Combinatorial Theory, 1968
- Addressing for Random-Access StorageIBM Journal of Research and Development, 1957