Dynamic Tries
Dynamic Tries is a dynamic data structure that extends the trie abstraction to support efficient insertions, deletions, and associative queries over variable-length keys in a mutable dataset.
9
Publications
931
Citations
20
Authors
16
Institutions
Publications per year
2017–2026
1
Parents
9
Routing on longest-matching prefixes
W. Doeringer, Günter Karjoth, M. Nassehi · IEEE/ACM Transactions on Networking · 1996 · 167 citations
A Shallow Text Processing Core Engine
Günter Neumann, Jakub Piskorski · Computational Intelligence · 2002 · 53 citations
Computing, Computer Science, German +17
1–5 of 9
20
2
h-index
German Research Centre for Artificial Intelligence, Germany
2 publications · 86 citations
2
h-index
1
h-index
Universidad Autónoma de Baja California Sur, Mexico
1 publications · 87 citations
1
h-index
1
h-index
1–5 of 20
16

Kyoto University
Kyoto, Japan
1 h-index
1 publications
23 citations
China XD Group (China)
Xi'an, China
1 h-index
5 publications
435 citations
Genome Institute of Singapore
Singapore, Singapore
1 h-index
1 publications
23 citations
National University of Singapore
Singapore, Singapore
1 h-index
1 publications
23 citations

National Institute of Informatics
Tokyo, Japan
1 h-index
1 publications
23 citations
Institute of Electrical and Electronics Engineers
Piscataway, United States
1 h-index
2 publications
334 citations
IBM Research - Zurich
Rüschlikon, Switzerland
1 h-index
2 publications
334 citations
University of Applied Sciences Worms
Worms, Germany
1 h-index
1 publications
167 citations
1–8 of 16
2 publications · 51 citations
2
h-index
1 publications · 32 citations
1
h-index
1 publications · 53 citations
1
h-index
TOCS · 1 publications · 456 citations
1
h-index
JEA · 1 publications · 52 citations
1
h-index
1–5