Probabilistic counting algorithms for data base applications
Journal of Computer and System Sciences
Partial match retrieval of multidimensional data
Journal of the ACM (JACM)
Digital search trees revisited
SIAM Journal on Computing
Trie partitioning process: limiting distributions
CAAP '86 Proceedings of the 11th colloquium on trees in algebra and programming
IEEE Transactions on Information Theory
Applications of spatial data structures: Computer graphics, image processing, and GIS
Applications of spatial data structures: Computer graphics, image processing, and GIS
The design and analysis of spatial data structures
The design and analysis of spatial data structures
Generating functionology
On the variance of the external path length in a symmetric digital trie
Discrete Applied Mathematics - Combinatorics and complexity
Discrete Mathematics
Autocorrelation on words and its applications: analysis of suffix trees by string-ruler approach
Journal of Combinatorial Theory Series A
Mellin transforms and asymptotics: harmonic sums
Theoretical Computer Science - Special volume on mathematical analysis of algorithms (dedicated to D. E. Knuth)
Mellin transforms and asymptotics: finite differences and Rice's integrals
Theoretical Computer Science - Special volume on mathematical analysis of algorithms (dedicated to D. E. Knuth)
Asymptotic behavior of the Lempel-Ziv parsing scheme and digital search trees
Theoretical Computer Science - Special volume on mathematical analysis of algorithms (dedicated to D. E. Knuth)
An introduction to the analysis of algorithms
An introduction to the analysis of algorithms
Analysis of algorithms: computational methods and mathematical tools
Analysis of algorithms: computational methods and mathematical tools
Analytical depoissonization and its applications
Theoretical Computer Science
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
On convergence rates in the central limit theorems for combinatorial structures
European Journal of Combinatorics
The space complexity of approximating the frequency moments
Journal of Computer and System Sciences
Fast algorithms for sorting and searching strings
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
The analysis of hybrid trie structures
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Extendible hashing—a fast access method for dynamic files
ACM Transactions on Database Systems (TODS)
Multidimensional binary search trees used for associative searching
Communications of the ACM
Average Case Analysis of Algorithms on Sequences
Average Case Analysis of Algorithms on Sequences
Random Structures & Algorithms - Special issue on analysis of algorithms dedicated to Don Knuth on the occasion of his (100)8th birthday
Text Compression Using Antidictionaries
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
New directions in traffic measurement and accounting: Focusing on the elephants, ignoring the mice
ACM Transactions on Computer Systems (TOCS)
HAKMEM
Probabilistic behavior of asymmetric level compressed tries
Random Structures & Algorithms
ASIAN'04 Proceedings of the 9th Asian Computing Science conference on Advances in Computer Science: dedicated to Jean-Louis Lassez on the Occasion of His 5th Cycle Birthday
IP-address lookup using LC-tries
IEEE Journal on Selected Areas in Communications
An analysis of the height of tries with random weights on the edges
Combinatorics, Probability and Computing
New methods for compression of MP double array by compact management of suffixes
Information Processing and Management: an International Journal
Hi-index | 0.00 |
The digital tree also known as trie made its first appearance as a general-purpose data structure in the late 1950's. Its principle is a recursive partitioning based on successive bits or digits of data items. Under various guises, it has then surfaced in the management of very large data bases, in the design of efficient communication protocols, in quantitative data mining, in the leader election problem of distributed computing, in data compression, as well as in some corners of computational geometry. The algorithms are invariably very simple, easy to implement, and in a number of cases surprisingly efficient. The corresponding quantitative analyses pose challenging mathematical problems and have triggered a flurry of research works. Generating functions and symbolic methods, singularity analysis, the saddle-point method, transfer operators of dynamical systems theory, and the Mellin transform have all been found to have a bearing on the probabilistic behaviour of trie algorithms. We offer here a perspective on the rich algorithmic, analytic, and probabilistic aspects of tries, culminating with a connection between a sorting problem and the Riemann hypothesis.