Max-Planck-Institut für Informatik
max planck institut
informatik
mpii logo Minerva of the Max Planck Society
 

MPI-I-92-110

A method for obtaining randomized algorithms with small tail probalities

Alt, Helmut and Guibas, L. and Mehlhorn, Kurt and Karp, R. and Widgerson, A.

MPI-I-92-110. March 1992, 5 pages. | Status: available - back from printing | Next --> Entry | Previous <-- Entry

Abstract in LaTeX format:
We study strategies for converting randomized algorithms of the
Las Vegas type into randomized algorithms with small tail
probabilities.
Acknowledgement:
References to related material:

To download this research report, please select the type of document that fits best your needs.Attachement Size(s):
MPI-I-92-110.pdfMPI-I-92-110.pdf8250 KBytes
Please note: If you don't have a viewer for PostScript on your platform, try to install GhostScript and GhostView
URL to this document: http://domino.mpi-inf.mpg.de/internet/reports.nsf/NumberView/1992-110
Hide details for BibTeXBibTeX
@TECHREPORT{AltGuibasMehlhornKarpWidgerson92,
  AUTHOR = {Alt, Helmut and Guibas, L. and Mehlhorn, Kurt and Karp, R. and Widgerson, A.},
  TITLE = {A method for obtaining randomized algorithms with small tail probalities},
  TYPE = {Research Report},
  INSTITUTION = {Max-Planck-Institut f{\"u}r Informatik},
  ADDRESS = {Im Stadtwald, D-66123 Saarbr{\"u}cken, Germany},
  NUMBER = {MPI-I-92-110},
  MONTH = {March},
  YEAR = {1992},
  ISSN = {0946-011X},
}