
Search the dblp DataBase
Vladislav Rutenburg:
[Publications]
[Author Rank by year]
[Coauthors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
 Vladislav Rutenburg
Complexity Classification of Truth Maintenance Systems. [Citation Graph (1, 0)][DBLP] STACS, 1991, pp:372383 [Conf]
 Richard G. Ogier, Vladislav Rutenburg
MinimumExpectedDelay Alternate Routing. [Citation Graph (0, 0)][DBLP] INFOCOM, 1992, pp:617625 [Conf]
 Richard G. Ogier, Vladislav Rutenburg
Robust Routing for Minimum WorstCase Expected Delay in Unreliable Networks. [Citation Graph (0, 0)][DBLP] INFOCOM, 1993, pp:338346 [Conf]
 Vladislav Rutenburg
Efficient Distributed Algorithms for Computing Shortest Pairs of Maximally Disjoint Paths in Communication Networks. [Citation Graph (0, 0)][DBLP] INFOCOM, 1991, pp:12141219 [Conf]
 Vladislav Rutenburg, Richard G. Ogier
Fair Charging Policies and MinimumExpectedCost Routing in Internets with Packet Loss. [Citation Graph (0, 0)][DBLP] INFOCOM, 1991, pp:279288 [Conf]
 Vladislav Rutenburg, Richard G. Ogier
Extract Maximum Information from EventDriven Topology Updates. [Citation Graph (0, 0)][DBLP] INFOCOM, 1993, pp:10041013 [Conf]
 Vladislav Rutenburg
Complexity of Generalized Graph Coloring. [Citation Graph (0, 0)][DBLP] MFCS, 1986, pp:573581 [Conf]
 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:207232 [Journal]
 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:443455 [Journal]
Search in 0.003secs, Finished in 0.004secs
