Upper and Lower I/O Bounds for Pebbling r-Pyramids (Q3000499): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an 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 / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-642-19222-7_12 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2177249600 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003964 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4344138 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4349551 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Option pricing: A simplified approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cache-optimal algorithms for option pricing / rank
 
Normal rank
Property / cites work
 
Property / cites work: An observation on time-storage trade off / rank
 
Normal rank

Latest revision as of 01:21, 4 July 2024

scientific article
Language Label Description Also known as
English
Upper and Lower I/O Bounds for Pebbling r-Pyramids
scientific article

    Statements

    Upper and Lower I/O Bounds for Pebbling r-Pyramids (English)
    0 references
    0 references
    0 references
    0 references
    19 May 2011
    0 references
    memory hierarchy
    0 references
    I/O
    0 references
    lower bounds
    0 references

    Identifiers

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