Trie Data Structures
Trie Data Structures is a tree-based data structure designed for efficient retrieval of strings, distinguished by its prefix-based organization that enables fast prefix matching and substring search operations.
189
Publications
10.3K
Citations
460
Authors
208
Institutions
Publications per year
2017–2026
17
Parents
189
KenLM: Faster and Smaller Language Model Queries
Kenneth Heafield · 2011 · 1.1K citations
Compressed Suffix Trees with Full Functionality
Kunihiko Sadakane · Theory of Computing Systems · 2007 · 297 citations
1–5 of 189
460
6
h-index
6
h-index
5
h-index
5
h-index
Institut national de recherche en sciences et technologies du numérique, France
4 publications · 264 citations
4
h-index
1–5 of 460
208
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
10 h-index
14 publications
697 citations
Purdue University West Lafayette
West Lafayette, United States
9 h-index
16 publications
434 citations

Tokushima University
Tokushima, Japan
7 h-index
27 publications
684 citations
RMIT University
Melbourne, Australia
7 h-index
14 publications
846 citations

Ewha Womans University
Seoul, South Korea
6 h-index
14 publications
288 citations

University of Pisa
Pisa, Italy
5 h-index
8 publications
447 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
1–8 of 208
8 publications · 273 citations
8
h-index
TODS · 5 publications · 133 citations
5
h-index
4 publications · 896 citations
4
h-index
4 publications · 94 citations
4
h-index
TKDE · 4 publications · 215 citations
4
h-index
1–5