The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Dima Burago: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

Search in 0.002secs, Finished in 0.002secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002