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
Faster Deterministic Dictionaries
TL;DR: This paper narrows the gap between deterministic and randomized algorithms exponentially, from the factor of n^epsilon to an O(log n) factor, which is optimal for a certain class of deterministic hashing schemes.
Posted Content
Improved Distance Sensitivity Oracles with Subcubic Preprocessing Time
TL;DR: Chechik and Cohen as mentioned in this paper presented a simple distance sensitivity oracle with preprocessing time O(n 2.7233m) and query time O (1) for directed graphs.
Book ChapterDOI
Tight Bounds for Approximate Near Neighbor Searching for Time Series under the Fréchet Distance
TL;DR: In this paper , the authors studied the c-approximate near neighbor problem under the continuous Fréchet distance, and obtained new upper bounds that provide different tradeoffs between approximation factor, preprocessing time, and query time.
Proceedings ArticleDOI
Hide and Mine in Strings: Hardness and Algorithms
Giulia Bernardini,Alessio Conte,Garance Gourdel,Roberto Grossi,Grigorios Loukides,Nadia Pisanti,Solon P. Pissis,Giulia Punzi,Leen Stougie,Michelle Sweering +9 more
TL;DR: In this article, the fundamental relation between data sanitization and frequent pattern mining in the context of sequential (string) data is studied and several hardness results for different variants of this problem are presented, essentially showing that these variants cannot be solved or even approximated in polynomial time.
Proceedings ArticleDOI
A Dynamic Compressed Self-Index for Highly Repetitive Text Collections
TL;DR: This work develops the first compressed dynamic self- index, called the TST-index, that supports not only fast pattern search but also dynamic update operations for highly repetitive texts.
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.