Interpolation Search for Non-Independent Data

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 15, Issue , 2004, Pages 522-523

  Demaine, Erik D ^a   Jones, Thouis ^a   Pǎtraşcu, Mihai ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY SEARCH TREE; NON-INDEPENDENT DATA; PSEUDORANDOMNESS;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; COSTS; DATA STRUCTURES; INTERPOLATION; POLYNOMIALS; PROBABILITY DISTRIBUTIONS; THEOREM PROVING;

DATA REDUCTION;

EID: 1842592026     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (7)

1. A. Andersson and C. Mattsson. Dynamic Interpolation Search in o(log log n) Time. Proceedings of ICALP, pages 15-27, 1993.
2. G. Gonnet, L. Rogers, and G. George. An algorithmic and complexity analysis of interpolation search. Acta Inf., 13(1):39-52, 1980.
3. K. Mehlhorn and A. Tsakalidis. Dynamic Interpolation Search. Journal of the ACM, 40(3):621-634, July 1993.
4. Y. Perl, A. Itai, and H. Avni. Interpolation search - A log log N search. CACM, 21(7):550-554, 1978.
5. W. W. Peterson. Addressing for Random-Access Storage. IBM J. Res. Development, 1(4):130-146, 1957.
6. D. Willard. Searching unindexed and nonuniformly generated les in log log N time. SIAM J. Comput., 14:1013-1029, 1985.
7. A. C. Yao and F. F. Yao. The complexity of searching an ordered random table. Proceedings of FOCS, pages 173-177, 1976.