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
Proceedings ArticleDOI
Attribute-efficient learning in query and mistake-bound models
TL;DR: A variant of the membership query model in which the learning algorithm is given as input the number of relevant variables of the target function, using a number-theoretic coloring technique, it is shown that in this model, any class of functions that can be learned in polynomial time can be learning attributeefficiently in poynomial time.
Posted Content
Internal Pattern Matching Queries in a Text and Applications
TL;DR: In this article, an optimal data structure for the problem of internal pattern matching is proposed, which provides constant-time answers to queries about occurrences of one subword $x$ in another subword$y$ of a given text, assuming that $|y|=\mathcal{O(|x|)$ which allows for a constant space representation of all occurrences.
Proceedings Article
Theory and practise of monotone minimal perfect hashing
TL;DR: This work analyzes experimentally the data structures proposed in [1], and proposes some new methods that, albeit asymptotically equivalent or worse, perform very well in practise, and provide a balance between access speed, ease of construction, and space usage.
Journal ArticleDOI
Searching among intervals and compact routing tables
TL;DR: Both strategies introduce techniques for storing collections of disjoint intervals over the integers from 1 ton, so that identifying the interval within which a given integer falls can be performed quickly.
Proceedings ArticleDOI
On AC0 implementations of fusion trees and atomic heaps
TL;DR: The answer is "no" unless you have room for a multiplication table, and both fusion trees and Fredman and Willard's later atomic heaps can be implemented using AC0 operations on emerging multimedia processors such as the Pentium 4.
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.