|
|
Red-Black Balanced Trie Hashing
– E. J. Otoo, S. Effah
- 1995
|
|
1
|
Trie Methods for Structured Data on Secondary Storage
– Xiaoyan Zhao
- 2000
|
|
2
|
A robust scheme for multilevel extendible hashing
– Sven Helmer, Sven Helmer, Thomas Neumann, Thomas Neumann, Guido Moerkotte, Guido Moerkotte
- 2003
|
|
2
|
An Algorithm for Full Text Indexing
– Tatu Ylönen
- 1992
|
|
2
|
Efficient Techniques for Maintaining Multidimensional Keys in Linked Data Structures (Extended Abstract)
– Roberto Grossi, Giuseppe F. Italiano
- 1999
|
|
|
Digital Access to Comparison-Based Tree Data
– Structures And Algorithms, Salvador Roura
|
|
|
Left-leaning Red-Black Trees
– Robert Sedgewick
|
|
|
Contents
– Oliver Friedmann, Martin Lange
- 2010
|
|
|
An Evaluation of Search Tree Techniques In The Presence of Caches
– Costin Iancu, Anurag Acharya
- 2001
|
|
1
|
Untangling binary trees via rotations
– Joan M. Lucas
|
|
|
On Consulting a Set of Experts and Searching
– Igal Galperin
- 1996
|
|
2
|
An experimental study of SB-trees
– Paolo Ferragina, Roberto Grossi
- 1996
|
|
110
|
The String B-Tree: A New Data Structure for String Search in External Memory and its Applications.
– Paolo Ferragina, Roberto Grossi
- 1998
|
|
|
INDEXING OF MULTIDIMENSIONAL DISCRETE DATA SPACES AND HYBRID EXTENSIONS By
– Changqing Chen, Changqing Chen
|
|
1
|
Compact Balanced Tries
– Pierre Nicodème, De Jonge, Van De
- 25
|
|
9
|
Constructing Red-Black Trees
– Ralf Hinze
- 1999
|
|
1
|
Quick Decoding and Encoding of Prüfer Strings: Exercises in Data Structures
– Bryant A. Julstrom
|
|
1
|
Text Searching: Theory and Practice
– Ricardo A. Baeza-yates, Gonzalo Navarro
|
|
1
|
The Suffix-Signature Method for Searching for Phrases in Text
– Mei Zhou, Frank W. Tompa
- 1998
|
