Pages that link to "Item:Q808249"
From MaRDI portal
The following pages link to Two lower bounds in asynchronous distributed computation (Q808249):
Displaying 13 items.
- On the complexity of computation in the presence of link failures: The case of a ring (Q808251) (← links)
- New lower bound techniques for distributed leader finding and other problems on rings of processors (Q808701) (← links)
- On the bit complexity of distributed computations in a ring with a leader (Q1098291) (← links)
- Optimal lower bounds for some distributed algorithms for a complete network of processors (Q1823691) (← links)
- Fooling views: a new lower bound technique for distributed computations under congestion (Q2220402) (← links)
- Message lower bounds via efficient network synchronization (Q2292919) (← links)
- Performing work with asynchronous processors: Message-delay-sensitive bounds (Q2581537) (← links)
- (Q3624176) (← links)
- A lower bound for probabilistic distributed algorithms (Q3783527) (← links)
- (Q4413396) (← links)
- Computing functions on asynchronous anonymous networks (Q4887486) (← links)
- Lower bounds to processor-time tradeoffs under bounded-speed message propagation (Q5057417) (← links)
- Hundreds of impossibility results for distributed computing (Q5138488) (← links)