Pages that link to "Item:Q4369868"
From MaRDI portal
The following pages link to On the average communication complexity of asynchronous distributed algorithms (Q4369868):
Displaying 6 items.
- Some aspects of parallel and distributed iterative algorithms - a survey (Q805158) (← links)
- Two lower bounds in asynchronous distributed computation (Q808249) (← links)
- Exchanging messages of different sizes (Q2369642) (← links)
- Iteration grain sized asynchronous parallel algorithms in optimization (Q4243253) (← links)
- The Communication Complexity of Distributed epsilon-Approximations (Q4978194) (← links)
- Second-Order Asymptotics for Communication Under Strong Asynchronism (Q5223973) (← links)