Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 233,847,609 papers from all fields of science
Search
Sign In
Create Free Account
Perfect hash function
Known as:
Minimal perfect hashing
, MPHF
, Sloppy hashing
Expand
In computer science, a perfect hash function for a set S is a hash function that maps distinct elements in S to a set of integers, with no collisions…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
15 relations
Array data structure
Collision (computer science)
Computer science
Cuckoo hashing
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
A Multi-dimensional Progressive Perfect Hashing for High-Speed String Matching
Yang Xu
,
L. Ma
,
Zhaobo Liu
,
H. J. Chao
ACM/IEEE Seventh Symposium on Architectures for…
2011
Corpus ID: 6282764
Aho-Corasick (AC) automaton is widely used for multi-string matching in today's Network Intrusion Detection System (NIDS). With…
Expand
2009
2009
Solving Games in Parallel with Linear-Time Perfect Hash Functions
S. Edelkamp
,
H. Messerschmidt
,
Damian Sulewski
,
Cengizhan Yücel
2009
Corpus ID: 115705692
In this paper, we propose an efficient method of solving oneand two-player combinatorial games by mapping each state to a unique…
Expand
2009
2009
Theory and Practise of Monotone Minimal Perfect Hashing
D. Belazzougui
,
P. Boldi
,
R. Pagh
,
S. Vigna
Workshop on Algorithm Engineering and…
2009
Corpus ID: 21082067
Minimal perfect hash functions have been shown to be useful to compress data in several data management tasks. In particular…
Expand
Highly Cited
2008
Highly Cited
2008
Self-Assembly of Polypeptide/π-Conjugated Polymer/Polypeptide Triblock Copolymers in Rod−Rod−Rod and Coil−Rod−Coil Conformations
L. Rubatat
,
X. Kong
,
S. Jenekhe
,
J. Ruokolainen
,
M. Hojeij
,
R. Mezzenga
2008
Corpus ID: 55755228
Self-assembly in the bulk of a series of hybrid triblock copolymers formed by a poly(9,9-dihexylfluorene-2,7-diyl) (PHF) middle…
Expand
1999
1999
A practical perfect hashing algorithm
Craig Silverstein
Data Structures, Near Neighbor Searches, and…
1999
Corpus ID: 16699140
Hashing is a fundamental technique in Computer Science, and perfect hashing, which guarantees constant-time lookup, has…
Expand
1998
1998
Approximations of the Mulliken Charges for the Oxygen and Silicon Atoms of Zeolite Frameworks Calculated with a Periodic Hartree)Fock Scheme
A. Larin
,
D. P. Vercauteren
1998
Corpus ID: 96610299
Distributed multipole analysis DMA on the basis of periodic . Hartree)Fock PHF calculations, using the CRYSTAL code, is applied…
Expand
1997
1997
Enumerating Backgammon Positions: The Perfect Hash
A. Benjamin
,
Andrew M. Ross
1997
Corpus ID: 60574812
Like many games, people place money wagers on backgammon games. These wagers can change during the game. In order to make…
Expand
1996
1996
Static dictionaries on AC/sup 0/ RAMs: query time /spl theta/(/spl radic/log n/log log n) is necessary and sufficient
A. Andersson
,
Peter Bro Miltersen
,
Søren Riis
,
M. Thorup
Proceedings of 37th Conference on Foundations of…
1996
Corpus ID: 9232175
In this paper we consider solutions to the static dictionary problem on AC/sup 0/ RAMs, i.e. random access machines where the…
Expand
1994
1994
Application of Minimal Perfect Hashing in Main Memory Indexing
Y. Ho
1994
Corpus ID: 60481391
With the rapid decrease in the cost of random access memory (RAM), it will soon become economically feasible to place full-text…
Expand
Review
1989
Review
1989
Implementation of a Perfect Hash Function Scheme
Sanjeev Datta
,
E. Fox
1989
Corpus ID: 53838187
This report surveys the recent development in computing perfect hash functions, and in particular, closely examines an algorithm…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE