| 2025 | PODC | Brief Announcement: Fast and Robust Information Spreading in the Noisy PULL Model. | Niccol D'Archivio, Amos Korman, Emanuele Natale, Robin Vacus |
| 2023 | IJCAI | On the Role of Memory in Robust Opinion Dynamics. | Luca Becchetti, Andrea Clementi, Amos Korman, Francesco Pasquale, Luca Trevisan, Robin Vacus |
| 2022 | PODC | Early Adapting to Trends: Self-Stabilizing Information Spread using Passive Communication. | Amos Korman, Robin Vacus |
| 2020 | STACS | Tight Bounds for the Cover Times of Random Walks with Heterogeneous Step Lengths. | Brieuc Guinard, Amos Korman |
| 2019 | ICALP | Multi-Round Cooperative Search Games with Multiple Players. | Amos Korman, Yoav Rodeh |
| 2018 | ESA | Searching a Tree with Permanently Noisy Advice. | Lucas Boczkowski, Amos Korman, Yoav Rodeh |
| 2018 | LATIN | Random Walks with Multiple Step Lengths. | Lucas Boczkowski, Brieuc Guinard, Amos Korman, Zvi Lotker, Marc P. Renault |
| 2018 | SPAA | Intense Competition can Drive Selfish Explorers to Optimize Coverage. | Simon Collet, Amos Korman |
| 2017 | ICALP | The Dependent Doors Problem: An Investigation into Sequential Decisions without Feedback. | Amos Korman, Yoav Rodeh |
| 2017 | SODA | Minimizing Message Size in Stochastic Communication Patterns: Fast Self-Stabilizing Protocols with 3 bits. | Lucas Boczkowski, Amos Korman, Emanuele Natale |
| 2017 | SIROCCO | Parallel Search with No Coordination. | Amos Korman, Yoav Rodeh |
| 2016 | PODC | Brief Announcement: Self-stabilizing Clock Synchronization with 3-bit Messages. | Lucas Boczkowski, Amos Korman, Emanuele Natale |
| 2016 | STOC | Parallel exhaustive search without coordination. | Pierre Fraigniaud, Amos Korman, Yoav Rodeh |
| 2015 | SIROCCO | Clock Synchronization and Estimation in Highly Dynamic Networks: An Information Theoretic Approach. | Ofer Feinerman, Amos Korman |
| 2014 | ICDCN | Fast Rendezvous on a Cycle by Agents with Different Speeds. | Ofer Feinerman, Amos Korman, Shay Kutten, Yoav Rodeh |
| 2014 | PODC | Breathe before speaking: efficient information dissemination despite noisy, limited and anonymous communication. | Ofer Feinerman, Bernhard Haeupler, Amos Korman |
| 2013 | ICDCIT | Theoretical Distributed Computing Meets Biology: A Review. | Ofer Feinerman, Amos Korman |
| 2013 | PODC | What can be decided locally without identifiers? | Pierre Fraigniaud, Mika Gs, Amos Korman, Jukka Suomela |
| 2012 | OPODIS | On the Impact of Identifiers on Local Decision. | Pierre Fraigniaud, Magns M. Halldrsson, Amos Korman |
| 2012 | PODC | Collaborative search on the plane without communication. | Ofer Feinerman, Amos Korman, Zvi Lotker, Jean-Sbastien Sereni |
| 2012 | SIROCCO | Notions of Connectivity in Overlay Networks. | Yuval Emek, Pierre Fraigniaud, Amos Korman, Shay Kutten, David Peleg |
| 2011 | FOCS | Local Distributed Decision. | Pierre Fraigniaud, Amos Korman, David Peleg |
| 2011 | PODC | Fast and compact self stabilizing verification, computation, and fault detection of an MST. | Amos Korman, Shay Kutten, Toshimitsu Masuzawa |
| 2011 | PODC | Toward more localized local algorithms: removing assumptions concerning global knowledge. | Amos Korman, Jean-Sbastien Sereni, Laurent Viennot |
| 2011 | SODA | Approximating the Statistics of various Properties in Randomly Weighted Graphs. | Yuval Emek, Amos Korman, Yuval Shavitt |
| 2011 | STOC | Distributed verification and hardness of distributed approximation. | Atish Das Sarma, Stephan Holzer, Liah Kor, Amos Korman, Danupon Nanongkai, Gopal Pandurangan, David Peleg, Roger Wattenhofer |
| 2011 | STACS | Tight Bounds For Distributed MST Verification. | Liah Kor, Amos Korman, David Peleg |
| 2010 | PODC | Efficient threshold detection in a distributed environment: extended abstract. | Yuval Emek, Amos Korman |
| 2010 | SODA | Compact Ancestry Labeling Schemes for XML Trees. | Pierre Fraigniaud, Amos Korman |
| 2010 | STOC | An optimal ancestry scheme and small universal posets. | Pierre Fraigniaud, Amos Korman |
| 2009 | ICALP | Online Computation with Advice. | Yuval Emek, Pierre Fraigniaud, Amos Korman, Adi Rosn |
| 2009 | ICDCN | Compact Routing Schemes for Dynamic Trees in the Fixed Port Model. | Amos Korman |
| 2009 | PODC | Brief announcement: new bounds for the controller problem. | Yuval Emek, Amos Korman |
| 2009 | SPAA | On randomized representations of graphs using short labels. | Pierre Fraigniaud, Amos Korman |
| 2009 | WAOA | On the Additive Constant of the | Yuval Emek, Pierre Fraigniaud, Amos Korman, Adi Rosn |
| 2008 | PODC | Improved compact routing schemes for dynamic trees. | Amos Korman |
| 2007 | ICALP | Labeling Schemes for Vertex Connectivity. | Amos Korman |
| 2007 | PODC | Controller and estimator for dynamic networks. | Amos Korman, Shay Kutten |
| 2007 | SPAA | Local MST computation with short advice. | Pierre Fraigniaud, Amos Korman, Emmanuelle Lebhar |
| 2007 | SIROCCO | Labeling Schemes with Queries. | Amos Korman, Shay Kutten |
| 2006 | ICALP | Dynamic Routing Schemes for General Graphs. | Amos Korman, David Peleg |
| 2006 | ICDCN | On Distributed Verification. | Amos Korman, Shay Kutten |
| 2006 | ISAAC | Constructing Labeling Schemes Through Universal Matrices. | Amos Korman, David Peleg, Yoav Rodeh |
| 2006 | PODC | Distributed verification of minimum spanning trees. | Amos Korman, Shay Kutten |
| 2005 | ICALP | Label-Guided Graph Exploration by a Finite Automaton. | Reuven Cohen, Pierre Fraigniaud, David Ilcinkas, Amos Korman, David Peleg |
| 2005 | PODC | Proof labeling schemes. | Amos Korman, Shay Kutten, David Peleg |
| 2003 | ICALP | Labeling Schemes for Weighted Dynamic Trees. | Amos Korman, David Peleg |
| 2002 | SODA | Labeling schemes for flow and connectivity. | Michal Katz, Nir A. Katz, Amos Korman, David Peleg |
| 2002 | STACS | Labeling Schemes for Dynamic Tree Networks. | Amos Korman, David Peleg, Yoav Rodeh |