Labeling Schemes for Dynamic Tree Networks. - Amos Korman; David Peleg; Yoav Rodeh (Theory Comput. Syst., 2004)

Labeling Schemes for Flow and Connectivity. - Michal Katz; Nir A. Katz; Amos Korman; David Peleg (SIAM J. Comput., 2004)

Dynamic Routing Schemes for General Graphs. - Amos Korman; David Peleg (ICALP (1), 2006)

On Distributed Verification. - Amos Korman; Shay Kutten (ICDCN, 2006)

Labeling Schemes with Queries. - Amos Korman; Shay Kutten (SIROCCO, 2007)

General compact labeling schemes for dynamic trees. - Amos Korman (Distributed Comput., 2007)

Distributed verification of minimum spanning trees. - Amos Korman; Shay Kutten (Distributed Comput., 2007)

Labeling schemes for weighted dynamic trees. - Amos Korman; David Peleg (Inf. Comput., 2007)

Improved compact routing schemes for dynamic trees. - Amos Korman (PODC, 2008)

Compact separator decompositions in dynamic trees and applications to labeling schemes. - Amos Korman; David Peleg (Distributed Comput., 2008)

Label-guided graph exploration by a finite automaton. - Reuven Cohen; Pierre Fraigniaud; David Ilcinkas; Amos Korman; David Peleg (ACM Trans. Algorithms, 2008)

Dynamic routing schemes for graphs with low local density. - Amos Korman; David Peleg (ACM Trans. Algorithms, 2008)

Compact Routing Schemes for Dynamic Trees in the Fixed Port Model. - Amos Korman (ICDCN, 2009)

Brief announcement: new bounds for the controller problem. - Yuval Emek; Amos Korman (PODC, 2009)

On randomized representations of graphs using short labels. - Pierre Fraigniaud; Amos Korman (SPAA, 2009)

On the Additive Constant of the k-Server Work Function Algorithm. - Yuval Emek; Pierre Fraigniaud; Amos Korman; Adi Rosén (WAOA, 2009)

Labeling Schemes for Tree Representation. - Reuven Cohen; Pierre Fraigniaud; David Ilcinkas; Amos Korman; David Peleg (Algorithmica, 2009)

Compact Ancestry Labeling Schemes for Trees of Small Depth - Pierre Fraigniaud; Amos Korman (CoRR, 2009)

Computing the Expected Values of some Properties of Randomly Weighted Graphs - Yuval Emek; Amos Korman; Yuval Shavitt (CoRR, 2009)

An Optimal Labeling Scheme for Ancestry Queries - Pierre Fraigniaud; Amos Korman (CoRR, 2009)

A note on models for graph representations. - Amos Korman; Shay Kutten (Theor. Comput. Sci., 2009)

Efficient threshold detection in a distributed environment: extended abstract. - Yuval Emek; Amos Korman (PODC, 2010)

Compact Ancestry Labeling Schemes for XML Trees. - Pierre Fraigniaud; Amos Korman (SODA, 2010)

An optimal ancestry scheme and small universal posets. - Pierre Fraigniaud; Amos Korman (STOC, 2010)

Constructing Labeling Schemes through Universal Matrices. - Amos Korman; David Peleg; Yoav Rodeh (Algorithmica, 2010)

Proof labeling schemes. - Amos Korman; Shay Kutten; David Peleg (Distributed Comput., 2010)

On the additive constant of the k-server Work Function Algorithm. - Yuval Emek; Pierre Fraigniaud; Amos Korman; Adi Rosén (Inf. Process. Lett., 2010)

Local MST Computation with Short Advice. - Pierre Fraigniaud; Amos Korman; Emmanuelle Lebhar (Theory Comput. Syst., 2010)

Labeling schemes for vertex connectivity. - Amos Korman (ACM Trans. Algorithms, 2010)

Local Distributed Decision. - Pierre Fraigniaud; Amos Korman; David Peleg (FOCS, 2011)

Approximating the Statistics of various Properties in Randomly Weighted Graphs. - Yuval Emek; Amos Korman; Yuval Shavitt (SODA, 2011)

Tight Bounds For Distributed MST Verification. - Liah Kor; Amos Korman; David Peleg (STACS, 2011)

New bounds for the controller problem. - Yuval Emek; Amos Korman (Distributed Comput., 2011)

Online computation with advice. - Yuval Emek; Pierre Fraigniaud; Amos Korman; Adi Rosén (Theor. Comput. Sci., 2011)

On the Impact of Identifiers on Local Decision. - Pierre Fraigniaud; Magnús M. Halldórsson; Amos Korman (OPODIS, 2012)

Collaborative search on the plane without communication. - Ofer Feinerman; Amos Korman; Zvi Lotker; Jean-Sébastien Sereni (PODC, 2012)

Notions of Connectivity in Overlay Networks. - Yuval Emek; Pierre Fraigniaud; Amos Korman; Shay Kutten; David Peleg (SIROCCO, 2012)

Theoretical distributed computing meets biology. - Amos Korman (TADDS, 2012)

Memory Lower Bounds for Randomized Collaborative Search and Implications for Biology. - Ofer Feinerman; Amos Korman (DISC, 2012)

Randomized Distributed Decision. - Pierre Fraigniaud; Amos Korman; Merav Parter; David Peleg (DISC, 2012)

Memory Lower Bounds for Randomized Collaborative Search and Applications to Biology - Ofer Feinerman; Amos Korman (CoRR, 2012)

Rendezvous of Agents with Different Speeds - Ofer Feinerman; Amos Korman; Shay Kutten; Yoav Rodeh (CoRR, 2012)

Distributed Verification and Hardness of Distributed Approximation. - Atish Das Sarma; Stephan Holzer; Liah Kor; Amos Korman; Danupon Nanongkai; Gopal Pandurangan; David Peleg; Roger Wattenhofer (SIAM J. Comput., 2012)

Theoretical Distributed Computing Meets Biology: A Review. - Ofer Feinerman; Amos Korman (ICDCIT, 2013)

What can be decided locally without identifiers? - Pierre Fraigniaud; Mika Göös; Amos Korman; Jukka Suomela (PODC, 2013)

Efficient and Noise-Resilient rumor-spreading in Large, Anonymous Populations. - Ofer Feinerman; Bernhard Haeupler; Amos Korman (CoRR, 2013)

Toward more localized local algorithms: removing assumptions concerning global knowledge. - Amos Korman; Jean-Sébastien Sereni; Laurent Viennot (Distributed Comput., 2013)

Controller and estimator for dynamic networks. - Amos Korman; Shay Kutten (Inf. Comput., 2013)

Towards a complexity theory for local distributed computing. - Pierre Fraigniaud; Amos Korman; David Peleg (J. ACM, 2013)

Tight Bounds for Distributed Minimum-Weight Spanning Tree Verification. - Liah Kor; Amos Korman; David Peleg (Theory Comput. Syst., 2013)

Randomized distributed decision. - Pierre Fraigniaud; Mika Göös; Amos Korman; Merav Parter; David Peleg (Distributed Comput., 2014)

Confidence Sharing: An Economic Strategy for Efficient Information Flows in Animal Groups. - Amos Korman; Efrat Greenwald; Ofer Feinerman (PLoS Comput. Biol., 2014)

Clock Synchronization and Estimation in Highly Dynamic Networks: An Information Theoretic Approach. - Ofer Feinerman; Amos Korman (SIROCCO, 2015)

Clock Synchronization and Distributed Estimation in Highly Dynamic Networks: An Information Theoretic Approach. - Ofer Feinerman; Amos Korman (CoRR, 2015)

Fast and compact self-stabilizing verification, computation, and fault detection of an MST. - Amos Korman; Shay Kutten; Toshimitsu Masuzawa (Distributed Comput., 2015)

Brief Announcement: Self-stabilizing Clock Synchronization with 3-bit Messages. - Lucas Boczkowski; Amos Korman; Emanuele Natale (PODC, 2016)

Parallel exhaustive search without coordination. - Pierre Fraigniaud; Amos Korman; Yoav Rodeh (STOC, 2016)

Self-Stabilizing Clock Synchronization with 3-bit messages. - Lucas Boczkowski; Amos Korman; Emanuele Natale (CoRR, 2016)

Searching on Trees with Noisy Memory. - Lucas Boczkowski; Amos Korman; Yoav Rodeh (CoRR, 2016)

Parallel Linear Search with no Coordination for a Randomly Placed Treasure. - Amos Korman; Yoav Rodeh (CoRR, 2016)

An Optimal Ancestry Labeling Scheme with Applications to XML Trees and Universal Posets. - Pierre Fraigniaud; Amos Korman (J. ACM, 2016)

Parallel Search with No Coordination. - Amos Korman; Yoav Rodeh (SIROCCO, 2017)

Individual versus collective cognition in social insects. - Ofer Feinerman; Amos Korman (CoRR, 2017)

Breathe before speaking: efficient information dissemination despite noisy, limited and anonymous communication. - Ofer Feinerman; Bernhard Haeupler; Amos Korman (Distributed Comput., 2017)

The ANTS problem. - Ofer Feinerman; Amos Korman (Distributed Comput., 2017)

Fast rendezvous on a cycle by agents with different speeds. - Ofer Feinerman; Amos Korman; Shay Kutten; Yoav Rodeh (Theor. Comput. Sci., 2017)

Searching a Tree with Permanently Noisy Advice. - Lucas Boczkowski; Amos Korman; Yoav Rodeh (ESA, 2018)

Limits for Rumor Spreading in Stochastic Populations. - Lucas Boczkowski; Ofer Feinerman; Amos Korman; Emanuele Natale (ITCS, 2018)

Random Walks with Multiple Step Lengths. - Lucas Boczkowski; Brieuc Guinard; Amos Korman; Zvi Lotker; Marc P. Renault (LATIN, 2018)

Intense Competition can Drive Selfish Explorers to Optimize Coverage. - Simon Collet; Amos Korman (SPAA, 2018)

Cooperative Search Games: Symmetric Equilibria, Robustness, and Price of Anarchy. - Amos Korman; Yoav Rodeh (CoRR, 2018)

Limits on reliable information flows through stochastic populations. - Lucas Boczkowski; Emanuele Natale; Ofer Feinerman; Amos Korman (PLoS Comput. Biol., 2018)

The Dependent Doors Problem: An Investigation into Sequential Decisions without Feedback. - Amos Korman; Yoav Rodeh (ACM Trans. Algorithms, 2018)

Minimizing message size in stochastic communication patterns: fast self-stabilizing protocols with 3 bits. - Lucas Boczkowski; Amos Korman; Emanuele Natale (Distributed Comput., 2019)

Parallel Bayesian Search with No Coordination. - Pierre Fraigniaud; Amos Korman; Yoav Rodeh (J. ACM, 2019)

Tight Bounds for the Cover Times of Random Walks with Heterogeneous Step Lengths. - Brieuc Guinard; Amos Korman (STACS, 2020)

The Search Efficiency of Intermittent Lévy walks Optimally Scales with Target Size. - Brieuc Guinard; Amos Korman (CoRR, 2020)

Exploitation of Multiple Replenishing Resources with Uncertainty. - Amos Korman; Yuval Emek; Simon Collet; Aya Goldshtein; Yossi Yovel (CoRR, 2020)

Multi-round cooperative search games with multiple players. - Amos Korman; Yoav Rodeh (J. Comput. Syst. Sci., 2020)

Stochastic Alignment Processes. - Amos Korman; Robin Vacus (CoRR, 2021)

Public Communication can Facilitate Low-Risk Coordination under Surveillance. - Amos Korman; Pierluigi Crescenzi (CoRR, 2021)

On the Role of Hypocrisy in Escaping the Tragedy of the Commons. - Amos Korman; Robin Vacus (CoRR, 2021)

Sequential Decision-Making in Ants and Implications to the Evidence Accumulation Decision Model. - Oran Ayalon; Yigal Sternklar; Ehud Fonio; Amos Korman; Nir S. Gov; Ofer Feinerman (Frontiers Appl. Math. Stat., 2021)

Navigating in Trees with Permanently Noisy Advice. - Lucas Boczkowski; Uriel Feige; Amos Korman; Yoav Rodeh (ACM Trans. Algorithms, 2021)

On the Role of Memory in Robust Opinion Dynamics. - Luca Becchetti; Andrea Clementi; Amos Korman; Francesco Pasquale; Luca Trevisan 001; Robin Vacus (IJCAI, 2023)

Enhanced Food Availability can Deteriorate Fitness through Excessive Scrounging. - Robin Vacus; Amos Korman (CoRR, 2023)

Distributed Alignment Processes With Samples of Group Average. - Amos Korman; Robin Vacus (IEEE Trans. Control. Netw. Syst., 2023)

Fast and Robust Information Spreading in the Noisy PULL Model. - Niccolò D'Archivio; Amos Korman; Emanuele Natale; Robin Vacus (CoRR, 2024)

Early adapting to trends: self-stabilizing information spread using passive communication. - Amos Korman; Robin Vacus (Distributed Comput., 2024)

Brief Announcement: Fast and Robust Information Spreading in the Noisy PULL Model. - Niccolò D'Archivio; Amos Korman; Emanuele Natale; Robin Vacus (PODC, 2025)

The Query Complexity of Searching Trees with Permanently Noisy Advice. - Lucas Boczkowski; Uriel Feige; Amos Korman; Yoav Rodeh (ACM Trans. Algorithms, 2025)