Skip to main content
SpringerLink
Log in

A method for obtaining randomized algorithms with small tail probabilities

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

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

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. F. Erwe.Differential- und Integralrechnung. Bibliographisches Institut Mannheim, 1964.

  2. D. E. Knuth.The Art of Computer Programming, Volume I. Addison-Wesley, Reading, MA, 1973.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich Mathematik, Freie Universität Berlin, Arnimallee 2-6, W-1000, Berlin, Germany

    H. Alt

  2. Stanford University, 94305, Stanford, CA, USA

    L. Guibas

  3. DEC SRC, 130 Lytton Ave, 94301, Palo Alto, CA, USA

    L. Guibas

  4. Max-Planck-Institut für Informatik and Fachbereich Informatik, Universität des Saarlandes, Im Stadtwald, W-6600, Saarbrücken, Germany

    K. Mehlhorn

  5. International Computer Science Institute, 94704, Berkeley, CA, USA

    R. Karp

  6. University of California, 94720, Berkeley, CA, USA

    R. Karp

  7. Department of Computer Science, Hebrew University and Department of Computer Science, Princeton University, 07974, Princeton, NJ, USA

    A. Wigderson

Authors
  1. H. Alt
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. L. Guibas
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. K. Mehlhorn
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. R. Karp
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. A. Wigderson
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Communicated by M. Luby.

Supported by ESPRIT U Basic Research Actions Program of the EC under Contract No. 3075 (project ALCOM).

Supported by ESPRIT II Basic Research Actions Program of the EC under Contract No. 3075 (Project ALCOM).

Research supported by NSF Grant No. CCR-9005448.

Partially supported by a Wolfson Research Award administered by the Israel Academy of Sciences and Humanities.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Alt, H., Guibas, L., Mehlhorn, K. et al. A method for obtaining randomized algorithms with small tail probabilities. Algorithmica 16, 543–547 (1996). https://doi.org/10.1007/BF01940879

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01940879

Key words

Search

Navigation