Designing algorithms by expectations

DOI10.1016/0020-0190(94)00052-2zbMath0807.68053OpenAlexW1974902734MaRDI QIDQ1328761

Yossi Matias, Joseph (Yossi) Gil

Publication date: 3 August 1994

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(94)00052-2

zbMATH Keywords

randomized algorithmsdesigning by expectation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Distributed algorithms (68W15)

Cites Work

• The complexity of parallel search
• Deterministic Sampling–A New Technique for Fast Pattern Matching
• Optimal bounds for decision problems on the CRCW PRAM
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
• Unnamed Item

This page was built for publication: Designing algorithms by expectations