The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Vladislav Rutenburg: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Vladislav Rutenburg
    Complexity Classification of Truth Maintenance Systems. [Citation Graph (1, 0)][DBLP]
    STACS, 1991, pp:372-383 [Conf]
  2. Richard G. Ogier, Vladislav Rutenburg
    Minimum-Expected-Delay Alternate Routing. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 1992, pp:617-625 [Conf]
  3. Richard G. Ogier, Vladislav Rutenburg
    Robust Routing for Minimum Worst-Case Expected Delay in Unreliable Networks. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 1993, pp:338-346 [Conf]
  4. Vladislav Rutenburg
    Efficient Distributed Algorithms for Computing Shortest Pairs of Maximally Disjoint Paths in Communication Networks. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 1991, pp:1214-1219 [Conf]
  5. Vladislav Rutenburg, Richard G. Ogier
    Fair Charging Policies and Minimum-Expected-Cost Routing in Internets with Packet Loss. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 1991, pp:279-288 [Conf]
  6. Vladislav Rutenburg, Richard G. Ogier
    Extract Maximum Information from Event-Driven Topology Updates. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 1993, pp:1004-1013 [Conf]
  7. Vladislav Rutenburg
    Complexity of Generalized Graph Coloring. [Citation Graph (0, 0)][DBLP]
    MFCS, 1986, pp:573-581 [Conf]
  8. Vladislav Rutenburg
    Propositional Truth Maintenance Systems: Classification and Complexity Analysis. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 1993, v:10, n:3, pp:207-232 [Journal]
  9. Richard G. Ogier, Vladislav Rutenburg, Nacham Shacham
    Distributed algorithms for computing shortest pairs of disjoint paths. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1993, v:39, n:2, pp:443-455 [Journal]

Search in 0.003secs, Finished in 0.004secs
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