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
Book ChapterDOI
Simple and space-efficient minimal perfect hash functions
TL;DR: New algorithms for construction and evaluation of PHFs of a given set for m = n and m = 1.23n are presented, with the following properties: Evaluation of a PHF requires constant time.
Proceedings ArticleDOI
Nearest common ancestors: a survey and a new distributed algorithm
TL;DR: A new simple algorithm is presented that labels the nodes of a rooted tree such that from the labels of two nodes alone one can compute in constant time the label of their nearest common ancestor.
Book ChapterDOI
Succinct dynamic dictionaries and trees
Rajeev Raman,S. Srinivasa Rao +1 more
TL;DR: It is shown that a binary tree on n nodes, where each node has b = O(lg n)-bit data stored at it, can be maintained under node insertions while supporting navigation in O(1) time and updates in O((lg lg n)1+Ɛ) amortised time, for any constant Ɛ > 0.
Balanced Allocations (Extended abstract)
TL;DR: It is shown that with high probability, the fullest box contains only lnlnn/ln2 + O(1) balls - exponentially less than before - and that a similar gap exists in the infinite process, where at each step one ball, chosen uniformly at random, is deleted, and one ball is added.
Book ChapterDOI
Polynomial Hash Functions Are Reliable (Extended Abstract)
TL;DR: In this paper, it was shown that polynomial hash functions are not reliable, and for certain important properties linear hash functions and quadratic hash functions might not be reliable.
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.