Randomized K-dimensional binary search trees

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1533 LNCS, Issue , 1998, Pages 199-209

  Duch, Amalia ^a   Estivill Castro, Vladimir ^b   Martínez, Conrado ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^b UNIVERSITY OF NEWCASTLE   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

CONVOLUTIONAL CODES; NEAREST NEIGHBOR SEARCH;

BINARY SEARCH TREES; EXPECTED TIME; INSERTIONS AND DELETIONS; K-D TREE; NEAREST NEIGHBOR QUERIES; PARTIAL MATCH QUERIES; RANDOMIZED ALGORITHMS; REAL-VALUED FUNCTIONS;

BINARY TREES;

EID: 84867473996     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49381-6_22     Document Type: Conference Paper

References (14)

1. Aragon, C. R., Seidel, R. G.: Randomized Search Trees. Algorithmica 16 (1996) 464-497
2. Bentley, J. L.: Multidimensional binary search trees used for associative retrieval. Comm. of the ACM 18(9) (1975) 509-517
3. Flajolet, Ph., Puech, C.: Partial match retrieval of multidimensional data. J. of the ACM 33(2) (1986) 371-407
4. Friedman, J. H., Bentley, J. L., Finkel, R. A.: An algorithm for finding best matches in logarithmic expected time. ACM Trans. on Mathematical Software 3(3) (1977) 209-226
5. Graham, R. L., Knuth, D. E., Patashnik, O.: Concrete Mathematics. Addison-Wesley (1989)
6. Knuth, D. E.: The Art of Computer Programming, vol. 3: Sorting and Searching, 2nd. edition. Addison-Wesley (1998)
7. Mahmoud, H. M.: Evolution of Random Search Trees. Wiley (1992)
8. Overmars, M. H., van Leewen, J.: Dynamic multi-dimensional data structures based on quad- and k-d-trees. Acta Informatica 17(3) (1982) 267-285
9. Pugh, W.: Skip list: A probabilistic alternative to balanced trees. Comm. of the ACM 33(6) (1990) 668-676
10. Raghavan, P., Motwani, R.: Randomized Algorithms. Cambridge Univ. Press (1995)
11. Roura, S., Martínez, C.: Randomized binary search trees. J. of the ACM 45(2) (1998) 288-323
12. Samet, H.: The Design and Analysis of Spatial Data Structures. Addison-Wesley (1990)
13. Sproull, R.: Refinements to nearest neighbor searching in k-dimensional trees. Algorithmica 6 (1991) 579-589
14. van Kreveld, M. J., Overmars, M. H.: Divided k-d-trees. Algorithmica 6 (1991) 840-858