On Characterizing the Data Access Complexity of Programs (Q2819842)

From MaRDI portal
Revision as of 08:39, 19 April 2024 by Importer (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    0 references
    0 references
    0 references
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references