On Characterizing the Data Access Complexity of Programs (Q2819842): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2070079053 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1411.2286 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 08:39, 19 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On Characterizing the Data Access Complexity of Programs |
scientific article |
Statements
On Characterizing the Data Access Complexity of Programs (English)
0 references
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
