Las Vegas algorithm

Known as: Las Vegas (disambiguation), Las Vegas method 
In computing, a Las Vegas algorithm is a randomized algorithm that always gives correct results; that is, it always produces the correct result or it… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
In this article we try to formalize the question “What can be computed with access to randomness?” We propose the very fine… (More)
  • figure 1
Is this relevant?
2013
2013
We propose a probabilistic model for the parallel execution of Las Vegas algorithms, i.e. randomized algorithms whose runtime… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1999
1999
We advocate a new methodology for empirically analysing the behaviour of Las Vegas Algorithms, a large class of probabilistic… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1998
Highly Cited
1998
Stochastic search algorithms are among the most sucessful approaches for solving hard combinatorial problems. A large class of… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1995
Highly Cited
1995
This paper gives an algorithm for solving linear programming problems. For a problem with n constraints and d variables, the… (More)
Is this relevant?
1994
1994
Let A be a Las Vegas algorithm, i.e., A is a randomized algorithm that always produces the correct answer when it stops but whose… (More)
Is this relevant?
Highly Cited
1993
Highly Cited
1993
Let A be a Las Vegas algorithm, i.e., A is a randomized algorithm that always produces the correct answer when it stops but whose… (More)
Is this relevant?
1993
1993
We consider algorithms in finite groups, given by a list of generators. We give polynomial t ime Las Vegas algorithms (randomized… (More)
Is this relevant?
Highly Cited
1990
Highly Cited
1990
There is a straightforward algorithm for computing the transitive closure of an n-node directed graph in O(log2 n) time on an… (More)
  • figure 2.1
  • figure 3.1
  • figure 4.2
  • figure 5.2
  • figure 5.4
Is this relevant?
1988
1988
We present an algorithm that triangulates a simple polygon on <italic>n</italic> vertices in <italic>&Ogr;</italic>(<italic>n… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?