Perfect hashing
Zbigniew J. Czech,George Havas,Bohdan S. Majewski +2 more
- Vol. 182, Iss: 1, pp 1-143
Reads0
Chats0
About:
The article was published on 1997-08-15 and is currently open access. It has received 130 citations till now. The article focuses on the topics: Perfect hash function.read more
Citations
More filters
Book ChapterDOI
Revocation and Tracing Schemes for Stateless Receivers
TL;DR: In this paper, the Subset-Cover framework is proposed for the stateless receiver case, where the users do not (necessarily) update their state from session to session, and sufficient conditions that guarantee the security of a revocation algorithm in this class are provided.
Journal ArticleDOI
Combinatorial properties of frameproof and traceability codes
TL;DR: In this paper, the authors studied different notions of traceability (TA) for pirated data and discussed equivalent formulations using structures such as perfect hash families, and used methods from combinatorics and coding theory to provide bounds (necessary conditions) and constructions (sufficient conditions) for the objects of interest.
Journal ArticleDOI
Perfect spatial hashing
Sylvain Lefebvre,Hugues Hoppe +1 more
TL;DR: A perfect multidimensional hash function is designed -- one that is precomputed on static data to have no hash collisions and is ideally suited for parallel SIMD evaluation on graphics hardware.
Book ChapterDOI
Simple and space-efficient minimal perfect hash functions
TL;DR: New algorithms for construction and evaluation of PHFs of a given set for m = n and m = 1.23n are presented, with the following properties: Evaluation of a PHF requires constant time.
Journal ArticleDOI
Quantum Overlapping Tomography
Jordan Cotler,Frank Wilczek +1 more
TL;DR: The theory of perfect hash families was used in this paper to show that all reduced density matrices of an unknown entangled state can be determined with at most ${e}^{\mathcal{O}(k)}{\mathrm{log}}^{2}(n)$ rounds of parallel measurements.
References
More filters
Journal ArticleDOI
Universal classes of hash functions
TL;DR: An input independent average linear time algorithm for storage and retrieval on keys that makes a random choice of hash function from a suitable class of hash functions.
Journal ArticleDOI
Storing a Sparse Table with 0(1) Worst Case Access Time
TL;DR: 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.
Journal ArticleDOI
Worst-case Analysis of Set Union Algorithms
Robert E. Tarjan,Jan van Leeuwen +1 more
TL;DR: It is shown that two one-pass methods proposed by van Leeuwen and van der Weide are asymptotically optimal, whereas several other methods, including one proposed by Rein and advocated by Dijkstra, are slower than the best methods.
Journal ArticleDOI
The birth of the giant component
TL;DR: In this paper, the authors derived the limiting distributions for the sparse connected components that are present when a random graph on n vertices has approximately 1/2n edges, and showed that such a graph consists entirely of trees, unicyclic components, and bicyclic components with probability approaching √2/3 cosh √5/18 ≈ 0.9957; the limiting probability that it is planar lies between 0.987 and 0.9325 as n∞.
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.