182 citations · 723 across the 15 of their papers we have counts for
6 papers · 1 filter
The ANTS problem
Ofer Feinerman, Amos Korman
We introduce the Ants Nearby Treasure Search (ANTS) problem, which models natural cooperative foraging behavior such as that performed by ants around their nest. In this problem, k…
Clock Synchronization and Distributed Estimation in Highly Dynamic Networks: An Information Theoretic Approach
Ofer Feinerman, Amos Korman
We consider the External Clock Synchronization problem in dynamic sensor networks. Initially, sensors obtain inaccurate estimations of an external time reference and subsequently c…
Breathe before Speaking: Efficient Information Dissemination Despite Noisy, Limited and Anonymous Communication
Ofer Feinerman, Bernhard Haeupler, Amos Korman
Distributed computing models typically assume reliable communication between processors. While such assumptions often hold for engineered networks, e.g., due to underlying error co…
Fast Rendezvous on a Cycle by Agents with Different Speeds
Ofer Feinerman, Amos Korman, Shay Kutten +1
The difference between the speed of the actions of different processes is typically considered as an obstacle that makes the achievement of cooperative goals more difficult. In thi…
Memory Lower Bounds for Randomized Collaborative Search and Applications to Biology
Ofer Feinerman, Amos Korman
Initial knowledge regarding group size can be crucial for collective performance. We study this relation in the context of the {\em Ants Nearby Treasure Search (ANTS)} problem \cit…
Collaborative search on the plane without communication
Ofer Feinerman, Amos Korman, Zvi Lotker +1
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…