Data structures and network algorithms
Data structures and network algorithms
Self-adjusting binary search trees
Journal of the ACM (JACM)
Two algorithms for maintaining order in a list
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
A balanced search tree with O(1) worst case update time
Acta Informatica
Making data structures persistent
Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
Multidimensional Balanced Binary Trees
IEEE Transactions on Computers
The on-line d-dimensional dictionary problem
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Suffix arrays: a new method for on-line string searches
SIAM Journal on Computing
On k-dimensional balanced binary trees
Journal of Computer and System Sciences
The string B-tree: a new data structure for string search in external memory and its applications
Journal of the ACM (JACM)
Fast algorithms for sorting and searching strings
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Finger search trees with constant insertion time
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Randomized binary searching with tree structures
Communications of the ACM
Multidimensional B-tree: An Efficient Dynamic File Structure for Exact Match Queries
GI - 10. Jahrestagung
Multidimensional Height-Balanced Trees
IEEE Transactions on Computers
Fast BWT in small space by blockwise suffix sorting
Theoretical Computer Science
Near real-time suffix tree construction via the fringe marked ancestor problem
SPIRE'11 Proceedings of the 18th international conference on String processing and information retrieval
Suffix trays and suffix trists: structures for faster text indexing
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
On demand string sorting over unbounded alphabets
Theoretical Computer Science
Towards real-time suffix tree construction
SPIRE'05 Proceedings of the 12th international conference on String Processing and Information Retrieval
On demand string sorting over unbounded alphabets
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
Near real-time suffix tree construction via the fringe marked ancestor problem
Journal of Discrete Algorithms
| Hi-index | 0.00 |
We describe a general paradigm for maintaining multidimensional keys in linked data structures designed for one-dimensional keys. We improve existing bounds and achieve new results in a simple way, without giving up the structural and topological properties of the underlying data structures. This is particularly important, as it allows us to exploit many properties of one-dimensional searching, and makes our approach amenable to practical implementations.