Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleJune 2023
Fingerprinting-based Minimal Perfect Hashing Revisited
ACM Journal of Experimental Algorithmics (JEA), Volume 28Article No.: 1.4, Pages 1–16https://doi.org/10.1145/3596453In this paper we study a fingerprint-based minimal perfect hash function (FMPH for short). While FMPH is not as space-efficient as some other minimal perfect hash functions (for example RecSplit, CHD, or PTHash), it has a number of practical advantages ...
- articleApril 2012
Cores of random r-partite hypergraphs
Information Processing Letters (IPRL), Volume 112, Issue 8-9Pages 314–319https://doi.org/10.1016/j.ipl.2011.10.017We show that the threshold c"r","k (in terms of the average degree of the graph) for appearance of a k-core in a random r-partite r-uniform hypergraph G"r","n","m is the same as for a random r-uniform hypergraph with cn/r edges without the r-partite ...
- articleJuly 2011
Minimal perfect hashing: A competitive method for indexing internal memory
Information Sciences: an International Journal (ISCI), Volume 181, Issue 13Pages 2608–2625https://doi.org/10.1016/j.ins.2009.12.003A perfect hash function (PHF) is an injective function that maps keys from a set S to unique values. Since no collisions occur, each key can be retrieved from a hash table with a single probe. A minimal perfect hash function (MPHF) is a PHF with the ...
