![]() | ![]() |
2000 | ||
---|---|---|
2 | EE | David Peleg, Vitaly Rubinovich: A Near-Tight Lower Bound on the Time Complexity of Distributed Minimum-Weight Spanning Tree Construction. SIAM J. Comput. 30(5): 1427-1442 (2000) |
1999 | ||
1 | EE | David Peleg, Vitaly Rubinovich: A Near-Tight Lower Bound on the Time Complexity of Distributed MST Construction. FOCS 1999: 253-261 |
1 | David Peleg | [1] [2] |