NewEvery arXiv paper, its researchers & institutions — mapped.
papers

Publications (29)

cs.DC2017

Collaborative search on the plane without communication

Ofer Feinerman, Amos Korman, Zvi Lotker +1

cs.DS2009

An Optimal Labeling Scheme for Ancestry Queries

Pierre Fraigniaud, Amos Korman

cs.MA2017

Limits for Rumor Spreading in stochastic populations

Lucas Boczkowski, Ofer Feinerman, Amos Korman +1

cs.DC2006

Labeling Schemes with Queries

Amos Korman, Shay Kutten

cs.DC2017

Parallel Search with no Coordination

Amos Korman, Yoav Rodeh

cs.DC2015

Parallel Exhaustive Search without Coordination

Pierre Fraigniaud, Amos Korman, Yoav Rodeh

cs.DC2015

Tight Bounds for Distributed Minimum-Weight Spanning Tree Verification

Liah Kor, Amos Korman, David Peleg

cs.DC2012

Memory Lower Bounds for Randomized Collaborative Search and Applications to Biology

Ofer Feinerman, Amos Korman

cs.DC2016

Notions of Connectivity in Overlay Networks

Pierre Fraigniaud, Amos Korman, Shay Kutten +2

cs.DC2015

Clock Synchronization and Distributed Estimation in Highly Dynamic Networks: An Information Theoretic Approach

Ofer Feinerman, Amos Korman

cs.AI2017

The Dependent Doors Problem: An Investigation into Sequential Decisions without Feedback

Amos Korman, Yoav Rodeh

cs.DS2010

Approximating the Statistics of various Properties in Randomly Weighted Graphs

Yuval Emek, Amos Korman, Yuval Shavitt

cs.DC2016

Parallel Linear Search with no Coordination for a Randomly Placed Treasure

Amos Korman, Yoav Rodeh

cs.DC2012

Randomized Distributed Decision

Pierre Fraigniaud, Amos Korman, Merav Parter +1

cs.DC2011

Local Distributed Decision

Pierre Fraigniaud, Amos Korman, David Peleg

cs.DC2013

What can be decided locally without identifiers?

Pierre Fraigniaud, Mika Göös, Amos Korman +1

cs.GT2018

Intense Competition can Drive Selfish Explorers to Optimize Coverage

Simon Collet, Amos Korman

cs.DC2017

The ANTS problem

Ofer Feinerman, Amos Korman

cs.DS2009

Compact Ancestry Labeling Schemes for Trees of Small Depth

Pierre Fraigniaud, Amos Korman

cs.DC2011

Distributed Verification and Hardness of Distributed Approximation

Atish Das Sarma, Stephan Holzer, Liah Kor +5

cs.DS2009

On the Additive Constant of the k-server Work Function Algorithm

Yuval Emek, Pierre Fraigniaud, Amos Korman +1

cs.DC2015

Fast and compact self-stabilizing verification, computation, and fault detection of an MST

Amos Korman, Shay Kutten, Toshimitsu Masuzawa

cs.DC2015

On the Impact of Identifiers on Local Decision

Pierre Fraigniaud, Magnús Halldórsson, Amos Korman

cs.DC2006

General Compact Labeling Schemes for Dynamic Trees

Amos Korman

cs.DC2015

Toward more localized local algorithms: removing assumptions concerning global knowledge

Amos Korman, Jean-Sébastien Sereni, Laurent Viennot

cs.DC2016

Minimizing Message Size in Stochastic Communication Patterns: Fast Self-Stabilizing Protocols with 3 bits

Lucas Boczkowski, Amos Korman, Emanuele Natale

cs.DC2015

Fast Rendezvous on a Cycle by Agents with Different Speeds

Ofer Feinerman, Amos Korman, Shay Kutten +1

cs.DS2016

An Optimal Ancestry Labeling Scheme with Applications to XML Trees and Universal Posets

Pierre Fraigniaud, Amos Korman

cs.DC2015

Breathe before Speaking: Efficient Information Dissemination Despite Noisy, Limited and Anonymous Communication

Ofer Feinerman, Bernhard Haeupler, Amos Korman