Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

31

FOCS
1999
IEEE

favoriteEmaildiscussreport

105views Theoretical Computer Science» more FOCS 1999»

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

14 years 3 months ago

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

Download web.sau.edu

David Peleg, Vitaly Rubinovich

Real-time Traffic

FOCS 1999 | Theoretical Computer Science |

claim paper

Related Content

» A NearTight Lower Bound on the Time Complexity of Distributed MinimumWeight Spanning Tree ...

» Sublinear Time Algorithms for Earth Movers Distance

» Optimal Parallel Construction of Hamiltonian Cycles and Spanning Trees in Random Graphs

» Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks

» GIST GroupIndependent Spanning Tree for Data Aggregation in Dense Sensor Networks

» Fast construction of overlay networks

» On the Use of Nondeterministic Automata for Presburger Arithmetic

» Boosting and HardCore Sets

» On Unconditionally Secure Distributed Oblivious Transfer

Post Info
More Details (n/a)

Added	03 Aug 2010
Updated	03 Aug 2010
Type	Conference
Year	1999
Where	FOCS
Authors	David Peleg, Vitaly Rubinovich

Comments (0)