Trie Structures
Trie Structures is a tree-based data structure that organizes keys in a hierarchical manner, distinguishing itself by representing each node as a common prefix of its associated keys, thereby enabling efficient prefix-based search and retrieval operations.
139
Publications
7.1K
Citations
338
Authors
147
Institutions
Publications per year
2017–2026
8
Parents
139
KenLM: Faster and Smaller Language Model Queries
Kenneth Heafield · 2011 · 1.1K citations
Faster IP lookups using controlled prefix expansion
V. Srinivasan, George Varghese · 1998 · 280 citations
Routing on longest-matching prefixes
W. Doeringer, Günter Karjoth, M. Nassehi · IEEE/ACM Transactions on Networking · 1996 · 167 citations
1–5 of 139
338
6
h-index
Institut national de recherche en sciences et technologies du numérique, France
4 publications · 246 citations
4
h-index
4
h-index
3
h-index
3
h-index
1–5 of 338
147
Purdue University West Lafayette
West Lafayette, United States
8 h-index
13 publications
362 citations
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
7 h-index
10 publications
596 citations

Tokushima University
Tokushima, Japan
7 h-index
27 publications
684 citations
Tsinghua University
Beijing, China
5 h-index
25 publications
1.4K citations
University of Southern California
Los Angeles, United States
4 h-index
9 publications
196 citations

Ewha Womans University
Seoul, South Korea
4 h-index
9 publications
202 citations

University of Pisa
Pisa, Italy
3 h-index
5 publications
191 citations

City University of Hong Kong
Hong Kong, Hong Kong
3 h-index
6 publications
157 citations
1–8 of 147
8 publications · 273 citations
8
h-index
TODS · 5 publications · 133 citations
5
h-index
4 publications · 127 citations
4
h-index
3 publications · 267 citations
3
h-index
3 publications · 128 citations
3
h-index
1–5