\textsc{OnlineMin}: a fast strongly competitive randomized paging algorithm (Q2344206): 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.1007/s00224-012-9427-y / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1979064639 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive analysis of randomized paging algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online algorithms: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic ordered sets with exponential search trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Organization and maintenance of large ordered indexes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Knowledge state algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4223058 / rank
 
Normal rank
Property / cites work
 
Property / cites work: More on randomized on-line algorithms for caching. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive paging algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online algorithms. The state of the art / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5786662 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Surpassing the information theoretic bound with fusion trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trans-dichotomous algorithms for minimum spanning trees and shortest paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive snoopy caching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Priority Search Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A strongly competitive randomized paging algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Examining Computational Geometry, Van Emde Boas Trees, and Hashing from the Perspective of the Fusion Tree / rank
 
Normal rank

Latest revision as of 02:29, 10 July 2024

scientific article
Language Label Description Also known as
English
\textsc{OnlineMin}: a fast strongly competitive randomized paging algorithm
scientific article

    Statements

    \textsc{OnlineMin}: a fast strongly competitive randomized paging algorithm (English)
    0 references
    0 references
    0 references
    0 references
    12 May 2015
    0 references
    on-line algorithms
    0 references
    competitive analysis
    0 references
    paging
    0 references
    randomized algorithms
    0 references

    Identifiers