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