Skip to search formSkip to main contentSkip to account menu

Trie

Known as: B-trie, Digital tree, Tree (disambiguation) 
In computer science, a trie, also called digital tree and sometimes radix tree or prefix tree (as they can be searched by prefixes), is a kind of… 
Wikipedia (opens in a new tab)

Related topics

Related topics

50 relations
Aho–Corasick algorithmAuxiliary memoryB-treeBinary search algorithm

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
IP address lookup using GPU
In this paper, we proposed a parallel IP address lookup architecture, which is a novel concept based on graphics processing unit… 
2015
2015
A mechanism for reducing flow tables in software defined network
The software defined network (SDN) has been developing tremendously in recent years. Numerous studies are proposed on the… 
2014
2014
IMSR_PreTree: an improved algorithm for mining sequential rules based on the prefix-tree
Sequential rules generated from sequential patterns express temporal relationships among patterns. Sequential rule mining is an… 
2012
2012
MSGPs: A Novel Algorithm for Mining Sequential Generator Patterns
Sequential generator pattern mining is an important task in data mining. Sequential generator patterns used together with closed… 
2007
2007
Succinct Representation Of Static Packet Classifiers
We develop algorithms for the compact representation of the 2-dimensional tries that are used for Internet packet classification… 
2002
2002
Low depth carry lookahead addition using charge recycling threshold logic
The main result of this paper is the development of a low depth carry lookahead addition technique based on threshold logic. Two… 
2001
2001
A Comparison of MPI, SHMEM and Cache-Coherent Shared Address Space Programming Models on a Tightly-Coupled Multiprocessors
We compare the performance of three major programming models on a modern, 64-processor hardware cache-coherent machine, one of… 
1999
1999
A 1.0-nsec 32-bit prefix tree adder in 0.25-/spl mu/m static CMOS
The carries in a carry-lookahead adder can be computed by using a separate prefix tree for each bit location. This is nearly… 
Highly Cited
1996
Highly Cited
1996
Field Induced Spin Density Waves
The Field Induced Spin Density Waves (FISDWs) found in organic conductors represent a unique series of transitions which meld the… 
Highly Cited
1981
Highly Cited
1981
Listric Normal Faults
The importance of listric normal faults in the formation of sedimentary basins is becoming increasingly more obvious. Based on… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)