Examining Computational Geometry, Van Emde Boas Trees, and Hashing from the Perspective of the Fusion Tree

This article illustrates several examples of computer science problems whose performance can be improved with the use of either the fusion trees [Fredman and Willard, J. Comput. System Sci., 47 (1993), pp. 424--436; Fredman and Willard, J. Comput. System Sci., 48 (1994), pp. 533--551] or one of several recent improvements to this data structure. It is likely that many other data structures can also have their performance improved with fusion trees. The examples here are only illustrative.

[1]  Mikkel Thorup,et al.  On RAM priority queues , 1996, SODA '96.

[2]  David G. Kirkpatrick,et al.  Upper Bounds for Sorting Integers on Random Access Machines , 1984, Theor. Comput. Sci..

[3]  Arne Andersson,et al.  On the Difficulty of Range Searching , 1995, WADS.

[4]  Leonidas J. Guibas,et al.  Fractional Cascading: A Data Structuring Technique with Geometric Applications , 1985, ICALP.

[5]  Alan Siegel,et al.  On universal classes of fast high performance hash functions, their time-space tradeoff, and their applications , 1989, 30th Annual Symposium on Foundations of Computer Science.

[6]  Jon Louis Bentley,et al.  Multidimensional divide-and-conquer , 1980, CACM.

[7]  Mikkel Thorup,et al.  Dominators in Linear Time , 1999, SIAM J. Comput..

[8]  Susanne Albers,et al.  Improved parallel integer sorting without concurrent writing , 1992, SODA '92.

[9]  Andrew Chi-Chih Yao.  On the Complexity of Maintaining Partial Sums , 1985, SIAM J. Comput..

[10]  Bernard Chazelle,et al.  Filtering search: A new approach to query-answering , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[11]  Marvin Minsky,et al.  An introduction to computational geometry , 1969 .

[12]  Kurt Mehlhorn,et al.  Data Structures and Algorithms 3: Multi-dimensional Searching and Computational Geometry , 2012, EATCS Monographs on Theoretical Computer Science.

[13]  J. Ian Munro,et al.  The Nearest Neighbor Problem on Bounded Domains , 1985, ICALP.

[14]  Rajeev Raman,et al.  Sorting in linear time? , 1995, STOC '95.

[15]  Dan E. Willard.  Log-Logarithmic Worst-Case Range Queries are Possible in Space Theta(N) , 1983, Inf. Process. Lett..

[16]  Michael Ian Shamos,et al.  A Problem in Multivariate Statistics: Algorithm, Data Structure and Applications. , 1978 .

[17]  Michael L. Fredman,et al.  Trans-Dichotomous Algorithms for Minimum Spanning Trees and Shortest Paths , 1994, J. Comput. Syst. Sci..

[18]  Friedhelm Meyer auf der Heide,et al.  Dynamic perfect hashing: upper and lower bounds , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[19]  Mikkel Thorup,et al.  Faster deterministic sorting and priority queues in linear space , 1998, SODA '98.

[20]  Dan E. Willard.  Reduced Memory Space for Multi-Dimensional Search Trees (Extended Abstract) , 1985, STACS.

[21]  Michael L. Fredman,et al.  Surpassing the Information Theoretic Bound with Fusion Trees , 1993, J. Comput. Syst. Sci..

[22]  Peter Bro Miltersen,et al.  Fusion Trees can be Implemented with AC0 Instructions Only , 1999, Theor. Comput. Sci..

[23]  George S. Lueker,et al.  Adding range restriction capability to dynamic data structures , 1985, JACM.

[24]  Hermann A. Maurer,et al.  Efficient worst-case data structures for range searching , 1978, Acta Informatica.

[25]  A. Andersson.  Static Dictionaries on RAMs: Query Time is Necessary and Sufficient , 1996, FOCS 1996.

[26]  Peter Bro Miltersen,et al.  Trans-Dichotomous Algorithms Without Multiplication - Some Upper and Lower Bounds , 1997, WADS.

[27]  Rajeev Raman,et al.  Priority Queues: Small, Monotone and Trans-dichotomous , 1996, ESA.

[28]  Dan E. Willard,et al.  Log-logarithmic worst-case range queries are possible in space ⊕(N) , 1983 .

[29]  Peter Bro Miltersen,et al.  Fusion Trees can be Implemented with AC0 Instructions only , 1996 .

[30]  Paul F. Dietz.  Optimal Algorithms for List Indexing and Subset Rank , 1989, WADS.

[31]  Edward M. McCreight,et al.  Priority Search Trees , 1985, SIAM J. Comput..

[32]  János Komlós,et al.  Storing a sparse table with O(1) worst case access time , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[33]  Peter van Emde Boas,et al.  Preserving Order in a Forest in Less Than Logarithmic Time and Linear Space , 1977, Inf. Process. Lett..

[34]  Kurt Mehlhorn,et al.  Data Structures and Algorithms 1: Sorting and Searching , 2011, EATCS Monographs on Theoretical Computer Science.

[35]  Bart Taub.  Filtering with Search , 2001 .

[36]  J. Ian Munro,et al.  Proximity of a Grid , 1985, STACS.

[37]  Bernard Chazelle,et al.  Lower bounds for orthogonal range searching: part II. The arithmetic model , 1990, JACM.

[38]  Bernard Chazelle,et al.  Lower bounds for off-line range searching , 1997, Discret. Comput. Geom..

[39]  Dan E. Willard.  New Trie Data Structures Which Support Very Fast Search Operations , 1984, J. Comput. Syst. Sci..

[40]  Dan E. Willard,et al.  Applications of the fusion tree method to computational geometry and searching , 1992, SODA '92.

[41]  Mikkel Thorup.  Randomized sorting in O(n log log n) time and linear space using addition, shift, and bit-wise boolean operations , 1997, SODA '97.

[42]  Jon Louis Bentley,et al.  Engineering a sort function , 1993, Softw. Pract. Exp..

[43]  Arne Andersson,et al.  Sublogarithmic searching without multiplications , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[44]  Bernard Chazelle,et al.  Lower bounds for off-line range searching , 1995, STOC '95.

[45]  Gaston H. Gonnet,et al.  Handbook Of Algorithms And Data Structures , 1984 .

[46]  N. K. Jaiswal,et al.  Priority queues , 1968 .

[47]  Dan E. Willard,et al.  A Density Control Algorithm for Doing Insertions and Deletions in a Sequentially Ordered File in Good Worst-Case Time , 1992, Inf. Comput..

[48]  Mikkel Thorup,et al.  Undirected single source shortest paths in linear time , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[49]  Arne Andersson.  Faster deterministic sorting and searching in linear space , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[50]  Otto Nurmi,et al.  Algorithms for computational geometry , 1987 .

[51]  Friedhelm Meyer auf der Heide,et al.  A New Universal Class of Hash Functions and Dynamic Hashing in Real Time , 1990, ICALP.

[52]  Keith Bostic,et al.  Engineering Radix Sort , 1993, Comput. Syst..