Vitaly Rubinovich

According to our database, Vitaly Rubinovich authored at least 2 papers between 1999 and 2000.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2000

A Near-Tight Lower Bound on the Time Complexity of Distributed Minimum-Weight Spanning Tree Construction.

David Peleg, Vitaly Rubinovich

SIAM J. Comput., 2000

1999

A Near-Tight Lower Bound on the Time Complexity of Distributed MST Construction.

David Peleg, Vitaly Rubinovich

Proceedings of the 40th Annual Symposium on Foundations of Computer Science, 1999