2 citations · 6 across the 6 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
cs.DS2016★ 2 cited
Searching Trees with Permanently Noisy Advice: Walking and Query Algorithms
Lucas Boczkowski, Uriel Feige, Amos Korman +1
We consider a search problem on trees in which the goal is to find an adversarially placed treasure, while relying on local, partial information. Specifically, each node in the tre…
cs.DC2016
Parallel Linear Search with no Coordination for a Randomly Placed Treasure
Amos Korman, Yoav Rodeh
In STOC'16, Fraigniaud et al. consider the problem of finding a treasure hidden in one of many boxes that are ordered by importance. That is, if a treasure is in a more important b…