Dima Burago

According to our database, Dima Burago authored at least 4 papers between 1995 and 2004.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2004

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

1998

On the Average-Case Complexity of the Graph Reliability Problem on Gaussian Distributions.

Dima Burago, Michel de Rougemont

Fundam. Informaticae, 1998

1996

On the Complexity of Partially Observed Markov Decision Processes.

Dima Burago, Michel de Rougemont, Anatol Slissenko

Theor. Comput. Sci., 1996

1995

On the Complexity of Finite Memory Policies for Markov Decision Processes.

Danièle Beauquier, Dima Burago, Anatol Slissenko

Proceedings of the Mathematical Foundations of Computer Science 1995, 1995