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
Dissertation
Sub-linear algorithms for shortest unique substring and maximal unique matches
TL;DR: Sub-linear algorithms for the Shortest Unique Substring problem and the Maximal Unique Matches problem are presented here, which are a combination of two simple techniques – Rabin-Karp fingerprint and Bloom Filters; this makes the work easily amenable to implementations.
Posted Content
Pseudo-random graphs and bit probe schemes with one-sided error
TL;DR: In this model, it is shown that for the membership problem there exists a bit-probe scheme with one-sided error that needs space of O(nlog2m+poly(logm)) bits, which cannot be achieved in the model without cache and a slightly weaker result is obtained for a scheme that is effectively encodable.
Dissertation
Watermarking spustiteľného kódu
TL;DR: Watermarking spustiteľneho kodu is jedným z nastrojov boja proti neopravnenemu kopirovaniu a použivaniu softveru as discussed by the authors.
Proceedings ArticleDOI
A Hash Table Without Hash Functions, and How to Get the Most Out of Your Random Bits
TL;DR: This paper shows how to construct a randomized data structure that has the same guarantees as a hash table, but that avoids the direct use of hash functions, and constructs a succinct hash table whose probabilistic guarantees fall on a different extreme.
Posted Content
Triangle Centrality
TL;DR: In this paper, the authors give an algorithm for computing triangle centrality in MapReduce that takes $O(m+n)$ space, where n is the matrix product exponent.
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.