On the Distributed Complexity of Computing Maximal Matchings

  title={On the Distributed Complexity of Computing Maximal Matchings},
  author={Michal Hanckowiak and Michal Karonski and Alessandro Panconesi},
  journal={SIAM J. Discrete Math.},
One of the fascinating questions of computer science is whether and to what extent randomization increases the power of algorithmic procedures. It is well-known that, in general, randomization makes distributed algorithms more powerful, for there are examples of basic coordination tasks in asynchronous systems which cannot be solved by deterministic procedures but admit simple randomized solutions. Randomization is also demonstrably more powerful in synchronous systems, as shown by the… CONTINUE READING
Highly Cited
This paper has 128 citations. REVIEW CITATIONS


Publications citing this paper.
Showing 1-10 of 79 extracted citations

128 Citations

Citations per Year
Semantic Scholar estimates that this publication has 128 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-2 of 2 references

An improved algorithm for maximal matching, Information

  • A. Israeli, Y. Shiloach
  • Processing Letters, 22(2):57-60,
  • 1986
Highly Influential
5 Excerpts

Similar Papers

Loading similar papers…