patricia trie

In computer science, a Patricia trie (also known as a radix tree) is a simple form of compressed trie which merges single child nodes with their parents. Its name comes from the acronym PATRICIA, which stands for "Practical Algorithm to Retrieve Information Coded in Alphanumeric", and was described in a paper published in 1968 by Donald R. Morrison. Patricia tries are useful for constructing associative arrays with integer keys.

External links

Monash University: Algorithms and Data Structures Research & Reference Material: PATRICIA, by Lloyd Allison
Practical Algorithm to Retrieve Information Coded in Alphanumeric, original paper in ACM Portal

<< Previous

Word Browser

Next >>

wire entanglement
central and western democratic power
university of lapland
jerry rice
abdullah bin saud
casimir pierre prier
polish navy
ern goldfinger
justice union
fresh air
weapons of mass deception

flight (military unit)
terry gross
duc d'orlans
the tavis smiley show
1 e5 u.s. dollars
black rosy finch
compulsive hoarding
district attorney
convention for the conservation of antarctic seals
al michaels
brown capped rosy finch

publicly traded
privately held
ray solomonoff
convention for the conservation of antarctic marine living resources
christian gmelin
subtropics
aluminium can
johann friedrich gmelin
algorithmic probability
sharpie
johann georg gmelin

leopold gmelin
bombard
speed prior
leonid levin
vibroplex
vestmannaeyjar
windscreen wiper
crucible theatre
list of equations
stockholm bromma airport
2004 in india