HIGHLIGHTS
- who: Thomas Erlebach from the The work by Murilo Sde Lima was done while employed at University of Leicester and supported by Department of Computer Science, Durham University, Durham, UK have published the article: Round-Competitive Algorithms for Uncertainty Problems with Parallel Queries, in the Journal: (JOURNAL)
- what: Apart from being well motivated from an application point of view, this variation of the model is also theoretically interesting because it poses new challenges in selecting a useful set of k queries to be made simultaneously. For Sorting, the authors show that there is a 2 . . .
If you want to have access to all the content you need to log in!
Thanks :)
If you don't have an account, you can create one here.