Copyright © Philip M. Parker, INSEAD. Terms of Use.
| Domain | Definition |
Math | A priority queue in which a key being inserted is never higher in priority than a previously deleted node. (references) |
Source: compiled by the editor from various references; see credits. | |
Hexadecimal (or equivalents, 770AD-1900s) (references)4D 4F 4E 4F 54 4F 4E 45 50 52 49 4F 52 49 54 59 51 55 45 55 45 |
| Leonardo da Vinci (1452-1519; backwards) (references)
|
Binary Code (1918-1938, probably earlier) (references)01001101 01001111 01001110 01001111 01010100 01001111 01001110 01000101 00100000 01010000 01010010 01001001 01001111 01010010 01001001 01010100 01011001 00100000 01010001 01010101 01000101 01010101 01000101 |
HTML Code (1990) (references)M O N O T O N E   P R I O R I T Y   Q U E U E |
ISO 10646 (1991-1993) (references)004D 004F 004E 004F 0054 004F 004E 0045 0050 0052 0049 004F 0052 0049 0054 0059 0051 0055 0045 0055 0045 |
Encryption (beginner's substitution cypher): (references)47494849544948392505243495243545925155395539 |
| 1. Orthography 2. Bibliography |
Copyright © Philip M. Parker, INSEAD. Terms of Use.
