Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
binary trie
Description:
A digital tree data structure that stores keys as sequences of binary digits and supports lookup, insertion, and related operations.
Primary topic:
Algorithms and Data Compression (45%)
Related topics:
Algorithms and Data Compression (45%),
Network Packet Processing and Optimization (39%)
OpenAlex ID:
keywords/binary-trie
Dynamic hashing
1978
·
Per-Åke Larson
·
BIT Numerical Mathematics
·
205
Improved behaviour of tries by adaptive branching
1993
·
Arne Andersson
, Stefan Nilsson
·
Information Processing Letters
·
82
Shape Shifting Tries for Faster IP Route Lookup
2006
·
Haoyu Song
, J. Turner
, et al.
·
IEEE International Conference on Network Protocols (ICNP)
·
77
A probabilistic analysis of the height of tries and of the complexity of triesort
1984
·
Luc Devroye
·
Acta Informatica
·
67
Priority Tries for IP Address Lookup
2010
·
Hyesook Lim
, Changhoon Yim
, et al.
·
IEEE Transactions on Computers
·
57
On the variance of the external path length in a symmetric digital trie
1989
·
Peter Kirschenhofer
, Helmut Prodinger
, et al.
·
Discrete Applied Mathematics
·
55
A note on the average depth of tries
1982
·
L. Devroye
·
Computing
·
54
Efficient Extensional Binary Tries
2023
·
Andrew W. Appel
, Xavier Leroy
·
Journal of Automated Reasoning
·
43
PDF
Efficient hardware architecture for fast IP address lookup
2003
·
D. Pao
, C. Liu
, et al.
·
IEEE Conference on Computer Communications (INFOCOM)
·
43
An O(log n) dynamic router-table design
2004
·
S. Sahni
, Kun Suk Kim
·
IEEE Transactions on Computers
·
36
Efficient hardware architecture for fast IP address lookup
2003
·
D. Pao
, C. Liu
, et al.
·
IEE Proceedings - Computers and Digital Techniques
·
34
HEXA: Compact Data Structures for Faster Packet Processing
2007
·
Sailesh Kumar
, Jonathan Turner
, et al.
·
IEEE International Conference on Network Protocols (ICNP)
·
32
Order preserving extendible hashing and bucket tries
1981
·
Markku Tamminen
·
BIT Numerical Mathematics
·
28
Open Data Structures: An Introduction
2013
·
Pat Morin
·
Athabasca University Press eBooks
·
24
PDF
Enhancing Genetic Algorithms by a Trie-Based Complete Solution Archive
2010
·
Günther R. Raidl
, Bin Hu
·
Lecture notes in computer science
·
22
On the variance of a class of inductive valuations of data structures for digital search
1995
·
Werner Schachinger
·
Theoretical Computer Science
·
20
PDF
Hypersuccinct Trees - New Universal Tree Source Codes for Optimal Compressed Tree Data Structures and Range Minima
2021
·
Munro, J. Ian
, Nicholson, Patrick K.
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
18
PDF
A new hierarchical packet classification algorithm
2012
·
Hyesook Lim
, Soohyun Lee
, et al.
·
Computer Networks
·
18
Trie methods for text and spatial data on secondary storage
1995
·
Shang, Heping
·
17
An ultra-fast universal incremental update algorithm for trie-based routing lookup
2012
·
Tong Yang
, Zhian Mi
, et al.
·
IEEE International Conference on Network Protocols (ICNP)
·
15
A Walkable Kademlia Network for Virtual Worlds
2009
·
Matteo Varvello
, Christophe Diot
, et al.
·
IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)
·
15
Distributed Key Management in Dynamic Outsourced Databases: A Trie-Based Approach
2009
·
V. El-khoury
, N. Bennani
, et al.
·
Databases, Knowledge, and Data Applications
·
13
On the Analysis of the Average Height of a Digital Trie: Another Approach
1986
·
Wojciech Szpankowski
·
Purdue e-Pubs (Purdue University System)
·
13
PDF
Trie hashing analysis
2003
·
M. Regnier
·
IEEE International Conference on Data Engineering (ICDE)
·
12
Summary structures for frequency queries on large transaction sets
2002
·
Dow-Yung Yang
, A. Johar
, et al.
·
DCC
·
12
Show more works
View as search
Works count:
100
Citation count:
1,210
Year
Topic
Type