Pages that link to "Item:Q6487488"
From MaRDI portal
The following pages link to Improved deterministic distributed matching via rounding (Q6487488):
Displaying 13 items.
- Improved deterministic distributed matching via rounding (Q2189173) (← links)
- Improved Distributed Approximate Matching (Q3177747) (← links)
- An Exponential Separation between Randomized and Deterministic Complexity in the LOCAL Model (Q4620411) (← links)
- A Time Hierarchy Theorem for the LOCAL Model (Q4646447) (← links)
- Distributed Approximate Maximum Matching in the CONGEST Model. (Q5090895) (← links)
- Network Decomposition and Distributed Derandomization (Invited Paper) (Q5100942) (← links)
- Round Compression for Parallel Matching Algorithms (Q5130844) (← links)
- The Match-Maker: Constant-Space Distributed Majority via Random Walks (Q5207899) (← links)
- Round compression for parallel matching algorithms (Q5230311) (← links)
- Distributed Approximation of Maximum Independent Set and Maximum Matching (Q5368958) (← links)
- Distributed maximum matching verification in CONGEST (Q6535036) (← links)
- Distributed approximation for \(f\)-matching (Q6614001) (← links)
- Distributed computing in the asynchronous LOCAL model (Q6652468) (← links)