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 seve...

Full description

Saved in:
Bibliographic Details
Published in:SIAM journal on computing 2000-01, Vol.29 (3), p.1030-1049
Main Author: Willard, Dan E.
Format: Article
Language:English
Subjects:
Algorithms
Computer science
Geometry
Textbooks
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0097-5397
1095-7111
DOI:10.1137/S0097539797322425