Algorithms for Uncertain Environments: Going Beyond the Worst-Case (Invited Talk)

Author Anupam Gupta

Thumbnail PDF


  • Filesize: 253 kB
  • 1 pages

Document Identifiers

Author Details

Anupam Gupta
  • Carnegie Mellon University, Pittsburgh, PA, USA

Cite AsGet BibTex

Anupam Gupta. Algorithms for Uncertain Environments: Going Beyond the Worst-Case (Invited Talk). In 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 250, p. 1:1, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)


Analyzing the performance of algorithms in both the worst case and the average case are cornerstones of computer science: these are two different ways to understand how well algorithms perform. Over the past two decades, there has been a concerted effort to understand the performance of algorithms in models that go beyond these two extremes. In this talk I will discuss some of the proposed models and approaches, particularly for problems related to online algorithms, where decisions must be made sequentially without knowing future portions of the input.

Subject Classification

ACM Subject Classification
  • Theory of computation → Online algorithms
  • Optimization under Uncertainty
  • Online Algorithms
  • Beyond Worst Case Analysis


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail