A Method for Obtaining Randomized Algorithms with Small Tail Probabilities

Alt, Helmut; Guibas, L.; Mehlhorn, Kurt; Karp, Richard M.; Wigderson, A.

Local TagsRelease HistoryDetailsSummary

A Method for Obtaining Randomized Algorithms with Small Tail Probabilities

Alt, H., Guibas, L., Mehlhorn, K., Karp, R. M., & Wigderson, A. (1991). A Method for Obtaining Randomized Algorithms with Small Tail Probabilities.

Item is Released

show all hide all

Basic

show hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0014-AE30-5 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0014-AE31-3

Genre: Other

Files

show Files

hide Files

:

Mehlhorn_a_1991_a.pdf (Any fulltext), 1002KB

File Permalink:
-

Name:
Mehlhorn_a_1991_a.pdf

Description:
-

OA-Status:

Visibility:
Private

MIME-Type / Checksum:
application/pdf

Technical Metadata:

Copyright Date:
-

Copyright Info:
-

License:
-

Locators

show

Creators

show

hide

Creators:
Alt, Helmut¹, Author
Guibas, L.¹, Author
Mehlhorn, Kurt², Author
Karp, Richard M.¹, Author
Wigderson, A.¹, Author

Affiliations:
1Max Planck Society, ou_persistent13
2Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019

Content

show

hide

Free keywords: -

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

Details

show

hide

Language(s): eng - English

Dates: Modified: 2006-09-26Date issued: 1991

Publication Status: Issued

Pages: -

Publishing info: -

Table of Contents: -

Rev. Type: -

Identifiers: eDoc: 344614
Other: Local-ID: C1256428004B93B8-B64753780EE89946C12571B7002FC981-mehlhorn91e

Degree: -

Event

show

Legal Case

show

Project information

show

Source

show