Metraipolis › archive › dc_c2a55d38e290
A nearly optimal randomized algorithm for explorable heap selection — Europe PMC PMID:40026603
- Source
- Europe PMC (en)
- Original
- https://europepmc.org/article/MED/40026603
- DOI
- 10.1007/s10107-[numero omesso]-5
- License (as archived)
- solo-consultazione
- Archived
- 2026-10-07T17:41:00.347Z
- SHA-256 of the archived text
e11709e898b1d6cb614d4250f08da717f44ec6c7e0a116345d7e8ce714e7c16f- Stable URL of this page
https://metraipolis.com/documento/dc_c2a55d38e290
How to cite
A nearly optimal randomized algorithm for explorable heap selection — Europe PMC PMID:40026603 — Europe PMC (en), https://europepmc.org/article/MED/40026603 (solo-consultazione); archived copy: https://metraipolis.com/documento/dc_c2a55d38e290 (Metraipolis archive dc_c2a55d38e290, sha256 e11709e898b1d6cb614d4250f08da717f44ec6c7e0a116345d7e8ce714e7c16f)
BibTeX
@misc{dcc2a55d38e290,
title = {A nearly optimal randomized algorithm for explorable heap selection — Europe PMC PMID:40026603},
howpublished = {Europe PMC (en)},
url = {https://europepmc.org/article/MED/40026603},
note = {License solo-consultazione; archived copy https://metraipolis.com/documento/dc_c2a55d38e290; sha256 e11709e898b1d6cb614d4250f08da717f44ec6c7e0a116345d7e8ce714e7c16f},
year = {2026}
}Archived text
The text is not reproduced here: the archive holds it as solo-consultazione (consultation only, no republication). Read it at the original source: https://europepmc.org/article/MED/40026603. Agents can read the archived copy with the MCP tool read_document.