Metrical Task Systems

Metrical Task Systems is a computational framework in the theory of online algorithms that models a system's state transitions and associated costs under the constraint that the state space forms a metric space, distinguishing it from other online problem frameworks by enforcing triangular consistency and non-negative, symmetric transition costs.

27

Publications

2K

Citations

44

Authors

36

Institutions

Publications per year

2017–2026

2

Authors

44

  1. AB
    Avrim Blum

    Carnegie Mellon University, United States

    6 publications · 319 citations

    6

    h-index

  2. MS
    Michael Saks

    Rutgers, The State University of New Jersey, United States

    4 publications · 569 citations

    4

    h-index

  3. NB
    Niv Buchbinder

    Technion – Israel Institute of Technology, Israel

    4 publications · 134 citations

    4

    h-index

  4. JN
    Joseph Naor

    Technion – Israel Institute of Technology, Israel

    4 publications · 134 citations

    4

    h-index

  5. CB
    Carl Burch

    Carnegie Mellon University, United States

    4 publications · 249 citations

    4

    h-index

1–5 of 44

Venues

  1. SIAM Journal on Computing

    3 publications · 67 citations

    3

    h-index

  2. Journal of the ACM

    JACM · 2 publications · 406 citations

    2

    h-index

  3. Algorithmica

    1 publications · 10 citations

    1

    h-index

  4. ACM SIGMETRICS Performance Evaluation Review

    PER · 1 publications · 22 citations

    1

    h-index

  5. Foundations of Computer Science

    Conference · 1 publications · 27 citations

    1

    h-index

1–5