Quickselect tree process convergence, with an application to distributional convergence for the number of symbol comparisons used by worst-case find (Q3191202)
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 6347421
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Quickselect tree process convergence, with an application to distributional convergence for the number of symbol comparisons used by worst-case find |
scientific article; zbMATH DE number 6347421 |
Statements
QuickSelect Tree Process Convergence, With an Application to Distributional Convergence for the Number of Symbol Comparisons Used by Worst-Case Find (English)
0 references
24 September 2014
0 references
tree-indexed processes
0 references
QuickSelect search algorithm
0 references
\(L^p\)-convergence
0 references
almost sure convergence
0 references
0 references
0 references
0.8606895208358765
0 references
0.8280843496322632
0 references
0.8257172703742981
0 references
0.8240383863449097
0 references
0.8233445882797241
0 references
