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
Combinatorics Using Computational Methods
TL;DR: This work was supported in part by a grant from the National Endowment for the Arts, $10,000 (£6,000) and a University of Nebraska Presidential Fellowship.
Proceedings Article
Converting High Probability into Nearly-Constant Time-with Applications to Parallel Hashing (Extended Abstract)
Yossi Matias,Uzi Vishkin +1 more
TL;DR: This work presents a new paradigm for efficient randomized parallel algorithms that needs ~(log’ n) time, where ~(x) means ‘O(Z) expected’, and obtains an optimal integer sorting adgorithm that runs in O( log log n K ) time.
Book ChapterDOI
Uniform algorithms for deterministic construction of efficient dictionaries
TL;DR: This work presents an improvement in the class of dictionaries free from weak non-uniformity and with stress on faster searches, and various search-update time trade-offs are obtained.
Posted Content
Superbloom: Bloom filter meets Transformer
TL;DR: The idea of word pieces in natural language models is extended to machine learning tasks on opaque ids by applying hash functions to map each id to multiple hash tokens in a much smaller space, similarly to a Bloom filter, and by applying a multi-layer Transformer to these Bloom filter digests, models with high accuracy are obtained.
Journal ArticleDOI
ReachFewL = ReachUL
TL;DR: It is shown that two complexity classes introduced about two decades ago are unconditionally equal and ReachFewL = ReachUL.
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.