Algorithmica

, Volume 16, Issue 4–5, pp 543–547 | Cite as

A method for obtaining randomized algorithms with small tail probabilities

  • H. Alt
  • L. Guibas
  • K. Mehlhorn
  • R. Karp
  • A. Wigderson
Article

Abstract

We study strategies for converting randomized algorithms of the Las Vegas type into randomized algorithms with small tail probabilities.

Key words

Las Vegas algorithms Randomized algorithm Tail probability 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [E]
    F. Erwe.Differential- und Integralrechnung. Bibliographisches Institut Mannheim, 1964.Google Scholar
  2. [K]
    D. E. Knuth.The Art of Computer Programming, Volume I. Addison-Wesley, Reading, MA, 1973.Google Scholar

Copyright information

© Springer-Verlag New York Inc 1996

Authors and Affiliations

  • H. Alt
    • 1
  • L. Guibas
    • 2
    • 3
  • K. Mehlhorn
    • 4
  • R. Karp
    • 5
    • 6
  • A. Wigderson
    • 7
  1. 1.Fachbereich MathematikFreie Universität BerlinBerlinGermany
  2. 2.Stanford UniversityStanfordUSA
  3. 3.DEC SRCPalo AltoUSA
  4. 4.Max-Planck-Institut für Informatik and Fachbereich InformatikUniversität des SaarlandesSaarbrückenGermany
  5. 5.International Computer Science InstituteBerkeleyUSA
  6. 6.University of CaliforniaBerkeleyUSA
  7. 7.Department of Computer Science, Hebrew University and Department of Computer SciencePrinceton UniversityPrincetonUSA

Personalised recommendations