Applications of the fusion tree method to computational geometry and searching

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn Part F129721, Issue , 1992, Pages 286-295

  Willard, Dan E ^a  

^a STATE UNIVERSITY OF NEW YORK   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GEOMETRY; DATA STRUCTURES; FORESTRY;

ARBITRARY CONSTANTS; BACKGROUND INFORMATION; DYNAMIC HASHING; DYNAMIC TIME; HIGHER DIMENSIONS; LINEAR SPACES; SPACE DATA STRUCTURES; TIME-SPACE COMPLEXITY;

TREES (MATHEMATICS);

EID: 85029470714     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (24)

1. J.L. Bentley, Multidimensional divide-and-conquer, Comm. of ACM 23 (1980), pp. 214-228.
2. JX. Bentley and H.A. Mauer, Efficient worst-case data structures for range searching, Acta Informatica 13 (1980), pp. 155-168.
3. J.L. Bentley and M.I. Shamos, A problem in multi-variate statistics: algorithm, data structure and applications, 15th Allerton Conf. on Comm., Contr., and Comp. (1977), pp. 193201.
4. B. Chazelle, Filtering Search, A New Approach to Query Processing, Siam Journal on Computing 15 (1986) pp. 703-724.
5. B. Chazelle, Lower Bounds for Orthogonal Range Searching II - The Arithmetic Model 27th IEEE Symp. on Foundations of Computer Science (1986) pp.87-96;
6. and more details in Journal of ACM 37 (1990), pp. 439463.
7. B. Chazelle and L.J. Guibas, Fractional Cascading: A Data Structuring Technique, Algorithmica 1 (1986), pp. 133-162.
8. M. Dietzfelbinger, A. Karlin, K. Melhorn, F. Meyer auf der Heide, H. Rohnert, and R.E. Tarjan, Dynamic perfect hashing: Upper and lower bounds, Proc. of the 29th IEEE FOCS, 1988, pp. 524-531; also: Tech. Report No. 282, Fachbereich Informatik, Universität Dortmund, 1988.
9. P. Dietz, Optimal Algorithms for List Indexing and Subset Rank, Workshop on Algorithms and Data Structures 1989, published in volume 382 of Springer-Verlag LNCS pp 39-46.
10. M. Dietzfelbinger, F. Meyer auf der Heide, A new universal class of hash functions and dynamic hashing in real time ICALP, 1990, pp. 6-19.
11. P. van Emde Boas, Preserving order in a forest in less than logarithmic time and linear space, Inform. Process. Lett. 6 (1977), pp. 80-82.
12. P. van Emde Boas, R. Kaas and E. Zijlstra, Design and implementation of an efficient priority queue, Math. Systems Theory 10 (1977), pp. 99-127.
13. M.L. Fredman and D.E. Willard, Blasting Through the Information Theoretic Barrier with Fusion Trees, Proc. 22nd Annual ACM Symposium on Theory of Computing, 1990, pp. 17.
14. M.L. Fredman and D. E. Willard, Trans-dichotomous Algorithms for Minimum Spanning Trees and Shortest Paths, Proc. 31st Annual Symposium on Foundations of Computer Science, 1990, pp. 719-725.
15. G.H. Gönnet, Handbook of Algorithms and Data Structures, Addison-Wesley, 1983.
16. D. B. Johnson, A priority queue in which initialization and queue operations take 0(log log D) time, Math. System Theory 15 (1982), pp. 295309.
17. K. Mehlhorn, Data Structures and Algorithms 1: Sorting and Searching, 1984, Springer-Verlag, Berlin.
18. E. M. McCreight, Priority Search Trees, SIAM Journal on Computing, 14 (1985), pp. 257-276.
19. A. Siegel, On universal classes of fast high performance hash function, their time-space tradeoff, and their applications, Proc. of the 30th IEEE FOCS, 1989, pp. 20-25.
20. D.E. Willard, Log-logarithmic worst case range queries are possible in space 0(N). Inform. Process. Lett. 17 (1983), pp. 81-89.
21. D.E. Willard, Reduced Memory Space for Multi-Dimensional Search Trees, 2-nd Symposium on Theoretical Aspects of Computer Science (published in Springer-Verlag LNCS182), 1985, pp. 363-374. (The multi-branching B-tree appears in the last section of this paper.)
22. D.E. Willard and G.S. Lueker, Adding range restriction capability to dynamic data structures, JACM 32 (1985) pp. 597-619.
23. A.C. Yao, On the complexity of maintaining partial sums, 14th ACM Symposium on Theory of Computing (1982) pp. 128-136;
24. and more details in SIAM Journal on Computing, 14(1985), pp. 277-289.