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

Volume

34

Issue

1–3

Pages

1-3

ISSN

0166-218X

DOI

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

DOI registrant

Elsevier

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

Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.

Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.

Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.

See how references were verified.

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