Pages that link to "Item:Q4978194"
From MaRDI portal
The following pages link to The Communication Complexity of Distributed epsilon-Approximations (Q4978194):
Displaying 6 items.
- On the communication complexity of Lipschitzian optimization for the coordinated model of computation (Q1578430) (← links)
- CONQUEST: A coarse-grained algorithm for constructing summaries of distributed discrete datasets (Q2502286) (← links)
- Amortized Communication Complexity of Distributions (Q3638077) (← links)
- On the average communication complexity of asynchronous distributed algorithms (Q4369868) (← links)
- (Q4999000) (← links)
- Tight bounds for communication-assisted agreement distillation (Q5368740) (← links)