Sciweavers

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

116

Voted

SPAA
2003
ACM

90views Distributed And Parallel Com...» more SPAA 2003»

MST construction in O(log log n) communication rounds

15 years 10 months ago

MST construction in O(log log n) communication rounds

Download dcg.ethz.ch

Zvi Lotker, Elan Pavlov, Boaz Patt-Shamir, David P

Real-time Traffic

Distributed And Parallel Computing | SPAA 2003 |

claim paper

Related Content

» Local Maximal Matching and Local 2Approximation for Vertex Cover in UDGs

» CSP gaps and reductions in the lasserre hierarchy

» Hardness of Directed Routing with Congestion

» Byzantine agreement in the fullinformation model in Olog n rounds

» A Very Fast Linear Time Distributed Algorithm on General Graphs for the MinimumWeight Span...

» Deterministic distributed vertex coloring in polylogarithmic time

» Multiple Communication in MultiHop Radio Networks

» Remembering without Memory Tree Exploration by Asynchronous Oblivious Robots

» Secure MultiParty Sorting and Applications

Post Info
More Details (n/a)

Added	05 Jul 2010
Updated	05 Jul 2010
Type	Conference
Year	2003
Where	SPAA
Authors	Zvi Lotker, Elan Pavlov, Boaz Patt-Shamir, David Peleg

Comments (0)