EDP Sciences logo
Subscriber Authentication Point
Search
Menu
All issues Volume 28 / No 1 (1994) RAIRO-Theor. Inf. Appl., 28 1 (1994) 25-49 References
Free Access
Issue
RAIRO-Theor. Inf. Appl.
Volume 28, Number 1, 1994
Page(s) 25 - 49
DOI https://doi.org/10.1051/ita/1994280100251
Published online 01 February 2017
  1. 1. J. L. BENTLEY, Decomposable Searching Problems, Inform. Proc. Lett., 1979, 8, 244-251. [MR: 534072] [Zbl: 0404.68067] [Google Scholar]
  2. 2. J. L. BENTLEY, Multidimensional Divide and Conquer, Comm. ACM., 1980, 23, 214-229. [MR: 567150] [Zbl: 0434.68049] [Google Scholar]
  3. 3. B. CHAZELLE and L. J. GUIBAS, Fractional Cascading I: a Data Structuring Technique, Algorithmica, 1986, 1, 133-162. [MR: 858402] [Zbl: 0639.68056] [Google Scholar]
  4. 4. P. F. DIETZ and R. RAMAN, Persistence, Amortization and Randomization, Tech. Report 353, University of Rochester, 1991. [Zbl: 0800.68346] [MR: 1095822] [Google Scholar]
  5. 5. M. DIETZFELBINGER, A. KARLIN, K. MEHLHORN, F. MEYERauf der HEIDE, H. ROHNERT, R. E. TARJAN, Dynamic Perfect Hashing, Proc. 29-th Annual IEEE Symp. on Foundations of Computer Science, 1988, 524-531. [Google Scholar]
  6. 6. J. R. DRISCOLL, N. SARNAK, D. D. SLEATOR and R. E. TARJAN, Making Data Structures Persistent, J. Comput. System Sci., 1989, 38, 86-124. [MR: 990051] [Zbl: 0667.68026] [Google Scholar]
  7. 7. H. EDELSBRUNNER, A Note on Dynamic Range Searching, Bull. of the EATCS, 1981, 15, 34-40. [Google Scholar]
  8. 8. H. N. GABOW, J. L. BENTLEY and R. E. TARJAN, Scaling and Related Techniques for Geometry Problems, Proc. 16-th Annual ACM Symp. on Theory of Computing, 1984, 135-143. [Google Scholar]
  9. 9. R. KLEIN, O. NURMI, T. OTTMANN and D. WOOD, A Dynamic Fixed Windowing Problem, Algorithmica, 1989, 4, 535-550. [MR: 1019392] [Zbl: 0684.68035] [Google Scholar]
  10. 10. K. MEHLHORN and S. NÄHER, Bounded Ordered Dictionaries in O(log log N) Time and O(n) Space, Inform. Proc. Lett., 1990, 35, 183-189. [MR: 1066121] [Zbl: 0702.68042] [Google Scholar]
  11. 11. M. H. OVERMARS, The Design of Dynamic Data Structures, Lecture Notes in Computer Science, 1983, Vol. 156, Springer-Verlag, Berlin. [MR: 710832] [Zbl: 0545.68009] [Google Scholar]
  12. 12. M. H. OVERMARS, Efficient Data Structures for Range Searching on a Grid, J. of Algorithms, 1988, 9, 254-275. [MR: 936109] [Zbl: 0637.68067] [Google Scholar]
  13. 13. N. SARNAK and R. E. TARJAN, Planar Point Location Using Persistent Search Trees, Comm. A.C.M., 1986, 29, 669-679. [Zbl: 0732.68102] [MR: 848411] [Google Scholar]
  14. 14. H. W. SCHOLTEN and M. H. OVERMARS, General Methods for Adding Range Restrictions to Decomposable Searching Problems, J. Symbolic Computation, 1989, 7, 1-10. [MR: 984267] [Zbl: 0668.68073] [Google Scholar]
  15. 15. P. van EMDE BOAS, Preserving Order in a Forest in Less than Logarithmic Time and Linear Space, Inform. Proc. Lett., 1977, 6, 80-82. [Zbl: 0364.68053] [Google Scholar]
  16. 16. P. van EMDE BOAS, R. KAAS and E. ZIJLSTRA, Design and Implementation of an Efficient Priority Queue, Math. Systems Theory, 1977, 10, 99-127. [MR: 431777] [Zbl: 0363.60104] [Google Scholar]
  17. 17. D. E. WILLARD and G. S. LUEKER, Adding Range Restriction Capability to Dynamic Data Structures, J. A.C.M., 1985, 32, 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.