Author:
Dandamudi Sivarama P.,Sorenson Paul G.
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science,Information Systems,Theoretical Computer Science,Software
Reference23 articles.
1. R. Rivest, Partial-Match Retrieval Algorithms,SIAM J. Comput.,5(1):19?50 (March 1976).
2. J. L. Bentley and M. I. Shamos, A Problem in Multivariate Statistics: Algorithm, Data Structure and Applications,15th Allerton Conf. on Communication, Control, and Computing, pp. 193?201 (1977).
3. J. L. Bentley, Multidimensional Divide- and-Conquer,CACM,23(4):214?228 (April 1980).
4. M. L. Fredman, A Lower Bound on the Complexity of Orthogonal Range Queries,J. ACM,28(4):696?705 (1981).
5. J. L. Bentley and H. A. Maurer, Efficient Worst-Case Data Structures for Range Searching,Acta Information, Vol. 13, pp. 155?168 (1980).
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献