10 citations · 51 across the 27 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2021
The Query Complexity of Local Search and Brouwer in Rounds
Simina Brânzei, Jiawei Li
We consider the query complexity of finding a local minimum of a function defined on a graph. This abstract problem is fundamental to many optimization tasks, such as finding a loc…
cs.DS2020
Searching, Sorting, and Cake Cutting in Rounds
Simina Brânzei, Dimitris Paparas, Nicholas Recker
We study searching and sorting in rounds motivated by a fair division question: given a cake cutting problem with players, compute a fair allocation in at most rounds of in…