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

Authors:
Dan E. Willard
Affiliations:
-
Venue:
SIAM Journal on Computing
Year:
1999

Citing 0
Cited 16

Optimal time-space trade-offs for non-comparison-based sorting

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
A trade-off for worst-case efficient dictionaries

Nordic Journal of Computing
On AC0 implementations of fusion trees and atomic heaps

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Range Searching Over Tree Cross Products

ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
A new framework for addressing temporal range queries and some preliminary results

Theoretical Computer Science
Dynamic ordered sets with exponential search trees

Journal of the ACM (JACM)
Efficient IP table lookup via adaptive stratified trees with selective reconstructions

Journal of Experimental Algorithmics (JEA)
Equivalence between priority queues and sorting

Journal of the ACM (JACM)
On the bit-complexity of Lempel-Ziv compression

SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Dynamic 3-Sided Planar Range Queries with Expected Doubly Logarithmic Time

ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Determining the visibility of a planar set of line segments in O(n log log n) time

ICCSA'07 Proceedings of the 2007 international conference on Computational science and Its applications - Volume Part II
Delaunay triangulations in O(sort(n)) time and more

Journal of the ACM (JACM)
NEFOS: rapid cache-aware range query processing with probabilistic guarantees

DEXA'11 Proceedings of the 22nd international conference on Database and expert systems applications - Volume Part I
Dynamic interpolation search revisited

ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Cache-Oblivious dictionaries and multimaps with negligible failure probability

MedAlg'12 Proceedings of the First Mediterranean conference on Design and Analysis of Algorithms
Sequential dependency computation via geometric data structures

Computational Geometry: Theory and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.