Copyright © Philip M. Parker, INSEAD. Terms of Use.
| Domain | Definition |
Math | A binary search tree which stores consecutive values as intervals. (references) |
Source: compiled by the editor from various references; see credits. | |
Hexadecimal (or equivalents, 770AD-1900s) (references)44 49 53 43 52 45 54 45 49 4E 54 45 52 56 41 4C 45 4E 43 4F 44 49 4E 47 54 52 45 45 |
| Leonardo da Vinci (1452-1519; backwards) (references)
|
Binary Code (1918-1938, probably earlier) (references)01000100 01001001 01010011 01000011 01010010 01000101 01010100 01000101 00100000 01001001 01001110 01010100 01000101 01010010 01010110 01000001 01001100 00100000 01000101 01001110 01000011 01001111 01000100 01001001 01001110 01000111 00100000 01010100 01010010 01000101 01000101 |
HTML Code (1990) (references)D I S C R E T E   I N T E R V A L   E N C O D I N G   T R E E |
ISO 10646 (1991-1993) (references)0044 0049 0053 0043 0052 0045 0054 0045 0049 004E 0054 0045 0052 0056 0041 004C 0045 004E 0043 004F 0044 0049 004E 0047 0054 0052 0045 0045 |
Encryption (beginner's substitution cypher): (references)38435337523954392434854395256354623948374938434841254523939 |
| 1. Orthography 2. Bibliography |
Copyright © Philip M. Parker, INSEAD. Terms of Use.
