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 Article
Robust information-theoretic Private Information Retrieval
Amos Beimel,Yoav Stahl +1 more
TL;DR: In this article, the authors proposed robust PIR protocols, which still work correctly even if only k out of servers are available during the protocols' operation (the user does not know in advance which servers were available).
Journal ArticleDOI
Linear hash functions
TL;DR: In the course of the proof, a tool is developed which may be of independent interest which helps to understand how good inline-equation is as a class of hash functions for any finite field.
Journal ArticleDOI
Rigorous Time/Space Trade-offs for Inverting Functions
Amos Fiat,Moni Naor +1 more
TL;DR: This work provides rigorous time/space trade-offs for inverting any function, and gives a more general trade-off, T S3 = N3, that can invert any function at any point.
Proceedings ArticleDOI
Simulating BPP using a general weak random source
TL;DR: It is shown how to simulate BPP and approximation algorithms in polynomial time using the output from a delta -source and two applications are given to show the difficulty of approximating the size of the maximum clique.
Patent
Method and apparatus determining and using hash functions and hash values
TL;DR: In this paper, the hash functions are created using linear arithmetic and 4-byte machine register operations and thus can be created very quickly, and can be used to determine and use nearly uniform independent hash functions.
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.