Ramsey-type theorems for metric spaces with applications to online problems (Q2496321): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
(One intermediate revision by one other user not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q57318104 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4864428 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive analysis of randomized paging algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4527040 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the power of randomization in on-line algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4223058 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Hilbertian subsets of finite metric spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Decomposition Theorem for Task Systems and Bounds for Randomized Server Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limitations to Fréchet's metric embedding method / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON METRIC RAMSEY-TYPE DICHOTOMIES / rank
 
Normal rank
Property / cites work
 
Property / cites work: On metric Ramsey-type phenomena / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some low distortion metric Ramsey problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal on-line algorithm for metrical task system / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4471325 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3682518 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive paging algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Better Algorithms for Unfair Metrical Task Systems and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tight bound on approximating arbitrary metrics by tree metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized algorithms for metrical task systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive snoopy caching / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the <i>k</i> -server conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds for Randomized <i>k</i>-Server and Motion-Planning Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for classification problems with pairwise relationships / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4695658 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive algorithms for server problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4146667 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A strongly competitive randomized paging algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unfair problems and randomized algorithms for metrical task systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general decomposition theorem for the \(k\)-server problem / rank
 
Normal rank

Revision as of 17:04, 24 June 2024

scientific article
Language Label Description Also known as
English
Ramsey-type theorems for metric spaces with applications to online problems
scientific article

    Statements

    Ramsey-type theorems for metric spaces with applications to online problems (English)
    0 references
    0 references
    0 references
    0 references
    12 July 2006
    0 references
    metric task systems
    0 references
    online servers problem
    0 references
    metric Ramsey theory
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers