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
Topics in combinatorial pattern matching
TL;DR: A lower bound is given on the time-space product for LCE data structures in the non-uniform cell probe model showing that the second trade-off is nearly optimal.
Journal ArticleDOI
Combinatorial power in multimedia processors
TL;DR: It is pointed out the significance of a few multimedia instructions in fundamental combinatorial problems such as hashing, sorting, minimum spanning tree and single source shortest paths and a simple model of multimedia processors for the algorithms community, highlighting the aspects of relevance in combinatorsial algorithms.
Linear Hashing
TL;DR: This work studies how good H is as a class of hash functions, namely it is considered hashing a set S of sizen into a range having the same cardinality n by a randomly chosen function from H and looks at the expected size of the largest hash bucket.
Leaders Election Without a Conflict Resolution Rule - Fast and Efficient Randomized Simulations among CRCW PRAMs
Joseph Gil,Yossi Matias +1 more
TL;DR: In this article, a randomized simulation of MAXIMUM (a very strong CRCW PRAM) on TOLERANT is presented, which runs in nearly doubly logarithmic time and linear space.
Posted Content
Parallel and External-Memory Construction of Minimal Perfect Hash Functions with PTHash.
TL;DR: This work proposes a new construction algorithm for PTHash enabling: (1) multi-threading, to either build functions more quickly or more space-efficiently, and (2) external-memory processing to scale to inputs much larger than the available internal memory.
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.