Competing against specialists

Piotr Berman, Juan A. Garay

    Research output: Contribution to conferencePaper

    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
    Publication statusPublished - Jan 1 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

      Fingerprint

    All Science Journal Classification (ASJC) codes

    • Software
    • Hardware and Architecture
    • Computer Networks and Communications

    Cite this

    Berman, P., & Garay, J. A. (1997). Competing against specialists. Paper presented at Proceedings of the 1997 16th Annual ACM Symposium on Principles of Distributed Computing, Santa Barbara, CA, USA, .