Minimal perfect hashing in polynomial time
From MaRDI portal
DOI10.1007/BF02017345zbMATH Open0696.68078OpenAlexW2040532663MaRDI QIDQ911304FDOQ911304
Authors: Vincent G. Winters
Publication date: 1990
Published in: BIT (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02017345
Recommendations
Information storage and retrieval of data (68P20) Analysis of algorithms and problem complexity (68Q25) Data structures (68P05)
Cites Work
Cited In (17)
- A perfect hashing incremental scheme for unranked trees using pseudo-minimal automata
- Graphs, hypergraphs and hashing
- On the Circuit Complexity of Perfect Hashing
- Title not available (Why is that?)
- Quasi-perfect Hashing
- Experimental and Efficient Algorithms
- A Linear Time Algorithm for Finding Minimal Perfect Hash Functions
- Polynomial hash functions are reliable (extended abstract)
- An optimal algorithm for generating minimal perfect hash functions
- An algebraic approach to Cichelli's perfect hashing
- Title not available (Why is that?)
- Secure two-party input-size reduction: challenges, solutions and applications
- Construct a perfect word hash function in time independent of the size of integers
- An ordered minimal perfect hashing scheme based upon Euler's theorem
- A compact hash function for paths in PERT networks
- Perfect hashing
- A scheme for constructing ordered minimal perfect hashing functions
This page was built for publication: Minimal perfect hashing in polynomial time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q911304)