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
Posted Content
The Power of Hashing with Mersenne Primes
TL;DR: This paper shows that the output of the hash function is a $b-bit integer that is uniformly distributed in $[2^b]$, except that $p$ (the all \texttt1s value) is missing, and provides a new fast branch-free code for division and modulus with Mersenne primes.
Journal ArticleDOI
An Improved Color Coding Algorithm Based on Hybrid Architecture: An Improved Color Coding Algorithm Based on Hybrid Architecture
Efficient error-correcting data structures
TL;DR: This paper relaxes the requirements on error-correcting data structures: this relaxation allows us to construct efficient, near-optimal data structures for a number of fundamental data structure problems, including versions of the MEMBERSHIP, PREDECESSOR, and RANK problems.
Random input helps searching predecessors
TL;DR: The dynamic Predecessor Problem is solved with high probability (whp) in constant time, using only $n^{1+\delta}$ bits of memory, for any constant $\delta > 0$.
Posted Content
Efficient Dynamic Approximate Distance Oracles for Vertex-Labeled Planar Graphs
Itay Laish,Shay Mozes +1 more
TL;DR: In this article, the authors present three different dynamic approximate vertex-labeled distance oracles for planar graphs, all with polylogarithmic query and update times, and nearly linear space requirements.
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.