1

Rene De La Briandais, File searching using variable length keys, Papers presented at the the March 3-5, 1959, western joint computer conference, p.295-298, March 03-05, 1959, San Francisco, California  [doi>10.1145/1457838.1457895]

2

E. FREDKIN, Trie memory. Informal Memorandum. Bolt Beranek and Newman Inc.. Cambridge, Mass., 23 January 1959.

3

J. C, R. LICKUDER AND N. BURTON, Long range constraints in the statistical structure of printed English. Am. J. Psychol. 68 (1955), 650-653.

4

C. E. SHANNON, Prediction and entropy in printed English. Bell System Tech. J 30 (1951), 50-64.

5

J. C. Shaw , A. Newell , H. A. Simon , T. O. Ellis, A command structure for complex information processing, Proceedings of the May 6-8, 1958, western joint computer conference: contrasts in computers, May 06-08, 1958, Los Angeles, California  [doi>10.1145/1457769.1457803]

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

Luc Devroye, Laws of large numbers and tail inequalities for random tries and PATRICIA trees, Journal of Computational and Applied Mathematics, v.142 n.1, p.27-37, 1 May 2002

W. A. Walker , C. C. Gotlieb, Hybrid trees: A data structure for lists of keys, Proceedings of 1972 ACM-SIGFIDET workshop on Data description, access and control, p.189-211, January 1972

Lawrence J. Mazlack, An empirical comparison: tree and lattice structures for symbolic data bases, ACM SIGIR Forum, v.14 n.2, p.33-40, September 1979

W. A. Martin, Sorting, ACM Computing Surveys (CSUR), v.3 n.4, p.147-174, Dec. 1971

Walter A. Burkhard, Associative retrieval trie hash-coding (Extended Abstract), Proceedings of the eighth annual ACM symposium on Theory of computing, p.211-219, May 03-05, 1976, Hershey, Pennsylvania, United States

Douglas Comer, Heuristics for trie index minimization, ACM Transactions on Database Systems (TODS), v.4 n.3, p.383-395, Sept. 1979

Robert M. Keller , M. R. Sleep, Applicative caching, ACM Transactions on Programming Languages and Systems (TOPLAS), v.8 n.1, p.88-108, Jan. 1986

Hanan Samet, The Quadtree and Related Hierarchical Data Structures, ACM Computing Surveys (CSUR), v.16 n.2, p.187-260, June 1984

Ronald Fagin , Jurg Nievergelt , Nicholas Pippenger , H. Raymond Strong, Extendible hashing—a fast access method for dynamic files, ACM Transactions on Database Systems (TODS), v.4 n.3, p.315-344, Sept. 1979

M. Al-Suwaiyel , E Horowitz, Algorithms for trie compaction, ACM Transactions on Database Systems (TODS), v.9 n.2, p.243-263, June 1984

W. A. Burkhard, Hashing and trie algorithms for partial match retrieval, ACM Transactions on Database Systems (TODS), v.1 n.2, p.175-187, June 1976

Robert C. Minnick, A Survey of Microcellular Research, Journal of the ACM (JACM), v.14 n.2, p.203-241, April 1967

D. S. Batory, Modeling the storage architectures of commercial database systems, ACM Transactions on Database Systems (TODS), v.10 n.4, p.463-528, Dec. 1985

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

Edward H. Sussenguth, Jr., Use of tree structures for processing files, Communications of the ACM, v.6 n.5, p.272-279, May 1963

Ricardo A. Baeza-Yates , Gaston H. Gonnet, Fast text searching for regular expressions or automaton searching on tries, Journal of the ACM (JACM), v.43 n.6, p.915-936, Nov. 1996

Edward H. Sussenguth, Jr., Use of tree structures for processing files, Communications of the ACM, v.26 n.1, p.17-20, Jan. 1983

Steffen Heinz , Justin Zobel, Performance of data structures for small sets of strings, Australian Computer Science Communications, v.24 n.1, p.87-94, January-February 2002

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

Donald R. Morrison, PATRICIA—Practical Algorithm To Retrieve Information Coded in Alphanumeric, Journal of the ACM (JACM), v.15 n.4, p.514-534, Oct. 1968

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

Karen Kukich, Technique for automatically correcting words in text, ACM Computing Surveys (CSUR), v.24 n.4, p.377-439, Dec. 1992

Walid Aref , Daniel Barbará , Padmavathi Vallabhaneni, The handwritten trie: indexing electronic ink, ACM SIGMOD Record, v.24 n.2, p.151-162, May 1995

Dennis G. Severance, Identifier Search Mechanisms: A Survey and Generalized Model, ACM Computing Surveys (CSUR), v.6 n.3, p.175-194, Sept. 1974

Hanan Samet, Hierarchical representations of collections of small rectangles, ACM Computing Surveys (CSUR), v.20 n.4, p.271-309, Dec. 1988

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

Douglas Comer, Analysis of a heuristic for full trie minimization, ACM Transactions on Database Systems (TODS), v.6 n.3, p.513-537, Sept. 1981

Bruce W. Watson, A new regular grammar pattern matching algorithm, Theoretical Computer Science, v.299 n.1-3, p.509-521, 18 April 2003

Kazuro Hamada , Toshimitsu Baba , Ken'ichi Sato , Masanao Yufu, Hybridizing a Genetic Algorithm with Rule-Based Reasoning for Production Planning, IEEE Expert: Intelligent Systems and Their Applications, v.10 n.5, p.60-67, October 1995

Cheng-Lin Liu , Masashi Koga , Hiromichi Fujisawa, Lexicon-Driven Segmentation and Recognition of Handwritten Character Strings for Japanese Address Reading, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.24 n.11, p.1425-1437, November 2002

R. W. P. Luk , D. S. Yeung , Q. Lu , H. L. Leung , S. Y. Li , F. Leung, ASAB: a Chinese screen reader, Software—Practice & Experience, v.33 n.3, p.201-219, March 2003

Mahmoud Youssef , Vijayalakshmi Atluri , Nabil R. Adam, Preserving mobile customer privacy: an access control system for moving objects and customer profiles, Proceedings of the 6th international conference on Mobile data management, May 09-13, 2005, Ayia Napa, Cyprus

Maxime Crochemore , Costas S. Iliopoulos , Thierry Lecroq , Yoan J. Pinzon , Wojciech Plandowski , Wojciech Rytter, Occurrence and substring heuristics for δ-matching, Fundamenta Informaticae, v.56 n.1,2, p.1-21, July 2003

Masaki Oono , Masao Fuketa , Kazuhiro Morita , Shinkaku Kashiji , Jun-ichi Aoe, An improvement key deletion method for double-array structure using single-nodes, Information Processing and Management: an International Journal, v.40 n.1, p.47-63, January 2004

Kazuhiro Morita , El-Sayed Atlam , Masao Fuketa , Kazuhiko Tsuda , Jun-ichi Aoe, Fast and compact updating algorithms of a double-array structure, Information Sciences—Informatics and Computer Science: An International Journal, v.159 n.1-2, p.53-67, 20 January 2004

Tatsuo Yamashita , Yuji Matsumoto, Language independent morphological analysis, Proceedings of the sixth conference on Applied natural language processing, p.232-238, April 29-May 04, 2000, Seattle, Washington

M. D. Brain , A. L. Tharp, Using Tries to Eliminate Pattern Collisions in Perfect Hashing, IEEE Transactions on Knowledge and Data Engineering, v.6 n.2, p.239-247, April 1994

Andrew W. Appel , Guy J. Jacobson, The world's fastest Scrabble program, Communications of the ACM, v.31 n.5, p.572-578, May 1988

Yuriy A. Reznik, Some results on tries with adaptive branching, Theoretical Computer Science, v.289 n.2, p.1009-1026, 30 October 2002

Gerth Stølting Brodal , Rolf Fagerberg, Cache-oblivious string dictionaries, Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm, p.581-590, January 22-26, 2006, Miami, Florida

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

Kurt Maly, Compressed tries, Communications of the ACM, v.19 n.7, p.409-415, July 1976

Walid G. Aref , Ihab F. Ilyas, SP-GiST: An Extensible Database Index for Supporting Space Partitioning Trees, Journal of Intelligent Information Systems, v.17 n.2-3, p.215-240, December 2001

Jun-ichi Aoe, An Efficient Digital Search Algorithm by Using a Double-Array Structure, IEEE Transactions on Software Engineering, v.15 n.9, p.1066-1077, September 1989

Keh-Jiann Chen , Wen Tsuei , Lee-Feng Chien, PAT-trees with the deletion function as the learning device for linguistic patterns, Proceedings of the 17th international conference on Computational linguistics, August 10-14, 1998, Montreal, Quebec, Canada

Witold A. Litwin , Nick Roussopoulos , Gerald Levy , Wang Hong, Trie Hashing with Controlled Load, IEEE Transactions on Software Engineering, v.17 n.7, p.678-691, July 1991

Tim Moors , Antonio Cantoni, Cascading Content-Addressable Memories, IEEE Micro, v.12 n.3, p.56-66, May 1992

Luc Devroye , Carlos Zamora-Cura, Expected worst-case partial match in random quadtries, Discrete Applied Mathematics, v.141 n.1-3, p.103-117, 30 May 2004

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

R. W. P. Luk, Time-Space Trade-Off Analysis of Morphic Trie Images, IEEE Transactions on Knowledge and Data Engineering, v.13 n.6, p.1028-1032, November 2001

Jong-Deok Choi , Keunwoo Lee , Alexey Loginov , Robert O'Callahan , Vivek Sarkar , Manu Sridharan, Efficient and precise datarace detection for multithreaded object-oriented programs, ACM SIGPLAN Notices, v.37 n.5, May 2002

J. A. Orenstein , T. H. Merrett, A class of data structures for associative searching, Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems, April 02-04, 1984, Waterloo, Ontario, Canada

Jun-ichi Aoe , Katsushi Morimoto , Masami Shishibori , Ki-Hong Park, A Trie Compaction Algorithm for a Large Set of Keys, IEEE Transactions on Knowledge and Data Engineering, v.8 n.3, p.476-491, June 1996

Haiquan Li , Jinyan Li , Limsoon Wong , Mengling Feng , Yap-Peng Tan, Relative risk and odds ratio: a data mining perspective, Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, June 13-15, 2005, Baltimore, Maryland

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

S. Mukherjea , L. V. Subramaniam , G. Chanda , S. Sankararaman , R. Kothari , V. Batra , D. Bhardwaj , B. Srivastava, Enhancing a biomedical information extraction system with dictionary mining and context disambiguation, IBM Journal of Research and Development, v.48 n.5/6, p.693-701, September/November 2004

Dana Angluin , James Aspnes , Jiang Chen , Yinghua Wu , Yitong Yin, Fast construction of overlay networks, Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures, July 18-20, 2005, Las Vegas, Nevada, USA

Y. Kadoya , M. Fuketa , El-Sayed Atlam , K. Morita , T. Sumitomo , J. Aoe, A compression algorithm using integrated record information for translation dictionaries, Information Sciences—Informatics and Computer Science: An International Journal, v.165 n.3-4, p.171-186, 19 October 2004

James Aspnes , Gauri Shah, Skip graphs, Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms, January 12-14, 2003, Baltimore, Maryland

Strahil Ristov, LZ trie and dictionary compression, Software—Practice & Experience, v.35 n.5, p.445-465, 25 April 2005

Mon-Yen Luo , Chu-Sing Yang , Chun-Wei Tseng, Content management on server farm with layer-7 routing, Proceedings of the 2002 ACM symposium on Applied computing, March 11-14, 2002, Madrid, Spain

Daniel Gruhl , Daniel N. Meredith , Jan H. Pieper , Alex Cozzi , Stephen Dill, The web beyond popularity: a really simple system for web scale RSS, Proceedings of the 15th international conference on World Wide Web, May 23-26, 2006, Edinburgh, Scotland

James Aspnes , Faith Ellen Fich , Eric Ruppert, Relationships between broadcast and shared memory in reliable anonymous distributed systems, Distributed Computing, v.18 n.3, p.209-219, February 2006

Werner Schachinger, Concentration of Size and Path Length of Tries, Combinatorics, Probability and Computing, v.13 n.4-5, p.763-793, July 2004

G. Badr , B. J. Oommen, On using conditional rotations and randomized heuristics for self-organizing ternary search tries, Proceedings of the 43rd annual southeast regional conference, March 18-20, 2005, Kennesaw, Georgia

Kai Zheng , Chengchen Hu , Hongbin Lu , Bin Liu, A TCAM-based distributed parallel IP lookup scheme and performance analysis, IEEE/ACM Transactions on Networking (TON), v.14 n.4, p.863-875, August 2006

T. H. Merrett, Aldat: A retrospective on a work in progress, Information Systems, v.32 n.4, p.505-544, June, 2007

James F. Wirth, Box English - preparing for CS1, Proceedings of the 44th annual southeast regional conference, March 10-12, 2006, Melbourne, Florida

Markus Dickinson , W. Detmar Meurers, Detecting errors in discontinuous structural annotation, Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics, p.322-329, June 25-30, 2005, Ann Arbor, Michigan

Frode Eika Sandnes , Andre Aubert, Bimanual text entry using game controllers: Relying on users' spatial familiarity with QWERTY, Interacting with Computers, v.19 n.2, p.140-150, March, 2007

Susumu Yata , Masaki Oono , Kazuhiro Morita , Masao Fuketa , Toru Sumitomo , Jun-ichi Aoe, A compact static double-array keeping character codes, Information Processing and Management: an International Journal, v.43 n.1, p.237-247, January 2007

Tetsuya Watanabe , Youji Iiguni, Adaptive peak frequency estimation using a database of PARCOR coefficients, EURASIP Journal on Applied Signal Processing, v.2005 n.1, p.1127-1136, 1 January 2005

Lih-Chyau Wuu , Tzong-Jye Liu , Kuo-Ming Chen, A longest prefix first search tree for IP lookup, Computer Networks: The International Journal of Computer and Telecommunications Networking, v.51 n.12, p.3354-3367, August, 2007

Chun-Wei Tseng , Chu-Sing Yang, System support for web hosting services on server clusters, Computers and Electrical Engineering, v.33 n.3, p.208-220, May, 2007

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

G. Richards , V. J. Rayward-Smith, The discovery of association rules from tabular databases comprising nominal and ordinal attributes, Intelligent Data Analysis, v.9 n.3, p.289-307, May 2005

Marios Hadjieleftheriou , Erik Hoel , Vassilis J. Tsotras, SaIL: A Spatial Index Library for Efficient Application Integration, Geoinformatica, v.9 n.4, p.367-389, December 2005

Sören Sonnenburg , Gunnar Rätsch , Christin Schäfer , Bernhard Schölkopf, Large Scale Multiple Kernel Learning, The Journal of Machine Learning Research, 7, p.1531-1565, 12/1/2006

John Yiannis , Justin Zobel, Compression techniques for fast external sorting, The VLDB Journal — The International Journal on Very Large Data Bases, v.16 n.2, p.269-291, April 2007

Jack A. Orenstein, A Dynamic Hash File for Random and Sequential Accessing, Proceedings of the 9th International Conference on Very Large Data Bases, p.132-141, October 31-November 02, 1983

Susumu Yata , Masaki Oono , Kazuhiro Morita , Masao Fuketa , Jun-Ichi Aoe, An efficient deletion method for a minimal prefix double array: Research Articles, Software—Practice & Experience, v.37 n.5, p.523-534, April 2007

Mohamed Y. Eltabakh , Wing-Kai Hon , Rahul Shah , Walid G. Aref , Jeffrey S. Vitter, The SBC-tree: an index for run-length compressed sequences, Proceedings of the 11th international conference on Extending database technology: Advances in database technology, March 25-29, 2008, Nantes, France

Yunbo Cao , Huizhong Duan , Chin-Yew Lin , Yong Yu , Hsiao-Wuen Hon, Recommending questions using the mdl-based tree cut model, Proceeding of the 17th international conference on World Wide Web, April 21-25, 2008, Beijing, China

Luc Devroye , Gabor Lugosi , Gahyun Park , Wojciech Szpankowski, Multiple choice tries and distributed hash tables, Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms, p.891-899, January 07-09, 2007, New Orleans, Louisiana

Erin W. Chambers , Jeff Erickson , Pratik Worah, Testing contractibility in planar rips complexes, Proceedings of the twenty-fourth annual symposium on Computational geometry, June 09-11, 2008, College Park, MD, USA

James Aspnes , Gauri Shah, Skip graphs, ACM Transactions on Algorithms (TALG), v.3 n.4, p.37-es, November 2007

Siegfried Nijssen , Elisa Fromont, Mining optimal decision trees from itemset lattices, Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining, August 12-15, 2007, San Jose, California, USA

Keith So, Enforcing long-path timing closure for FPGA routing with path searches on clamped lexicographic spirals, Proceedings of the 16th international ACM/SIGDA symposium on Field programmable gate arrays, February 24-26, 2008, Monterey, California, USA

Aleksandar Stojmirović , Vladimir Pestov, Indexing schemes for similarity search in datasets of short protein fragments, Information Systems, v.32 n.8, p.1145-1165, December, 2007

Costas Christophi , Hosam Mahmoud, On climbing tries, Probability in the Engineering and Informational Sciences, v.22 n.1, p.133-149, January 2008

Konrad Rieck , Pavel Laskov, Linear-Time Computation of Similarity Measures for Sequential Data, The Journal of Machine Learning Research, 9, p.23-48, 6/1/2008

Uwe Schindler , Michael Diepenbroek, Generic XML-based framework for metadata portals, Computers & Geosciences, v.34 n.12, p.1947-1955, December, 2008

Jinhee You , Sanghyun Park , Inbum Kim, An efficient frequent melody indexing method to improve the performance of query-by-humming systems, Journal of Information Science, v.34 n.6, p.777-798, December 2008

Nuno A. Fonseca , Rui Camacho , Ricardo Rocha , Vítor Santos Costa, Compile the Hypothesis Space: Do it Once, Use it Often, Fundamenta Informaticae, v.89 n.1, p.45-67, January 2009

Sang Hoon Woo , Ja Young Choi , Choonjong Kwak , Chang Ouk Kim, An active product state tracking architecture in logistics sensor networks, Computers in Industry, v.60 n.3, p.149-160, April, 2009

Douglas Comer, Extracting unique rows of a bounded degree array using tries, Proceedings of the May 19-22, 1980, national computer conference, May 19-22, 1980, Anaheim, California

Ian P. Gent , Chris Jefferson , Ian Miguel , Peter Nightingale, Data structures for generalised arc consistency for extensional constraints, Proceedings of the 22nd national conference on Artificial intelligence, p.191-197, July 22-26, 2007, Vancouver, British Columbia, Canada

Masaki Oono , El-Sayed Atlam , Masao Fuketa , Kazuhiro Morita , Jun-ichi Aoe, A compressed trie structure using divided keys, International Journal of Computer Applications in Technology, v.34 n.2, p.101-107, March 2009

Christos Tryfonopoulos , Manolis Koubarakis , Yannis Drougas, Information filtering and query indexing for an information retrieval model, ACM Transactions on Information Systems (TOIS), v.27 n.2, p.1-47, February 2009

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

Jing Fu , Jennifer Rexford, Efficient IP-address lookup with a shared forwarding table for multiple virtual routers, Proceedings of the 2008 ACM CoNEXT Conference, p.1-12, December 09-12, 2008, Madrid, Spain

Albert Xin Jiang , Kevin Leyton-Brown, A polynomial-time algorithm for action-graph games, Proceedings of the 21st national conference on Artificial intelligence, p.679-684, July 16-20, 2006, Boston, Massachusetts

Alan Feuer , Stefan Savev , Javed A. Aslam, Implementing and evaluating phrasal query suggestions for proximity search, Information Systems, v.34 n.8, p.712-724, December, 2009

Jose Antonio Iglesias , Agapito Ledezma , Araceli Sanchis , Gal Kaminka, An Efficient Behavior Classifier based on Distributions of Relevant Events, Proceeding of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence, p.825-826, June 27, 2008

Edward Fredkin: colleagues