Pages that link to "Item:Q3546359"
From MaRDI portal
The following pages link to Bit complexity of breaking and achieving symmetry in chains and rings (Q3546359):
Displaying 17 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)
- About randomised distributed graph colouring and graph partition algorithms (Q710742) (← links)
- Deterministic leader election takes \(\Theta (D + \log n)\) bit rounds (Q1741851) (← links)
- Exact communication costs for consensus and leader in a tree (Q1827285) (← links)
- Fast protocols for leader election and spanning tree construction in a distributed network (Q2285076) (← links)
- Distributed communication complexity of spanning tree construction (Q2355664) (← links)
- Two absolute bounds for distributed bit complexity (Q2382670) (← links)
- Generalized symmetry breaking tasks and nondeterminism in concurrent objects (Q2802146) (← links)
- Bit complexity of breaking and achieving symmetry in chains and rings (extended abstract) (Q2819553) (← links)
- Trading Bit, Message, and Time Complexity of Distributed Algorithms (Q3095315) (← links)
- An Optimal Bit Complexity Randomized Distributed MIS Algorithm (Extended Abstract) (Q3408183) (← links)
- Communication Complexity of Wait-Free Computability in Dynamic Networks (Q5100966) (← links)
- Structural Information and Communication Complexity (Q5710078) (← links)
- The topology of randomized symmetry-breaking distributed computing (Q6645915) (← links)
