Pages that link to "Item:Q1314268"
From MaRDI portal
The following pages link to The distributed bit complexity of the ring: From the anonymous to the non-anonymous case (Q1314268):
Displaying 13 items.
- A distributed enumeration algorithm and applications to all pairs shortest paths, diameter\dots (Q259059) (← links)
- On the time and the bit complexity of distributed randomised anonymous ring colouring (Q391396) (← links)
- Optimal bit complexity randomised distributed MIS and maximal matching algorithms for anonymous rings (Q391647) (← links)
- An optimal bit complexity randomized distributed MIS algorithm (Q658666) (← links)
- Anonymous wireless rings (Q673090) (← links)
- Message terminating algorithms for anonymous rings of unknown size (Q673475) (← links)
- About randomised distributed graph colouring and graph partition algorithms (Q710742) (← links)
- Computing on a partially eponymous ring (Q1004322) (← links)
- On the bit complexity of distributed computations in a ring with a leader (Q1098291) (← links)
- Deterministic leader election takes \(\Theta (D + \log n)\) bit rounds (Q1741851) (← links)
- An Optimal Bit Complexity Randomized Distributed MIS Algorithm (Extended Abstract) (Q3408183) (← links)
- The distributed bit complexity of the ring: From the anonymous to the non-anonymous case (Q3974855) (← links)
- Hundreds of impossibility results for distributed computing (Q5138488) (← links)
