English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Report

A Method for Obtaining Randomized Algorithms with Small Tail Probabilities

MPS-Authors

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

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

/persons/resource/persons45021

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

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
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 Probabilities (MPI-I-92-110). Saarbrücken: Max-Planck-Institut für Informatik.


Cite as: https://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.