A nearly optimal randomized algorithm for explorable heap selection (Q6085985)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7763005
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A nearly optimal randomized algorithm for explorable heap selection |
scientific article; zbMATH DE number 7763005 |
Statements
A nearly optimal randomized algorithm for explorable heap selection (English)
0 references
9 November 2023
0 references
smallest value in a binary heap
0 references
0 references
0 references
0 references
0.7582941055297852
0 references
0.7309941053390503
0 references
0.726053774356842
0 references
