Vladislav Rutenburg

According to our database, Vladislav Rutenburg authored at least 9 papers between 1986 and 1993.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of five.

1993

Distributed algorithms for computing shortest pairs of disjoint paths.

Richard G. Ogier, Vladislav Rutenburg, Nachum Shacham

IEEE Trans. Inf. Theory, 1993

Propositional Truth Maintenance Systems: Classification and Complexity Analysis.

Vladislav Rutenburg

Ann. Math. Artif. Intell., 1993

Extract Maximum Information from Event-Driven Topology Updates.

Vladislav Rutenburg, Richard G. Ogier

Proceedings of the Proceedings IEEE INFOCOM '93, The Conference on Computer Communications, Twelfth Annual Joint Conference of the IEEE Computer and Communications Societies, Networking: Foundation for the Future, San Francisco, CA, USA, March 28, 1993

Robust Routing for Minimum Worst-Case Expected Delay in Unreliable Networks.

Richard G. Ogier, Vladislav Rutenburg

Proceedings of the Proceedings IEEE INFOCOM '93, The Conference on Computer Communications, Twelfth Annual Joint Conference of the IEEE Computer and Communications Societies, Networking: Foundation for the Future, San Francisco, CA, USA, March 28, 1993

1992

Minimum-Expected-Delay Alternate Routing.

Richard G. Ogier, Vladislav Rutenburg

Proceedings of the Proceedings IEEE INFOCOM '92, 1992

1991

Complexity Classification of Truth Maintenance Systems.

Vladislav Rutenburg

Proceedings of the STACS 91, 1991

Fair Charging Policies and Minimum-Expected-Cost Routing in Internets with Packet Loss.

Vladislav Rutenburg, Richard G. Ogier

Proceedings of the Proceedings IEEE INFOCOM '91, 1991

Efficient Distributed Algorithms for Computing Shortest Pairs of Maximally Disjoint Paths in Communication Networks.

Vladislav Rutenburg

Proceedings of the Proceedings IEEE INFOCOM '91, 1991

1986

Complexity of Generalized Graph Coloring.

Vladislav Rutenburg

Proceedings of the Mathematical Foundations of Computer Science 1986, 1986