International audience
-
July 25, 2016 (v1)Conference paperUploaded on: December 4, 2022
-
October 2013 (v1)Journal article
Numerous sophisticated local algorithm were suggested in the literature for various fundamental problems. Notable examples are the MIS and (∆+1)-coloring algorithms by Barenboim and Elkin [6], by Kuhn [22], and by Panconesi and Srinivasan [34], as well as the O(∆ 2)-coloring algorithm by Linial [28]. Unfortunately, most known local algorithms...
Uploaded on: March 25, 2023 -
July 16, 2012 (v1)Conference paper
We generalize the classical cow-path problem [7, 14, 38, 39] into a question that is relevant for collective foraging in animal groups. Specifically, we consider a setting in which k identical (probabilistic) agents, initially placed at some central location, collectively search for a treasure in the two-dimensional plane. The treasure is...
Uploaded on: March 25, 2023