Pages that link to "Item:Q3095315"

The following pages link to Trading Bit, Message, and Time Complexity of Distributed Algorithms (Q3095315):

Displaying 8 items.

• A distributed enumeration algorithm and applications to all pairs shortest paths, diameter\dots (Q259059) (← links)
• Randomised distributed MIS and colouring algorithms for rings with oriented edges in \(O(\sqrt{\log n})\) bit rounds (Q342718) (← links)
• Symmetry breaking depending on the chromatic number or the neighborhood growth (Q392191) (← links)
• Deterministic leader election takes \(\Theta (D + \log n)\) bit rounds (Q1741851) (← links)
• Message lower bounds via efficient network synchronization (Q2292919) (← links)
• Message Lower Bounds via Efficient Network Synchronization (Q2835018) (← links)
• Trading Bit, Message, and Time Complexity of Distributed Algorithms (Q3095315) (← links)
• On the Microscopic View of Time and Messages (Q4686647) (← links)