A method for obtaining randomized algorithms with small tail probalities

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

アイテム詳細

登録内容を編集ファイル形式で保存

一時保存へ追加

このアイテムの新しいバージョンが利用可能です:
https://pure.mpg.de/pubman/item/item_1834901_7

詳細要約

公開

報告書

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;

/persons/resource/persons45021

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

External Resource

There are no locators available

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

フルテキスト (公開)

92-110_ch.pdf
(全文テキスト（全般）), 9MB

付随資料 (公開)

There is no public supplementary material available

引用

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.

引用: https://hdl.handle.net/11858/00-001M-0000-0014-B6EB-4

要旨

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