Author:
Cunto Walter,Lau Gustavo,Flajolet Philippe
Publisher
Springer Berlin Heidelberg
Reference30 articles.
1. Adel'son-Vel'skii, G. M., Landis, E. M.: An Algorithm For The Organization Of Information; Doklady Akademiia Naur USSR 146:263–266 (1962).
2. Aho, A. V., Ullman, J. D.: Optimal Partial-Match Retrieval When Fields Are Independently Specified; ACM TODS 4(2):168–179 (1979).
3. Anderson, D. P.: Techniques For Reducing Pen Plotting Time; ACM Trans. on Graphics 2(3):197–212 (1983).
4. Baer, J.L. and Schawb, B.: A Comparison Of Tree-Balancing Algorithms; Comm. ACM 20(5):322–330 (1977).
5. Bell, C. J.: An Investigation Into The Principles Of The Classification And Analysis Of Data On An Automatic Digital Computer; Doctoral Dissertation, Leeds University, 1965.
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Median and Hybrid Median K-Dimensional Trees;LATIN 2022: Theoretical Informatics;2022
2. Random Partial Match in Quad-K-d Trees;LATIN 2016: Theoretical Informatics;2016
3. On the Cost of Fixed Partial Match Queries in K-d Trees;Algorithmica;2015-12-11
4. Quad-K-d Trees;LATIN 2014: Theoretical Informatics;2014
5. Generalized k-d-trees and local reorganizations;Vestnik St. Petersburg University: Mathematics;2012-07