1

ANDERSON, S. S. Graph Theory and Finite Combinatorics. Markham, Chicago, 1970.

2

S. R. Arora , W. T. Dent, Randomized binary search technique, Communications of the ACM, v.12 n.2, p.77-80, Feb. 1969  [doi>10.1145/362848.362856]

3

BAYER, R.; AND MCCREIGHT, E. "Organization and maintenance of large ordered indices." Proc. 1970 ACM-SICFIDET Workshop on Data Description and Access., 107-141.

4

James R. Bell, The quadratic quotient method: a hash code eliminating secondary clustering, Communications of the ACM, v.13 n.2, p.107-109, Feb 1970  [doi>10.1145/362007.362040]

5

Burton H. Bloom, Space/time trade-offs in hash coding with allowable errors, Communications of the ACM, v.13 n.7, p.422-426, July 1970  [doi>10.1145/362686.362692]

6

DE LA BRIANDAIS, R . "File searching using variable length keys." Proc. 1959 Western Joint Computing Conference, pp. 295-298.

7

BUCCHOLZ, W. "File organization and addressing." IBM Systems Journal (June 1963), 80-111.

8

Harry A. Clampett, Jr., Randomized binary searching with tree structures, Communications of the ACM, v.7 n.3, p.163-165, March 1964  [doi>10.1145/363958.363987]

9

E. G. Coffman, Jr. , J. Eve, File structures using hashing functions, Communications of the ACM, v.13 n.7, p.427-432, July 1970  [doi>10.1145/362686.362693]

10

A. Colin Day, Full table quadratic searching for scatter storage, Communications of the ACM, v.13 n.8, p.481-482, Aug. 1970  [doi>10.1145/362705.362709]

11

Phillip Deuel, On a storage mapping function for data structures, Communications of the ACM, v.9 n.5, p.344-347, May 1966  [doi>10.1145/355592.365632]

12

C. C. Foster, Information retrieval: information storage and retrieval using AVL trees, Proceedings of the 1965 20th national conference, p.192-205, August 24-26, 1965, Cleveland, Ohio, United States  [doi>10.1145/800197.806043]

13

Edward Fredkin, Trie memory, Communications of the ACM, v.3 n.9, p.490-499, September 1960  [doi>10.1145/367390.367400]

14

HEISING, W.P. "Note on random addressing techniques." IBM Systems Journal (June 1963), 112-116.

15

Thomas N. Hibbard, Some Combinatorial Properties of Certain Trees With Applications to Searching and Sorting, Journal of the ACM (JACM), v.9 n.1, p.13-28, Jan. 1962  [doi>10.1145/321105.321108]

16

HOFFMAN, S. A. "Data structures that generalize rectangular arrays." AFIPS Conference Proceedings 1962 Joint Computer Conference, pp. 325-333.

17

HOPGOOD, F. R. A. Compiling Techniques. American Elsevier, New York, 1969.

18

Kenneth E. Iverson, A Programming Language., John Wiley & Sons, 1962

19

L. R. Johnson, An indirect chaining method for addressing on secondary keys, Communications of the ACM, v.4 n.5, p.218-222, May 1961  [doi>10.1145/366532.366540]

20

Donald E. Knuth, The art of computer programming, volume 3: (2nd ed.) sorting and searching, Addison Wesley Longman Publishing Co., Inc., Redwood City, CA, 1998

21

LANDAUER, W. I. "The balanced tree and its utilization in information retrieval." IEEE Trans. Electron Computers EC-12, 5 (Dec. 1963), 863-871.

22

V. Y. Lum , P. S. T. Yuen , M. Dodd, Key-to-address transform techniques: a fundamental performance study on large existing formatted files, Communications of the ACM, v.14 n.4, p.228-239, April 1971  [doi>10.1145/362575.362578]

23

W. D. Maurer, Programming Technique: An improved hash code for scatter storage, Communications of the ACM, v.11 n.1, p.35-38, Jan. 1968  [doi>10.1145/362851.362880]

24

M. D. Mc Ilroy, A variant method of file searching, Communications of the ACM, v.6 n.3, p.101, March 1963  [doi>10.1145/366274.366304]

25

Robert Morris, Scatter storage techniques, Communications of the ACM, v.11 n.1, p.38-44, Jan. 1968  [doi>10.1145/362851.362882]

26

Charles A. Olson, Random access file organization for indirectly addressed records, Proceedings of the 1969 24th national conference, p.539-549, August 26-28, 1969  [doi>10.1145/800195.805959]

27

PETERSON, W. W. "Addressing for random access storage." IBM Journal of Research and Development 1 (April 1957), 130-146.

28

Charles E. Radke, The use of quadratic residue research, Communications of the ACM, v.13 n.2, p.103-105, Feb 1970  [doi>10.1145/362007.362036]

29

ROCHE, D. J. M. "Practical aspects of randomizing." IFIP, ADP Group, IAG, File Organization and Search Techniques Seminar Notes (Nov. 1969), C1-C24.

30

G. Schay, Jr. , W. G. Spruth, Analysis of a file addressing method, Communications of the ACM, v.5 n.8, p.459-462, Aug. 1962  [doi>10.1145/368637.368827]

31

A. K. Scidmore , B. L. Weinberg, Storage and search properties of a tree-organized memory system, Communications of the ACM, v.6 n.1, p.28-31, Jan. 1963  [doi>10.1145/366193.366215]

32

Dennis Gordon Severance, Some generalized modeling structures for use in design of file organizations., 1972

33

Edward H. Sussenguth, Jr., Use of tree structures for processing files, Communications of the ACM, v.6 n.5, p.272-279, May 1963  [doi>10.1145/366552.366600]

34

VAN DER POOL, J. A. Optimum Load Factors for Files. IBM Nederland N.V., 1973.

Michael Z. Hanani, An optimal evaluation of Boolean expressions in an online query system, Communications of the ACM, v.20 n.5, p.344-347, May 1977

W. D. Maurer , T. G. Lewis, Hash Table Methods, ACM Computing Surveys (CSUR), v.7 n.1, p.5-19, March 1975

R. Ramesh , A. J. G. Babu , J. Peter Kincaid, Variable-depth trie index optimization: theory and experimental results, ACM Transactions on Database Systems (TODS), v.14 n.1, p.41-74, March 1989

C. C. Chang, The study of an ordered minimal perfect hashing scheme, Communications of the ACM, v.27 n.4, p.384-387, April 1984

Toby J. Teorey , James P. Fry, The Logical Record Access Approach to Database Design, ACM Computing Surveys (CSUR), v.12 n.2, p.179-211, June 1980

Dennis Severance , Ricardo Duhne, A practitioner's guide to addressing algorithms, Communications of the ACM, v.19 n.6, p.314-326, June 1976

Douglas Comer, Ubiquitous B-Tree, ACM Computing Surveys (CSUR), v.11 n.2, p.121-137, June 1979

D. G. Severance , J. V. Carlis, A Practical Approach to Selecting Record Access Paths, ACM Computing Surveys (CSUR), v.9 n.4, p.259-272, Dec. 1977

Douglas Comer , Ravi Sethi, The Complexity of Trie Index Construction, Journal of the ACM (JACM), v.24 n.3, p.428-440, July 1977

Chris Faloutsos, Access methods for text, ACM Computing Surveys (CSUR), v.17 n.1, p.49-74, March 1985

J. Nievergelt, Binary Search Trees and File Organization, ACM Computing Surveys (CSUR), v.6 n.3, p.195-207, Sept. 1974

C. T. Yu , M. K. Siu , K. Lam , M. Ozsoyoglu, Performance analysis of three related assignment problems, Proceedings of the 1979 ACM SIGMOD international conference on Management of data, May 30-June 01, 1979, Boston, Massachusetts

Allen Reiter, Some experiments in directory organization - a simulation study, Proceedings of the 1976 ACM SIGMETRICS conference on Computer performance modeling measurement and evaluation, p.1-9, March 29-31, 1976, Cambridge, Massachusetts, United States

Renzo Sprugnoli, Perfect hashing functions: a single probe retrieving method for static sets, Communications of the ACM, v.20 n.11, p.841-850, Nov. 1977

Allen Reiter, Some experiments in directory organization: a simulation study, ACM SIGSIM Simulation Digest, v.7 n.3, p.21-29, April 1976

S. B. Yao, Tree structures construction using key densities, Proceedings of the 1975 annual conference, p.337-342, January 1975

James Tomayko, Anecdotes, IEEE Annals of the History of Computing, v.19 n.4, p.47-53, October 1997

Steffen Heinz , Justin Zobel , Hugh E. Williams, Burst tries: a fast, efficient data structure for string keys, ACM Transactions on Information Systems (TOIS), v.20 n.2, p.192-223, April 2002

Jun-ichi Aoe, A compendium of key search references, ACM SIGIR Forum, v.24 n.3, p.26-42, Fall 1990

Nikolas Askitis , Ranjan Sinha, HAT-trie: a cache-conscious trie-based data structure for strings, Proceedings of the thirtieth Australasian conference on Computer science, p.97-105, January 30-February 02, 2007, Ballarat, Victoria, Australia

Wei-Pang Yang , M. W. Du, A Dynamic Perfect Hash Function Defined by an Extended Hash Indicator Table, Proceedings of the 10th International Conference on Very Large Data Bases, p.245-254, August 27-31, 1984

Allen Reiter, Data models for secondary storage representations, Proceedings of the 1st International Conference on Very Large Data Bases, September 22-24, 1975, Framingham, Massachusetts

M. H. McKinney, Variable-length hash area entries, Proceedings of the June 13-16, 1977, national computer conference, June 13-16, 1977, Dallas, Texas

Nikolas Askitis , Justin Zobel, B-tries for disk-based string management, The VLDB Journal — The International Journal on Very Large Data Bases, v.18 n.1, p.157-179, January 2009

Dennis G. Severance: colleagues