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
Trans-Dichotomous Algorithms Without Multiplication - Some Upper and Lower Bounds
TL;DR: It is shown that on a RAM with addition, subtraction, bitwise Boolean operations and shifts, but no multiplication, there is a transdichotomous solution to the static dictionary problem using linear space and with query time.
Book ChapterDOI
Biometric Identification over Encrypted Data Made Feasible
TL;DR: The construction for biometric identification is resilient to statistical attacks, an aspect yet to be considered in the previous constructions of SSE, and the use of symmetric cryptography enables to achieve reasonable computational costs for each identification request.
Dissertation
Sparse graph codes for compression, sensing, and secrecy
TL;DR: The main results include the introduction of a new security critertion which is an information-theoretic analog of semantic security, the construction of capacity-achieving codes possessing strong security with nearly linear time encoding and decoding algorithms for any degraded wiretap channel, and the constructionOf capacity-achy codes possessing semantic security with linear time encode and decode algorithms for erasure wiretap channels.
Proceedings ArticleDOI
Bloom Filter with a False Positive Free Zone
TL;DR: A data structure, called EGH filter, is proposed that supports the Bloom filter operations and besides it can guarantee false positive free operations for a finite universe and a restricted number of elements stored in the filter.
Journal ArticleDOI
Time–space trade-offs for Lempel–Ziv compressed indexing
TL;DR: In this paper, a compressed index based on the Lempel-Ziv 1977 compression scheme is presented, which uses O(m + occ lg lg lg n + lg ϵ ϵ n + o(m lg ε n ) time for constant-sized alphabets, where n and m are the length of the input string and query string respectively.
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.