The following pages link to (Q4608050):
Displaying 7 items.
- Tight bounds for double coverage against weak adversaries (Q1743121) (← links)
- Equivalence classes and conditional hardness in massively parallel computations (Q2121067) (← links)
- Tight Bounds for Double Coverage Against Weak Adversaries (Q2788990) (← links)
- A Distributed (2 + ε)-Approximation for Vertex Cover in O(log Δ / ε log log Δ) Rounds (Q4640294) (← links)
- Tight Bounds for Single-Pass Streaming Complexity of the Set Cover Problem (Q4997308) (← links)
- The sparse awakens: Streaming algorithms for matching size estimation in sparse graphs (Q5111716) (← links)
- A Distributed (2+ε)-Approximation for Vertex Cover in O(logδ/ε log log δ) Rounds (Q5361909) (← links)
