Copyright © Philip M. Parker, INSEAD. Terms of Use.
| Domain | Definition |
Math | A way of handling collisions, that is, when two or more items should be kept in the same location, especially in a hash table. The general ways are keeping subsequent items within the table (open addressing), keeping a list for items which collide (direct chaining hashing or separate chaining hashing), keeping a special overflow area, etc. Perfect hashes avoid collisions, but may be time-consuming to create. (references) |
Source: compiled by the editor from various references; see credits. | |
Crosswords: COLLISION RESOLUTION SCHEME |
| Specialty definitions using "COLLISION RESOLUTION SCHEME": clustering free ♦ open addressing. (references) |
Source: compiled by the editor from various references; see credits. |
Hexadecimal (or equivalents, 770AD-1900s) (references)43 4F 4C 4C 49 53 49 4F 4E 52 45 53 4F 4C 55 54 49 4F 4E 53 43 48 45 4D 45 |
| Leonardo da Vinci (1452-1519; backwards) (references)
|
Binary Code (1918-1938, probably earlier) (references)01000011 01001111 01001100 01001100 01001001 01010011 01001001 01001111 01001110 00100000 01010010 01000101 01010011 01001111 01001100 01010101 01010100 01001001 01001111 01001110 00100000 01010011 01000011 01001000 01000101 01001101 01000101 |
HTML Code (1990) (references)C O L L I S I O N   R E S O L U T I O N   S C H E M E |
ISO 10646 (1991-1993) (references)0043 004F 004C 004C 0049 0053 0049 004F 004E 0052 0045 0053 004F 004C 0055 0054 0049 004F 004E 0053 0043 0048 0045 004D 0045 |
Encryption (beginner's substitution cypher): (references)3749464643534349482523953494655544349482533742394739 |
| 1. Crosswords 2. Orthography 3. Bibliography |
Copyright © Philip M. Parker, INSEAD. Terms of Use.
