| |
| 2004 | ||
|---|---|---|
| 4 | EE | Dima Burago, Dima Grigoriev, Anatol Slissenko: Approximating shortest path for the skew lines problem in time doubly logarithmic in 1/epsilon. Theor. Comput. Sci. 315(2-3): 371-404 (2004) |
| 1998 | ||
| 3 | Dima Burago, Michel de Rougemont: On the Average-Case Complexity of the Graph Reliability Problem on Gaussian Distributions. Fundam. Inform. 36(4): 307-315 (1998) | |
| 1996 | ||
| 2 | EE | Dima Burago, Michel de Rougemont, Anatol Slissenko: On the Complexity of Partially Observed Markov Decision Processes. Theor. Comput. Sci. 157(2): 161-183 (1996) |
| 1995 | ||
| 1 | Danièle Beauquier, Dima Burago, Anatol Slissenko: On the Complexity of Finite Memory Policies for Markov Decision Processes. MFCS 1995: 191-200 | |
| 1 | Danièle Beauquier | [1] |
| 2 | Dima Grigoriev | [4] |
| 3 | Michel de Rougemont | [2] [3] |
| 4 | Anatol Slissenko | [1] [2] [4] |