"Round-Competitive Algorithms for Uncertainty Problems with Parallel Queries."

Thomas Erlebach, Michael Hoffmann, Murilo Santos de Lima (2021)

> Home

Details and statistics

DOI: 10.4230/LIPICS.STACS.2021.27

access: open

type: Conference or Workshop Paper

metadata version: 2021-03-11

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/stacs/Erlebach0L21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stacs/Erlebach0L21
Thomas Erlebach, Michael Hoffmann, Murilo Santos de Lima:
Round-Competitive Algorithms for Uncertainty Problems with Parallel Queries. STACS 2021: 27:1-27:18

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.