Las Vegas Algorithms is a randomized algorithm that always produces the correct output but has an expected finite runtime, distinguishing it from other randomized algorithms by guaranteeing correctness while allowing probabilistic variation in computation time.
78
Publications
12.3K
Citations
163
Authors
93
Institutions
Publications per year
2017–2026
12
Publications
78
Algorithms for quantum computation: discrete logarithms and factoring
Peter W. Shor · 2002 · 8.5K citations
Computing, Computer Science, Physics +12
Optimal speedup of Las Vegas algorithms
Michael Luby, Alistair Sinclair, David Zuckerman · 2002 · 362 citations
Polylogarithmic inapproximability
Eran Halperin, Robert Krauthgamer · 2003 · 229 citations
1–5 of 78
Authors
163
- KL
5
h-index
- CW
3
h-index
- MT
3
h-index
- LB
3
h-index
- RE
3
h-index
1–5 of 163
Institutions
93
AT&T (United States)
Bedminster, United States
7 h-index
11 publications
9.2K citations
Tel Aviv University
Tel Aviv, Israel
5 h-index
7 publications
376 citations
University of Copenhagen
Copenhagen, Denmark
4 h-index
5 publications
137 citations
Massachusetts Institute of Technology
Cambridge, United States
4 h-index
4 publications
472 citations
University of Waterloo
Waterloo, Canada
4 h-index
6 publications
193 citations
University of California, Irvine
Irvine, United States
3 h-index
3 publications
132 citations
Columbia University
New York, United States
3 h-index
3 publications
94 citations
University of Warsaw
Warsaw, Poland
3 h-index
3 publications
73 citations
1–8 of 93
Venues
- SIAM Journal on Computing
4 publications · 170 citations
4
h-index
- ACM Transactions on Algorithms
TALG · 3 publications · 80 citations
3
h-index
- arXiv (Cornell University)
Repository · 3 publications · 186 citations
3
h-index
- Journal of the ACM
JACM · 3 publications · 281 citations
3
h-index
- Mathematics of Computation
MCOM · 2 publications · 79 citations
2
h-index
1–5