Perfect hashing
From MaRDI portal
Publication:1391123
DOI10.1016/S0304-3975(96)00146-6zbMath0954.68060OpenAlexW2914015934MaRDI QIDQ1391123
Bohdan S. Majewski, Zbigniew J. Czech, George Havas
Publication date: 22 July 1998
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(96)00146-6
Searching and sorting (68P10) Nonnumerical algorithms (68W05) Research exposition (monographs, survey articles) pertaining to computer science (68-02)
Related Items (22)
Bounds And Constructions For Threshold Shared Generation Of Authenticators ⋮ Perfect Hash Families: Constructions and Existence ⋮ Generalised cumulative arrays in secret sharing ⋮ Secret sharing schemes with partial broadcast channels ⋮ Volumetric geometry for DSMC and the Voldipar code ⋮ Computing the conjugate of convex piecewise linear-quadratic bivariate functions ⋮ Linear Time Constructions of Some $$d$$-Restriction Problems ⋮ Strengthening hash families and compressive sensing ⋮ Secure two-party input-size reduction: challenges, solutions and applications ⋮ Constructing heterogeneous hash families by puncturing linear transversal designs ⋮ An improved version of cuckoo hashing: average case analysis of construction cost and search operations ⋮ Some baby-step giant-step algorithms for the low hamming weight discrete logarithm problem ⋮ Explicit constructions of perfect hash families from algebraic curves over finite fields ⋮ How to squeeze a lexicon ⋮ New constructions for IPP codes ⋮ Broadcast authentication for group communication ⋮ Masking patterns in sequences: A new class of motif discovery with don't cares ⋮ Compact representations of automata for regular expression matching ⋮ Explicit constructions for perfect hash families ⋮ RESILIENT LKH: SECURE MULTICAST KEY DISTRIBUTION SCHEMES ⋮ Distributing hash families with few rows ⋮ Perfect hash families: Probabilistic methods and explicit constructions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The first cycles in an evolving graph
- Minimal perfect hashing in polynomial time
- A backtracking method for constructing perfect hash functions from a set of mapping functions
- An ordered minimal perfect hashing scheme based upon Euler's theorem
- Two results on tables
- An optimal algorithm for generating minimal perfect hash functions
- An optimal parallel dictionary
- Clocked adversaries for hashing
- The expected linearity of a simple equivalence algorithm
- Universal classes of hash functions
- A refinement of a compression-oriented addressing scheme
- An algebraic approach to Cichelli's perfect hashing
- Sudden emergence of a giant \(k\)-core in a random graph
- On the computational power of pushdown automata
- Storing a sparse table
- A Linear Time Algorithm for Finding Minimal Perfect Hash Functions
- Euler Graphs on Labelled Nodes
- The external language KLIPA for the URAL-2 digital computer
- On the Complexity of a Game Related to the Dictionary Problem
- The Spatial Complexity of Oblivious k-Probe Hash Functions
- On the Expected Performance of Path Compression Algorithms
- A Letter-oriented Minimal Perfect Hashing Scheme
- Storing a Sparse Table with 0 (1) Worst Case Access Time
- Worst-case Analysis of Set Union Algorithms
- Reciprocal hashing
- Algorithms for Generating Fundamental Cycles in a Graph
- Perfect hashing functions
- Comments on perfect hashing functions
- The Study of a New Perfect Hash Scheme
- A perfect parallel dictionary
- Polynomial hash functions are reliable
- The birth of the giant component
- The theory of languages
This page was built for publication: Perfect hashing
