Round-Competitive Algorithms for Uncertainty Problems with Parallel Queries

Erlebach, Thomas; Hoffmann, Michael; de Lima, Murilo Santos

Professor Thomas Erlebach thomas.erlebach@durham.ac.uk
Professor Computer Science

Michael Hoffmann

Murilo Santos de Lima

Erlebach, T., Hoffmann, M., & de Lima, M. S. (2021). Round-Competitive Algorithms for Uncertainty Problems with Parallel Queries. . https://doi.org/10.4230/lipics.stacs.2021.27

Presentation Conference Type	Conference Paper (Published)
Conference Name	38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)
Acceptance Date	Dec 20, 2020
Online Publication Date	Mar 10, 2021
Publication Date	2021
Deposit Date	Dec 30, 2021
Publisher	Schloss Dagstuhl - Leibniz-Zentrum für Informatik
Volume	187
Pages	27:1-27:18
Series Title	LIPIcs
DOI	https://doi.org/10.4230/lipics.stacs.2021.27
Public URL	https://durham-repository.worktribe.com/output/1137972
Related Public URLs	https://leicester.figshare.com/articles/conference_contribution/Round-Competitive_Algorithms_for_Uncertainty_Problems_with_Parallel_Queries/13643063

HTML

BIB

RTF