Round-Competitive Algorithms for Uncertainty Problems with Parallel Queries

Thomas Erlebach, Michael Hoffmann 0002, Murilo Santos de Lima. Round-Competitive Algorithms for Uncertainty Problems with Parallel Queries. In Markus Bläser, Benjamin Monmege, editors, 38th International Symposium on Theoretical Aspects of Computer Science, STACS 2021, March 16-19, 2021, Saarbrücken, Germany (Virtual Conference). Volume 187 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. [doi]

Abstract

Abstract is missing.