On characterizing the data access complexity of programs (Q2819842)
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: On characterizing the data access complexity of programs |
scientific article; zbMATH DE number 6631330
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On characterizing the data access complexity of programs |
scientific article; zbMATH DE number 6631330 |
Statements
29 September 2016
0 references
data access complexity
0 references
I/O lower bounds
0 references
red-blue pebble game
0 references
static analysis
0 references
On characterizing the data access complexity of programs (English)
0 references
