# Las Vegas algorithm

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2015

2015

- STACS
- 2015

In this article we try to formalize the question “What can be computed with access to randomness?” We propose the very fine… (More)

Is this relevant?

2013

2013

- 42nd International Conference on Parallel…
- 2013

We propose a probabilistic model for the parallel execution of Las Vegas algorithms, i.e. randomized algorithms whose runtime… (More)

Is this relevant?

1999

1999

- 1999

We advocate a new methodology for empirically analysing the behaviour of Las Vegas Algorithms, a large class of probabilistic… (More)

Is this relevant?

Highly Cited

1998

Highly Cited

1998

- UAI
- 1998

Stochastic search algorithms are among the most sucessful approaches for solving hard combinatorial problems. A large class of… (More)

Is this relevant?

Highly Cited

1995

Highly Cited

1995

- J. ACM
- 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

- STACS
- 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

- ISTCS
- 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

- FOCS
- 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

- SPAA
- 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)

Is this relevant?

1988

1988

- Symposium on Computational Geometry
- 1988

We present an algorithm that triangulates a simple polygon on <italic>n</italic> vertices in <italic>&Ogr;</italic>(<italic>n… (More)

Is this relevant?