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

David Peleg, Vitaly Rubinovich (2000)

> Home

Details and statistics

DOI: 10.1137/S0097539700369740

access: closed

type: Journal Article

metadata version: 2022-10-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/siamcomp/PelegR00
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamcomp/PelegR00
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)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.