Author:
Martínez C.,Panholzer A.,Prodinger H.
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference21 articles.
1. J. L. Bentley. Multidimensional binary search trees used for associative retrieval.Communications of the ACM, 18(9):509–517, 1975.
2. W. A. Burkhard. Hashing and trie algorithms for partial match retrieval.ACM Transactions on Database Systems, 1(2):175–187, 1976.
3. W. Cunto, G. Lau, and P. Flajolet. Analysis ofkdt-trees:kd-trees improved by local reorganisations. In F. Dehne, J.-R. Sack, and N. Santoro, editors,Algorithms and Data Structures (WADS ’89), volume 382 of LNCS, pages 24–38. Springer-Verlag, Berlin, 1989.
4. A. Duch, V. Estivill-Castro, and C. Martínez. Randomizedk-dimensional binary search trees. In K.-Y. Chwa and O. H. Ibarra, editors,Algorithms and Computation (ISAAC ’98), volume 1533 of LNCS, pages 199–208. Springer-Verlag, Berlin, 1998.
5. P. Flajolet, G. Gonnet, C. Puech, and J. M. Robson. Analytic variations on quadtrees.Algorithmica, 10:473–500, 1993.
Cited by
18 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献