Journal ArticleDOI
Storing a Sparse Table with 0(1) Worst Case Access Time
Reads0
Chats0
TLDR
A data structure for representing a set of n items from a universe of m items, which uses space n+o(n) and accommodates membership queries in constant time and is easy to implement.Abstract:
A data structure for representing a set of n items from a umverse of m items, which uses space n + o(n) and accommodates membership queries m constant time is described. Both the data structure and the query algorithm are easy to ~mplement.read more
Citations
More filters
Journal ArticleDOI
Examining Computational Geometry, Van Emde Boas Trees, and Hashing from the Perspective of the Fusion Tree
TL;DR: This article illustrates several examples of computer science problems whose performance can be improved with the use of either the fusion trees or one of several recent improvements to this data structure.
Journal ArticleDOI
Roundtrip spanners and roundtrip routing in directed graphs
TL;DR: In this paper, the authors introduced the notion of roundtrip spanners of weighted directed graphs and described efficient algorithms for their construction, and showed that for every integer k ≥ 1 and any e > 0, any directed graph on n vertices with edge weights in the range [1, W] has a (2k + e)-roundtrip-spanner with O(min{(k2/e) n1 + 1/k (log(nW), (k/e)) edges.
Journal ArticleDOI
Bounded ordered dictionaries in O(loglog N ) time and O( n ) space
Kurt Mehlhorn,Stefan Näher +1 more
TL;DR: This paper shows how to implement bounded ordered dictionaries, also called bounded priority queues, in O(log log N ) time per operation and O( n ) space.
Proceedings ArticleDOI
Trading space for time in undirected s-t connectivity
TL;DR: The reachability problem for undirected graphs can be solved in logspace and O time by a probabilistic algorithm that simulates a random walk or in linear time and space by a conventional deterministic graph traversal algorithm.
Journal ArticleDOI
A Simple Randomized Sieve Algorithm for the Closest-Pair Problem
Samir Khuller,Yossi Matias +1 more
TL;DR: A linear time randomized sieve algorithm for the closest-pair problem and its analysis are presented, extended to obtain a randomized linear time approximation algorithm forThe closest bichromatic pair problem.
References
More filters
Journal ArticleDOI
Should Tables Be Sorted
TL;DR: It is shown that, in a rather general model including al1 the commonly-used schemes, $\lceil $ lg(n+l) $\rceil$ probes to the table are needed in the worst case, provided the key space is sufficiently large.
Journal ArticleDOI
Storing a sparse table
TL;DR: This work proposes a good worst-case method for storing a static table of n entries, each an integer between 0 and N - 1, and analysis shows why a simpler algorithm used for compressing LR parsing tables works so well.
Journal ArticleDOI
Perfect hashing functions: a single probe retrieving method for static sets
TL;DR: A refinement of hashing which allows retrieval of an item in a static table with a single probe is considered, and a rough comparison with ordinary hashing is given which shows that this method can be used conveniently in several practical applications.
Journal ArticleDOI
Reciprocal hashing: a method for generating minimal perfect hashing functions
TL;DR: A method is presented for building minimal perfect hash functions, i.e., functions which allow single probe retrieval from minimally sized tables of identifier sets, and a proof of existence for minimalperfect hash functions of a special type (reciprocal type) is given.