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
Bipartite Perfect Matching is in Quasi-NC
TL;DR: It is shown that the bipartite perfect matching problem is in quasi-NC^2, that is, it has uniform circuits of quasi-polynomial size $n^{O(\log n)}$ and depth.
Proceedings ArticleDOI
Hardness Magnification for all Sparse NP Languages
Lijie Chen,Ce Jin,Ryan Williams +2 more
TL;DR: In this paper, the hardness magnifications for search-MCSP and search-MKtP (where one must output small circuits or short representations of strings) were studied and shown to exist for all equally-sparse NP languages.
Efficient submatch addressing for regular expressions
TL;DR: In this thesis, a new method for solving the submatch addressing problem using nondeterministic finite automata with transitions augmented by copy-on-write update operations is proposed, which makes it possible to use any regular expression without performance problems, which is not the case with previous implementations or algorithms.
Proceedings ArticleDOI
Finding the neighborhood of a query in a dictionary
TL;DR: The paper defines a theoretical framework to study the performance of algorithms for this problem, and provides a basic algorithmic approach, and shows that a certain class of algorithms, D-oblivious algorithms, can not be optimal both in space and time.
Proceedings ArticleDOI
Implicit O(1) probe search
Amos Fiat,M. Noar +1 more
TL;DR: A constructive solution and a nonconstructive proof are given for the tight relationship between hashing and certain encoding problems and better bounds are given on the maximum amount of elements for which implicit O (1) probe search can be done.
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.