110 citations · 483 across the 37 of their papers we have counts for
9 papers · 1 filter
Intermittent Cauchy walks enable optimal 3D search across target shapes and sizes
Matteo Stromieri, Emanuele Natale, Amos Korman
Efficiently locating rare targets requires balancing the exploration of novel space with the exploitation of local vicinities. While this tradeoff is well-documented in simplified…
Exploitation of Multiple Replenishing Resources with Uncertainty
Amos Korman, Yuval Emek, Simon Collet +2
We consider an optimization problem in which a (single) bat aims to exploit the nectar in a set of cacti with the objective of maximizing the expected total amount of nectar it…
Intermittent Inverse-Square Lévy Walks are Optimal for Finding Targets of All Sizes
Brieuc Guinard, Amos Korman
Lévy walks are random walk processes whose step-lengths follow a long-tailed power-law distribution. Due to their abundance as movement patterns of biological organisms, significan…
An Optimal Ancestry Labeling Scheme with Applications to XML Trees and Universal Posets
Pierre Fraigniaud, Amos Korman
In this paper we solve the ancestry-labeling scheme problem which aims at assigning the shortest possible labels (bit strings) to nodes of rooted trees, so that ancestry queries be…
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…
An Optimal Labeling Scheme for Ancestry Queries
Pierre Fraigniaud, Amos Korman
An ancestry labeling scheme assigns labels (bit strings) to the nodes of rooted trees such that ancestry queries between any two nodes in a tree can be answered merely by looking a…