On the limits of cache-oblivious rational permutations (Q935473): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2008.04.036 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1991111959 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cache-Oblivious Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the limits of cache-obliviousness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4535796 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The uniform memory hierarchy model of computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast permuting on disk arrays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for parallel memory. II: Hierarchical multilevel memories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2747613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards a theory of cache-efficient algorithms / rank
 
Normal rank

Latest revision as of 14:13, 28 June 2024

scientific article
Language Label Description Also known as
English
On the limits of cache-oblivious rational permutations
scientific article

    Statements

    On the limits of cache-oblivious rational permutations (English)
    0 references
    6 August 2008
    0 references
    rational permutation
    0 references
    cache-oblivious algorithm
    0 references
    tall cache
    0 references
    lower bound
    0 references
    impossibility result
    0 references
    memory hierarchy
    0 references

    Identifiers