Revision as of 07:59, 29 September 2021 edit JMarianczuk (talk \| contribs) 3 edits added concrete numbers for the CHD representation size ← Previous edit		Revision as of 22:14, 4 October 2021 edit undo Comp.arch (talk \| contribs) Extended confirmed users 41,498 edits mNo edit summary Tag: 2017 wikitext editor Next edit →
Line 131: \| year = 2009\| citeseerx = 10.1.1.568.130 \| url = http://cmph.sourceforge.net/papers/esa09.pdf }}.</ref> The best currently known minimal perfect hashing schemes can be represented using less than 1.56 bits/key if given enough time.<ref name="RecSplit">{{citation ~~<ref name="RecSplit">{{citation~~ \| last1 = Esposito \| first1 = Emmanuel \| last2 = Mueller Graf \| first2 = Thomas Line 195 ⟶ 194: \| year = 2004}}.</ref> == References == {{reflist\|30em}} == Further reading == Richard J. Cichelli. ''Minimal Perfect Hash Functions Made Simple'', Communications of the ACM, Vol. 23, Number 1, January 1980. [[Thomas H. Cormen]], [[Charles E. Leiserson]], [[Ronald L. Rivest]], and [[Clifford Stein]]. ''[[Introduction to Algorithms]]'', Third Edition. MIT Press, 2009. {{ISBN\|978-0262033848}}. Section 11.5: Perfect hashing, pp.267, 277–282. Line 206 ⟶ 205: * Douglas C. Schmidt, [http://www.dre.vanderbilt.edu/~schmidt/PDF/gperf.pdf GPERF: A Perfect Hash Function Generator], C++ Report, SIGS, Vol. 10, No. 10, November/December, 1998. == External links == [https://www.gnu.org/software/gperf/ gperf] is an [[Open Source]] C and C++ perfect hash generator (very fast, but only works for small sets) [http://burtleburtle.net/bob/hash/perfect.html Minimal Perfect Hashing (bob algorithm)] by Bob Jenkins

Perfect hash function: Difference between revisions