Copyright © Philip M. Parker, INSEAD. Terms of Use.

MINIMAL PERFECT HASHING

Specialty Definition: MINIMAL PERFECT HASHING

Domain	Definition
Math	A perfect hashing function that maps each different key to a distinct integer and has the same number of possible integers as keys. Formally, given a set of N keys, the size of the range is N. (references)
Source: compiled by the editor from various references; see credits.

Crosswords: MINIMAL PERFECT HASHING

Specialty definitions using "MINIMAL PERFECT HASHING": order preserving minimal perfect hashing. (references)

Alternative Orthography: MINIMAL PERFECT HASHING

Hexadecimal (or equivalents, 770AD-1900s) (references)

4D 49 4E 49 4D 41 4C 50 45 52 46 45 43 54 48 41 53 48 49 4E 47

Leonardo da Vinci (1452-1519; backwards) (references)

Binary Code (1918-1938, probably earlier) (references)

01001101 01001001 01001110 01001001 01001101 01000001 01001100 00100000 01010000 01000101 01010010 01000110 01000101 01000011 01010100 00100000 01001000 01000001 01010011 01001000 01001001 01001110 01000111

HTML Code (1990) (references)

&#77 &#73 &#78 &#73 &#77 &#65 &#76 &#32 &#80 &#69 &#82 &#70 &#69 &#67 &#84 &#32 &#72 &#65 &#83 &#72 &#73 &#78 &#71

ISO 10646 (1991-1993) (references)

004D 0049 004E 0049 004D 0041 004C 0050 0045 0052 0046 0045 0043 0054 0048 0041 0053 0048 0049 004E 0047

Encryption (beginner's substitution cypher): (references)

47434843473546250395240393754242355342434841

INDEX

1. Crosswords
2. Orthography
3. Bibliography

Copyright © Philip M. Parker, INSEAD. Terms of Use.