Pages that link to "Item:Q5419106"
From MaRDI portal
The following pages link to Distributed verification and hardness of distributed approximation (Q5419106):
Displaying 25 items.
- Tight bounds for parallel randomized load balancing (Q287991) (← links)
- Tight bounds for distributed minimum-weight spanning tree verification (Q372968) (← links)
- Hardness of discrepancy computation and \(\varepsilon\)-net verification in high dimension (Q413466) (← links)
- Deciding and verifying network properties locally with few output bits (Q1988527) (← links)
- Algebraic methods in the congested clique (Q2010605) (← links)
- Single-source shortest paths in the CONGEST model with improved bounds (Q2166365) (← links)
- Some lower bounds in dynamic networks with oblivious adversaries (Q2174250) (← links)
- Low-congestion shortcut and graph parameters (Q2241301) (← links)
- Distributed distance computation and routing with small messages (Q2422769) (← links)
- Low-congestion shortcuts without embedding (Q2657278) (← links)
- Sparsifying Congested Cliques and Core-Periphery Networks (Q2835033) (← links)
- Locality and Checkability in Wait-Free Computing (Q3095336) (← links)
- The Cost of Fault Tolerance in Multi-Party Communication Complexity (Q3189654) (← links)
- Distributed Broadcast Revisited: Towards Universal Optimality (Q3449512) (← links)
- Near-Optimal Distributed Maximum Flow (Q4561245) (← links)
- Primal-dual based distributed approximation algorithm for Prize-collecting Steiner tree (Q5012805) (← links)
- (Q5090444) (← links)
- (Q5090922) (← links)
- (Q5743466) (← links)
- Efficient distributed approximation algorithms via probabilistic tree embeddings (Q5917892) (← links)
- Communication costs in a geometric communication network (Q6052702) (← links)
- Almost universally optimal distributed Laplacian solvers via low-congestion shortcuts (Q6071121) (← links)
- Distributed maximum matching verification in CONGEST (Q6535036) (← links)
- Distributed planar reachability in nearly optimal time (Q6535037) (← links)
- Locally verifiable distributed SNARGs (Q6581783) (← links)
