Expected Complexity of Fast Search with Uniformly Distributed Data

Authors

Gilbert N. Lewis, Michigan Technological UniversityFollow
Nancy J. Boynton, Michigan Technological University
F. Warren Burton, University of East Anglia

Document Type

Article

Publication Date

10-1981

Department

Department of Mathematical Sciences; Department of Computer Science

Abstract

No abstract provided

Publisher's Statement

© 1981

Publication Title

Information Processing Letters

Recommended Citation

Lewis, G. N., Boynton, N., & Burton, F. (1981). Expected Complexity of Fast Search with Uniformly Distributed Data. Information Processing Letters, 13(1), 4-7. http://doi.org/10.1016/0020-0190(81)90140-X
Retrieved from: https://digitalcommons.mtu.edu/michigantech-p/5274