|
Search the dblp DataBase
Vladislav Rutenburg:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Vladislav Rutenburg
Complexity Classification of Truth Maintenance Systems. [Citation Graph (1, 0)][DBLP] STACS, 1991, pp:372-383 [Conf]
- Richard G. Ogier, Vladislav Rutenburg
Minimum-Expected-Delay Alternate Routing. [Citation Graph (0, 0)][DBLP] INFOCOM, 1992, pp:617-625 [Conf]
- 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]
- 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]
- 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]
- Vladislav Rutenburg, Richard G. Ogier
Extract Maximum Information from Event-Driven Topology Updates. [Citation Graph (0, 0)][DBLP] INFOCOM, 1993, pp:1004-1013 [Conf]
- Vladislav Rutenburg
Complexity of Generalized Graph Coloring. [Citation Graph (0, 0)][DBLP] MFCS, 1986, pp:573-581 [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:207-232 [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:443-455 [Journal]
Search in 0.001secs, Finished in 0.002secs
|