Copyright © Philip M. Parker, INSEAD. Terms of Use.
| Domain | Definition |
Math | A priority queue which simultaneously keeps track of the maximum and minimum keys, and supports operations efficiently on either extreme (minimum or maximum). (references) |
Source: compiled by the editor from various references; see credits. | |
Hexadecimal (or equivalents, 770AD-1900s) (references)44 4F 55 42 4C 45 2D 45 4E 44 45 44 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)01000100 01001111 01010101 01000010 01001100 01000101 00101101 01000101 01001110 01000100 01000101 01000100 00100000 01010000 01010010 01001001 01001111 01010010 01001001 01010100 01011001 00100000 01010001 01010101 01000101 01010101 01000101 |
HTML Code (1990) (references)D O U B L E - E N D E D   P R I O R I T Y   Q U E U E |
ISO 10646 (1991-1993) (references)0044 004F 0055 0042 004C 0045 002D 0045 004E 0044 0045 0044 0050 0052 0049 004F 0052 0049 0054 0059 0051 0055 0045 0055 0045 |
Encryption (beginner's substitution cypher): (references)3849553646391539483839382505243495243545925155395539 |
| 1. Orthography 2. Bibliography |
Copyright © Philip M. Parker, INSEAD. Terms of Use.
