A lower bound for probabilistic distributed algorithms
From MaRDI portal
Recommendations
- Lower Bounds for Distributed Maximum-Finding Algorithms
- Two lower bounds in asynchronous distributed computation
- A Lower Bound on Probabilistic Algorithms for Distributive Ring Coloring
- Analysis of fully distributed splitting and naming probabilistic procedures and applications
- On lower bounds for the time and the bit complexity of some probabilistic distributed graph algorithms. Extended abstract
Cited in
(12)- Optimal lower bounds for some distributed algorithms for a complete network of processors
- Fooling views: a new lower bound technique for distributed computations under congestion
- A reduction theorem for randomized distributed algorithms under weak adversaries
- Probabilistic analysis of some distributed algorithms
- scientific article; zbMATH DE number 3911705 (Why is no real title available?)
- Lower Bounds for Distributed Maximum-Finding Algorithms
- A Lower Bound on Probabilistic Algorithms for Distributive Ring Coloring
- Hundreds of impossibility results for distributed computing
- Message terminating algorithms for anonymous rings of unknown size
- A lower bound on the period length of a distributed scheduler
- New lower bound techniques for distributed leader finding and other problems on rings of processors
- Randomized function evaluation on a ring
This page was built for publication: A lower bound for probabilistic distributed algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3783527)
