Finding shuffle words that represent optimal scheduling of shared memory access (Q2855755): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2010930012 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4658190 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Birthday paradox, coupon collectors, caching algorithms and self- organizing search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Index Register Allocation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Some Problems on Subsequences and Supersequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial Time Match Test for Large Classes of Extended Regular Expressions / rank
 
Normal rank

Latest revision as of 23:03, 6 July 2024

scientific article
Language Label Description Also known as
English
Finding shuffle words that represent optimal scheduling of shared memory access
scientific article

    Statements

    Identifiers

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