On the Complexity of Finite Memory Policies for Markov Decision Processes. - Danièle Beauquier; Dima Burago; Anatol Slissenko (MFCS, 1995)

On the Complexity of Partially Observed Markov Decision Processes. - Dima Burago; Michel de Rougemont; Anatol Slissenko (Theor. Comput. Sci., 1996)

On the Average-Case Complexity of the Graph Reliability Problem on Gaussian Distributions. - Dima Burago; Michel de Rougemont (Fundam. Informaticae, 1998)

Approximating shortest path for the skew lines problem in time doubly logarithmic in 1/epsilon. - Dima Burago; Dima Grigoriev; Anatol Slissenko (Theor. Comput. Sci., 2004)