Product
Help
Pricing
About
Jobs
Log in
Get started
Concept
Add to collection
Ternary search tree
OpenAlex ID:
C136519935
Multidimensional binary search trees used for associative searching
1975
·
Jon Louis Bentley
·
Communications of the ACM
·
9,023
PDF
Self-adjusting binary search trees
1985
·
Daniel Dominic Sleator
, Robert Endre Tarjan
·
Journal of the ACM
·
1,480
PDF
Constructing optimal binary decision trees is NP-complete
1976
·
Laurent Hyafil
, Ronald L. Rivest
·
Information Processing Letters
·
1,286
Symmetric binary B-Trees: Data structure and maintenance algorithms
1972
·
Rudolf Bayer
·
Acta Informatica
·
572
The complexity of reconstructing trees from qualitative characters and subtrees
1992
·
Michael Steel
·
Journal of Classification
·
555
Generalized Search Trees for Database Systems
1995
·
Joseph M. Hellerstein
, Jeffrey F. Naughton
, et al.
·
Minds at UW (University of Wisconsin)
·
537
The adaptive radix tree: ARTful indexing for main-memory databases
2013
·
V. Leis
, Alfons Kemper
, et al.
·
IEEE International Conference on Data Engineering (ICDE)
·
518
Optimum binary search trees
1971
·
D. E. Knuth
·
Acta Informatica
·
507
Multidimensional Binary Search Trees in Database Applications
1979
·
J.L. Bentley
·
IEEE Transactions on Software Engineering
·
467
Prefix B -trees
1977
·
Rudolf Bayer
, Karl Unterauer
·
ACM Transactions on Database Systems
·
326
Optimal Computer Search Trees and Variable-Length Alphabetical Codes
1971
·
T. C. Hu
, A. C. Tucker
·
SIAM Journal on Applied Mathematics
·
322
Binary Search Trees of Bounded Balance
1973
·
J. Nievergelt
, E. M. Reingold
·
SIAM Journal on Computing
·
301
The average height of binary trees and other simple trees
1982
·
Philippe Flajolet
, Andrew Odlyzko
·
Journal of Computer and System Sciences
·
283
Worst-case analysis for region and partial region searches in multidimensional binary search trees and balanced quad trees
1977
·
D.T. Lee
, C.K. Wong
·
Acta Informatica
·
263
IP lookups using multiway and multicolumn search
1999
·
B. Lampson
, V. Srinivasan
, et al.
·
IEEE/ACM Transactions on Networking
·
253
Reconciliation with Non-Binary Species Trees
2008
·
Benjamin Vernot
, Maureen Stolzer
, et al.
·
Journal of Computational Biology
·
177
Branching processes in the analysis of the heights of trees
1987
·
L. Devroye
·
Acta Informatica
·
171
Biased Search Trees
1985
·
Samuel W. Bent
, Daniel D. Sleator
, et al.
·
SIAM Journal on Computing
·
168
Cache oblivious search trees via binary trees of small height
2002
·
Gerth Stølting Brodal
, Rolf Fagerberg
, et al.
·
163
Nearly optimal binary search trees
1975
·
Kurt Mehlhorn
·
Acta Informatica
·
152
IP lookups using multiway and multicolumn search
2002
·
B. Lampson
, V. Srinivasan
, et al.
·
IEEE Conference on Computer Communications (INFOCOM)
·
145
Digital Search Trees Revisited
1986
·
Philippe Flajolet
, Robert Sedgewick
·
SIAM Journal on Computing
·
137
Binary B-trees for virtual memory
1971
·
Rudolf Bayer
·
ACM SIGFIDET Workshop on Data Description, Access and Control (SIGFIDET)
·
125
PDF
Self-adjusting binary trees
1983
·
Daniel Dominic Sleator
, Robert Endre Tarjan
·
ACM Symposium on Theory of Computing (STOC)
·
119
PDF
Lower Bounds for Accessing Binary Search Trees with Rotations
1989
·
Robert Wilber
·
SIAM Journal on Computing
·
117
Show more works
View as search
Works count:
948
Citation count:
25,130
Year
Topic
Type