Paging with connections: FIFO strikes again (Q884462): 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.2007.02.009 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2153533537 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4449210 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive analysis of randomized paging algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: LRU is better than FIFO / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connection caching / rank
 
Normal rank
Property / cites work
 
Property / cites work: More on weighted servers or FIFO is better than LRU. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive paging algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4527039 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive snoopy caching / rank
 
Normal rank
Property / cites work
 
Property / cites work: A strongly competitive randomized paging algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250168 / rank
 
Normal rank

Latest revision as of 20:43, 25 June 2024

scientific article
Language Label Description Also known as
English
Paging with connections: FIFO strikes again
scientific article

    Statements

    Paging with connections: FIFO strikes again (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    6 June 2007
    0 references
    0 references
    paging
    0 references
    connection caching
    0 references
    online algorithms
    0 references
    0 references