Free Access
RAIRO-Theor. Inf. Appl.
Volume 23, Number 2, 1989
Page(s) 165 - 176
Published online 01 February 2017
  1. J. L. BENTLEY, Multidimensional Divide and Conquer, Communications of A.C.M., vol. 23, 1980, pp. 214-229. [MR: 567150] [Zbl: 0434.68049] [Google Scholar]
  2. J. L. BENTLEY, Multidimensional Binary Search Trees Used for Associative Searching, Communications of A.C.M., vol. 18, 1975, pp. 509-517. [Zbl: 0306.68061] [Google Scholar]
  3. J. L. BENTLEY, Multidimensional Binary Search Trees in Database Applications, I.E.E.E. Trans. on Software Engineering, vol. 5, 1979, pp. 333-340. [Zbl: 0411.68055] [Google Scholar]
  4. J. L. BENTLEY, Decomposable Searching Problems, Information Processing Letters, vol. 8, 1979, pp. 244-251. [MR: 534072] [Zbl: 0404.68067] [Google Scholar]
  5. J. L. BENTLEY and J. H. FRIEDMAN, Data Structures for Range Searching, Computing Surveys, vol. 11, 1979, pp. 397-409. [Google Scholar]
  6. J. L. BENTLEY and H. A. MAURER, Efficient Worst-case Data Structures for Range Searching, Acta Informatica, vol. 13, 1980, pp. 155-168. [MR: 564462] [Zbl: 0423.68029] [Google Scholar]
  7. J. L. BENTLEY and J. B. SAXE, Decomposable Searching Problems # 1: Static to Dynamic Transformations, Journal of Algorithms, vol. 1, 1980, pp. 301-358. [MR: 604869] [Zbl: 0461.68065] [Google Scholar]
  8. J. L. BENTLEY and M. I. SHAMOS, A Problem in Multivariate Statistics: Algorithm, Data Structure and Applications, Proc. 15th Annual Allerton Conf. on Communication, Control and Computing, 1977, pp. 193-201. [Google Scholar]
  9. J. L. BENTLEY and D. WOOD, An Optimal Worst-case Algorithm for Reporting Intersection of Rectangles, I.E.E.E. Trans. on Computers, vol. 29, 1980, pp. 571-577. [MR: 581619] [Google Scholar]
  10. B. M. CHAZELLE, Filtering Search: a New Approach to Query Answering, Proc. 24th I.E.E.E. Symp. on Foundations of Computer Science, 1983, pp. 122-132. [Google Scholar]
  11. B. M. CHAZELLE and H. EDELSBRUNNER, Linear Space Data Structures for two Types of Range Search, Tech. Report 202, Inst. of Computer Science, University of Graz, 1985. [Zbl: 0624.68054] [Google Scholar]
  12. R. A. FINKEL and J. L. BENTLEY, Quad Trees: a Data Structure for Retrieval of Composite Keys, Acta Informatica, vol. 4, 1974, pp. 1-9. [Zbl: 0278.68030] [Google Scholar]
  13. M. F. FREDMAN, A Lower Bound on the Complexity of Orthogonal Range Queries, Journal ACM 28, 1981, pp. 696-706. [MR: 677081] [Zbl: 0468.68049] [Google Scholar]
  14. M. F. FREDMAN, Lower Bounds on the Complexity of Some Optimal Data Structures, SIAM Journal on Computing 10, 1981, pp. 1-10. [MR: 605599] [Zbl: 0454.68006] [Google Scholar]
  15. H. N. GABOW, J. L. BENTLEY and R. E. TARJAN, Scaling and Related Techniques for Geometry Problems, Proc. 16th Symp. on Theory of Computing, 1984, pp. 135-143. [Google Scholar]
  16. D. T. LEE and C. K. WONG, Worst Case Analysis for Region and Partial Region Searches in Multidimensional Binary Search Trees and Balanced Quad Trees, Acta Informatica, vol. 9, 1977, pp. 23-29. [MR: 464676] [Zbl: 0349.68016] [Google Scholar]
  17. D. T. LEE and C. K. WONG, Finding Intersection of Rectangles by Range Search, Journal of Algorithms, vol. 2, 1981, pp. 337-347. [MR: 640518] [Google Scholar]
  18. D. T. LEE and C. K. WONG, Quintary Trees: a File Structure for Multidimensional Database Systems, A.C.M. Trans. on Database Systems, vol. 5, 1980, pp. 339-353. [Zbl: 0441.68122] [Google Scholar]
  19. J. VAN LEEUWEN and D. WOOD, Dynamization of Decomposable Searching Problems, Information Processing Letters, vol. 10, 1980, pp. 51-56. [MR: 564499] [Google Scholar]
  20. G. S LUEKER and D. E. WILLARD, A Data Structure for Dynamic Range Queries, Information Processing Letters, vol. 15, 1982, pp. 209-213. [MR: 684253] [Zbl: 0511.68080] [Google Scholar]
  21. J. NIEVERGELT, H. HINTERBERGER and K. SEVCIK, The Grid File: an Adaptable, Symmetric Multikey Data Structure, A.C.M. Trans. on Database Systems, vol. 9, 1984, pp. 38-71. [Google Scholar]
  22. M. H. OVERMARS, The Design of Dynamic Data Structures, Lectures Notes on Computer Science, Vol. 156, Springer Verlag, New York. [MR: 710832] [Zbl: 0545.68009] [Google Scholar]
  23. M. H. OVERMARS, The Equivalence of Rectangle Containment, Rectangle Enclosure and ECDF Searching, Tech. Report RUU-CS-81-1, Dept. of Computer Science, University of Utrecht, 1981. [Google Scholar]
  24. J. T. ROBINSON, The K-D-B Tree: a Search Structure for Large Multidimensional Dynamic Indexes, Proc. of the SIGMOD Conference, 1981, pp. 10-18. [Google Scholar]
  25. J. VUILLEMIN, A Unifying Look at Data Structures, Communications of A.C.M., Vol. 23, 1980, pp. 229-239. [MR: 567151] [Zbl: 0434.68047] [Google Scholar]
  26. D. E. WILLARD, New Data Structures for Orthogonal Range Queries, S.I.A.M. Journal on Computing, Vol. 14, 1985, pp. 232-253. [MR: 774942] [Zbl: 0564.68071] [Google Scholar]
  27. D. E. WILLARD, Lower Bounds for Dynamic Range Queries That Permit Subtraction (to appear). [Zbl: 0596.68066] [Google Scholar]
  28. D. E. WILLARD and G. S. LUEKER, Adding Range Restriction Capability to Dynamic Data Structures, Journal A.C.M., Vol. 32, 1985, pp. 597-617. [MR: 796204] [Zbl: 0629.68097] [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.