Editing Las Vegas algorithm (section)

== History ==
Las Vegas algorithms were introduced by [[László Babai]] in 1979, in the context of the [[graph isomorphism problem]], as a dual to [[Monte Carlo algorithm]]s.<ref>* [[László Babai]], [http://people.cs.uchicago.edu/~laci/lasvegas79.pdf Monte-Carlo algorithms in graph isomorphism testing], Université de Montréal, D.M.S. No. 79-10.
* [[Leonid Levin]], [[arxiv:cs.CR/0012023|The Tale of One-way Functions]], ''Problems of Information Transmission'', vol. 39 (2003), 92-103.
* Dan Grundy, [http://www.cs.kent.ac.uk/people/staff/eab2/crypto/thesis.web.pdf Concepts and Calculation in Cryptography] {{Webarchive|url=https://web.archive.org/web/20160412010348/https://www.cs.kent.ac.uk/people/staff/eab2/crypto/thesis.web.pdf |date=2016-04-12 }}, University of Kent, Ph.D. thesis, 2008</ref> Babai<ref>Babai, László. “Monte-Carlo algorithms in graph isomorphism testing.” (1979).</ref> introduced the term "Las Vegas algorithm" alongside an example involving coin flips: the algorithm depends on a series of independent coin flips, and there is a small chance of failure (no result). However, in contrast to Monte Carlo algorithms, the Las Vegas algorithm can guarantee the correctness of any reported result.