de.mpg.escidoc.pubman.appbase.FacesBean
English
 
Help Guide Disclaimer Contact us Login
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Report

A method for obtaining randomized algorithms with small tail probalities

MPS-Authors

Alt,  Helmut
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

Guibas,  L.
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

http://pubman.mpdl.mpg.de/cone/persons/resource/persons45021

Mehlhorn,  Kurt
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

Locator
There are no locators available
Fulltext (public)

92-110_ch.pdf
(Any fulltext), 9MB

Supplementary Material (public)
There is no public supplementary material available
Citation

Alt, H., Guibas, L., Mehlhorn, K., Karp, R., & Widgerson, A.(1992). A method for obtaining randomized algorithms with small tail probalities (MPI-I-92-110). Saarbrücken: Max-Planck-Institut für Informatik.


Cite as: http://hdl.handle.net/11858/00-001M-0000-0014-B6EB-4
Abstract
We study strategies for converting randomized algorithms of the Las Vegas type into randomized algorithms with small tail probabilities.