| |
| 2000 | ||
|---|---|---|
| 5 | EE | Misha Koshelev: Every Superinterval of the Function Range Can Be an Interval-Computations Enclosure. Reliable Computing 6(2): 219-223 (2000) |
| 1999 | ||
| 4 | Misha Koshelev, Vladik Kreinovich, Luc Longpré: Encryption Algorithms Made (Somewhat) More Natural (a pedagogical remark). Bulletin of the EATCS 67: 153-156 (1999) | |
| 1998 | ||
| 3 | Misha Koshelev: Towards the Use of Aesthetics in Decision Making: Kolmogorov Complexity Formalizes Birkhoff's Idea. Bulletin of the EATCS 66: 166-170 (1998) | |
| 2 | EE | Misha Koshelev, Luc Longpré: A Brief Description of Gell-Mann's Lecture and How Intervals May Help to Describe Complexity in the Real World. Reliable Computing 4(1): 105-107 (1998) |
| 1 | EE | Misha Koshelev, Luc Longpré, Patrick Taillibert: Optimal Enclosure of Quadratic Interval Functions. Reliable Computing 4(4): 351-360 (1998) |
| 1 | Vladik Kreinovich | [4] |
| 2 | Luc Longpré | [1] [2] [4] |
| 3 | Patrick Taillibert | [1] |