Weakest Precondition Reasoning for Expected Runtimes of Randomized Algorithms
Research article (Journal of the ACM, 2018) · cited 85× · AI/ML
Press Enter · cited answer in seconds
.xyz
Programmatic citations — every numbered marker resolves to a verifiable graph row below.
Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.
4ort.xyz Knowledge Graph. (2026). Weakest Precondition Reasoning for Expected Runtimes of Randomized Algorithms. Retrieved October 18, 2026, from https://4ort.xyz/entity/weakest-precondition-reasoning-for-expected-runtimes-of-randomized-algorithms
“Weakest Precondition Reasoning for Expected Runtimes of Randomized Algorithms.” 4ort.xyz Knowledge Graph, 4ort.xyz, 18 Oct. 2026, https://4ort.xyz/entity/weakest-precondition-reasoning-for-expected-runtimes-of-randomized-algorithms.
@misc{4ortxyz_weakest-precondition-reasoning-for-expected-runtimes-of-randomized-algorithms_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{Weakest Precondition Reasoning for Expected Runtimes of Randomized Algorithms}}, year = {2026}, url = {https://4ort.xyz/entity/weakest-precondition-reasoning-for-expected-runtimes-of-randomized-algorithms}, note = {Accessed: 2026-10-18}}
According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): Weakest Precondition Reasoning for Expected Runtimes of Randomized Algorithms — https://4ort.xyz/entity/weakest-precondition-reasoning-for-expected-runtimes-of-randomized-algorithms (retrieved 2026-10-18)
Canonical URL: https://4ort.xyz/entity/weakest-precondition-reasoning-for-expected-runtimes-of-randomized-algorithms · Last refreshed: