A general lower bound on the I/O-complexity of comparison-based algorithms (Q5060102)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A general lower bound on the I/O-complexity of comparison-based algorithms |
scientific article; zbMATH DE number 7643375
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A general lower bound on the I/O-complexity of comparison-based algorithms |
scientific article; zbMATH DE number 7643375 |
Statements
A general lower bound on the I/O-complexity of comparison-based algorithms (English)
0 references
18 January 2023
0 references
0.7660652995109558
0 references
