An Introduction to Randomized Algorithms.

Karp, R. M. (1991). An Introduction to Randomized Algorithms. Discrete Applied Mathematics, 34(1–3), 1-3.

Type

Journal article

Intellectual base

Primary research

Year

1991

DOI

10.1016/0166-218x(91)90086-c

Link

https://doi.org/10.1016/0166-218X(91)90086-C

Cited from

computer_science

Cited by

1 citation across 1 artifact.

Each citation links to the sentence it supports in the citing article.

Primes

• Algorithm
  • A common failure is confusing the guarantees of different algorithm classes— treating "expected" performance as worst-case or vice versa

    This sourceSurveys algorithms that make random choices and distinguishes deterministic, Las Vegas, and Monte Carlo classes with their respective worst-case/expected/probabilistic guarantees

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:9f88075dff64 · see in the full table