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
Sublinear-Space Approximation Algorithms for Max r-SAT
Arindam Biswas,Venkatesh Raman +1 more
TL;DR: Sublinear space approximation algorithms for the SAT problem were proposed in this paper, where the authors take the viewpoint of space complexity following [Biswas et al., Algorithmica 2021] and design sublinear-space approximation algorithms.
Posted Content
Dynamic External Hashing: The Limit of Buffering
Zhewei Wei,Ke Yi,Qin Zhang +2 more
TL;DR: This paper studies the inherent query-insertion tradeoff of external hash tables in the presence of a memory buffer and shows that for any constant c>1, if the expected average successful query cost is targeted at 1+O(1/bc) I/Os, then it is not possible to support insertions in less than 1-O( 1/bc-1/6) I-Os amortized, which means that the memory buffer is essentially useless.
using absent words.
TL;DR: This paper presents the first linear-time and linear-space algorithm to compare two sequences by considering all their minimal absent words, and presents an algorithm that, given a word x, computes the largest integer for which all factors of x of that length occur in some minimal absent word of x in time and space O ( n ) .
Journal ArticleDOI
When Tree Meets Hash: Reducing Random Reads for Index Structures on Persistent Memories
TL;DR: In this article , the authors proposed an efficient indexing structure for PM that significantly reduces tree heights to minimize random reads, while still maintaining fast in-node search speed, using extendible hashing for each node in a radix tree.
Journal ArticleDOI
Corrigendum: Explicit Construction of a Small Epsilon-Net for Linear Threshold Functions
TL;DR: In this article , Rabani and Shpilka corrected mistakes and inaccuracies in technical claims in [Y. Rabani et al., 2010] and A. Shpila et al. [2010] .
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.