Storing a Sparse Table with 0(1) Worst Case Access Time

Journal of the ACM (JACM)

Volumn 31, Issue 3, 1984, Pages 538-544

  Fredman, Michael L ^a   Komlós, János ^a   Szemerédi, Endre ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b Mathematical Institute ^*  (Hungary)

Author keywords

complexit; Hashin; sparse tables

Indexed keywords

COMPUTER PROGRAMMING - ALGORITHMS;

ACCESS TIME; HASHING; QUERY ALGORITHMS; SPARSE TABLES;

DATA PROCESSING;

EID: 0021467937     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/828.1884     Document Type: Article

References (4)

1. JAESCHKE, G. Reciprocal hashing: A method for generating minimal perfect hashing functtons. Commun. ACM 24, 12 (Dec. 1981), 829-833.
2. SPRUGNOLI, R. Perfect hashing functions: A single probe retrieving method for static sets. Commun. ACM 20, 11 (Nov. 1977), 841-850.
3. TARJAN, R. E., AND YAO, A.C.-C. Storing a sparse table. Commun. ACM 21, 11 (Nov. 1979), 606-611.
4. YAO, A.C.-C. Should tables be sorted? J. ACM 28, 3 (July 1981), 615-628.