Competing against specialists

Piotr Berman, Juan A. Garay

    Research output: Contribution to conferencePaperpeer-review

    Abstract

    The problem of designing algorithms in situations where there is some information concerning the typical conditions that are encountered when the respective problem is solved is studied. Adaptability, a new measure for the quality of an algorithm, which generalizes the competitive analysis of Sleator and Tarjan, is introduced. The expressive power of adaptability is demonstrated by presenting a variety of examples in a uniform manner, including results regarding paging in a two-level store, Markov paging, and distributed algorithms for shared memory systems.

    Original languageEnglish (US)
    Number of pages1
    DOIs
    StatePublished - 1997
    EventProceedings of the 1997 16th Annual ACM Symposium on Principles of Distributed Computing - Santa Barbara, CA, USA
    Duration: Aug 21 1997Aug 24 1997

    Other

    OtherProceedings of the 1997 16th Annual ACM Symposium on Principles of Distributed Computing
    CitySanta Barbara, CA, USA
    Period8/21/978/24/97

    All Science Journal Classification (ASJC) codes

    • Software
    • Hardware and Architecture
    • Computer Networks and Communications

    Fingerprint Dive into the research topics of 'Competing against specialists'. Together they form a unique fingerprint.

    Cite this