Las Vegas Algorithms

From Generalized communication and security models in Byzantine agreement. Matthias Fitzi. 2002

A probabilistic algorithm with a polynomially upper-bounded computational average-case complexity that is not guaranteed to always terminate but, upon termination, always computes a correct output is called probabilistic polynomial with zero error (ZPP) or an algorithm of type "Las Vegas".