Publications

*Biology or multidisciplinary journals in green

1. Abundant Resources can Trigger Reduced Consumption: Unveiling the Paradox of Excessive Scrounging
  - R. Vacus, and A. Korman.
    (A. Korman is the corresponding author)
  - PNAS, 2024.
2. Collective Problem Solving by Swarms
  - A. Korman and O. Feinerman
  - Journal of Physics: Condensed Matter, 2024. Invited paper, to appear.
3. Early Adapting to Trends: Self-Stabilizing Information Spread using Passive Communication
  - A. Korman and R. Vacus.
  - Distributed Computing, 2024.
4. On the Role of Memory in Robust Opinion Dynamics
  - L. Becchetti, A Clementi, A. Korman, F. Pasquale, L. Trevisan, R. Vacus.
  - IJCAI 2023.
5. Distributed Alignment Processes with Samples of Group Average
  - A. Korman and R. Vacus.
  - IEEE Transactions on Control of Network Systems (TCNS) 2023.
6. Public communication can facilitate low-risk coordination under surveillance
  - A. Korman, and P. Crescenzi.
    (A. Korman is the corresponding author).
  - Scientific Reports, 2022.
7. Early Adapting to Trends: Self-Stabilizing Information Spread using Passive Communication
  - A. Korman and R. Vacus.
  - PODC 2022.
  - Comments: Selected for the special issue of PODC 2022 in Distributed Computing.
8. Intermittent inverse-square Lévy walks are optimal for finding targets of all sizes
  - B. Guinard and A. Korman.
    (A. Korman is the corresponding author).
  - Mathematical analysis can be found here.
  - Science Advances, 2021.
9. On the role of hypocrisy in escaping the tragedy of the commons
  - A. Korman, and R. Vacus.
    (A. Korman is the corresponding author).
  - Scientific Reports, 2021.
10. Sequential Decision-Making in Ants and Implications to the Evidence Accumulation Decision Model
  - O. Ayalon, Y. Sternklar, E. Fonio, A. Korman, N. S. Gov, and O. Feinerman.
  - Frontiers in Applied Mathematics and Statistics| Dynamical Systems, 2021.
11. Navigating in Trees with Permanently Noisy Advice
  - L. Boczkowski, U. Feige, A. Korman, and Y. Rodeh.
  - ACM Transactions on Algorithms (TALG), 2021.
12. Ant collective cognition allows for efficient navigation through disordered environments
  - A. Gelblum, E. Fonio, Y. Rodeh, A. Korman, and O. Feinerman.
    (A. Korman and O. Feinerman are joint corresponding authors).
  - eLife, 2020.
13. Reinforcement Learning Enables Resource-Partitioning in Foraging Bats
  - A. Goldshtein, M. Handel, O. Eitan, A. Bonstein, T. Shaler, S. Collet, S. Greif, R. A. Medellin, Y. Emek, A. Korman, and Y. Yovel.
    (A. Korman and Y. Yovel are joint corresponding authors).
  - Mathematical analysis can be found here.
  - Comments: An article centered around this paper appeared in the daily Israeli newspaper Ynet, as well as on the French INS2I’s website.
  - Current Biology, 2020.
14. Multi-Round Cooperative Search Games with Multiple Players
  - A. Korman, and Y. Rodeh.
  - Journal of Computer and System Sciences (JCSS), 2020.
15. Tight Bounds for the Cover Times of Random Walks with Heterogeneous Step Lengths
  - B. Guinard, and A. Korman.
  - STACS, 2020.
16. Parallel Bayesian Search with no Coordination
  - P. Fraigniaud, A. Korman, and Y. Rodeh.
  - Journal of the ACM (J. ACM), 2019.
17. Multi-Round Cooperative Search Games with Multiple Players
  - A. Korman, and Y. Rodeh.
  - ICALP 2019.
  - Comments: Selected to appear on the special issue of ICALP 2019 in JCSS.
18. Minimizing Message Size in Stochastic Communication Patterns: Fast Self-Stabilizing Protocols with 3 bits
  - L. Boczkowski, A. Korman, and E. Natale.
  - Distributed Computing, 2019.
19. Limits on reliable information flows through stochastic populations
  - L. Boczkowski, E. Natale, O. Feinerman, and A. Korman.
    (A. Korman and O. Feinerman are joint corresponding authors).
  - Mathematical analysis can be found here.
  - PLoS Computational Biology, 2018.
20. Intense Competition can Drive Selfish Explorers to Optimize Coverage
  - S. Collet and A. Korman.
  - SPAA 2018.
21. Searching a Tree with Permanently Noisy Advice
  - L. Boczkowski, A. Korman, and Y. Rodeh.
  - ESA 2018.
22. Random Walks with Multiple Step Lengths
  - L. Boczkowski, B. Guinard, Z. Lotker, M. Renault, and A. Korman.
  - LATIN 2018.
23. Limits for Rumor Spreading in Stochastic Populations
  - L. Boczkowski, O. Feinerman, A. Korman, and E. Natale.
  - ITCS 2018.
24. The Dependent Doors Problem: An Investigation into Sequential Decisions without Feedback
  - A. Korman and Y. Rodeh.
  - ACM Transactions on Algorithms (TALG), 2018.
25. Individual versus Collective Cognition in Social Insects
  - O. Feinerman and A. Korman.
  - J. of Experimental Biology (JEB), 2017.
26. The ANTS Problem
  - O. Feinerman and A. Korman.
  - Distributed Computing, 2017.
27. Minimizing Message Size in Stochastic Communication Patterns: Fast Self-Stabilizing Protocols with 3 bits
  - L. Boczkowski, A. Korman, and E. Natale.
  - SODA 2017.
28. The Dependent Doors Problem: An Investigation into Sequential Decisions without Feedback
  - A. Korman and Y. Rodeh.
  - ICALP(A) 2017.
29. Breathe before Speaking: Efficient Information Dissemination despite Noisy, Limited and Anonymous Communication
  - O. Feinerman, B. Haeupler, and A. Korman.
  - Distributed Computing, 2017.
30. Parallel Search with No Coordination
  - A. Korman and Y. Rodeh.
  - SIROCCO 2017.
31. Fast Rendezvous on a Cycle by Agents with Different Speeds
  - O. Feinerman, A. Korman, S. Kutten, and Y. Rodeh
  - Theoretical Computer Science (TCS), 2017.
32. A locally-blazed ant trail achieves efficient collective navigation despite limited information
  - E. Fonio, Y. Heyman, L. Boczkowski, A. Gelblum, A. Kosowski, A. Korman, and O. Feinerman
    (A. Korman and O. Feinerman are joint corresponding authors).
  - Mathematical analysis can be found here.
  - Comments: Articles centered around this paper appeared in Le Monde and Haaretz daily newspapers, as well as in interstices and CNRS News.
  - eLife, 2016.
33. An Optimal Ancestry Labeling Scheme with Applications to XML Trees and Universal Posets
  - P. Fraigniaud, and A. Korman.
  - Journal of the ACM (J. ACM), 2016.
34. Parallel exhaustive Search without Coordination
  - P. Fraigniaud, A. Korman, and Y. Rodeh.
  - STOC 2016.
35. Clock Synchronization and Estimation in Highly Dynamic Networks: An Information Theoretic Approach.
  - O. Feinerman and A. Korman.
  - SIROCCO, 2015.
36. Fast and Compact Self-Stabilizing Verification, Computation, and Fault Detection of an MST
  - A. Korman, S. Kutten and T. Masuzawa.
  - Distributed Computing, 2015.
37. Confidence Sharing: an Economic Strategy for Efficient Information Flows in Animal Groups
  - A. Korman, E. Greenwald and O. Feinerman.
  - PLoS Computational Biology 2014.
38. Randomized Distributed Decision
  - P. Fraigniaud, M. Goos, A. Korman, M. Parter, and D. Peleg.
  - Distributed Computing, 2014.
39. Breathe before Speaking: Efficient Information Dissemination despite Noisy, Limited and Anonymous Communication
  - O. Feinerman, B. Haeupler, and A. Korman.
  - PODC 2014.
  - Comments: Selected for the special issue of PODC 2014 in Distributed Computing.
40. Fast Rendezvous on a Cycle by Agents with Different Speeds.
  - O. Feinerman, A. Korman, S. Kutten, and Y. Rodeh.
  - ICDCN, 2014.
41. What can be decided locally without identifiers?
  - P. Fraigniaud, M. Goos, A. Korman and J. Suomela.
  - PODC 2013.
42. Towards a Complexity Theory for Local Distributed Computing
  - P. Fraigniaud, A. Korman, and D. Peleg.
  - Journal of the ACM (J. ACM), 2013.
43. Tight Bounds for Distributed MST Verification
  - L. Kor, A. Korman and D. Peleg.
  - Theory of Computing Systems (ToCS), 2013.
44. Controller and Estimator for Dynamic Networks
  - A. Korman, S. Kutten.
  - Information and Computation (I&C), 2013.
45. Toward more Localized Local Algorithms: Removing Assumptions concerning Global Knowledge
  - A. Korman, J. S. Sereni, and L. Viennot.
  - Distributed Computing, 2013.
46. Theoretical Distributed Computing Meets Biology: A Review
  - O. Feinerman and A. Korman.
  - ICDCIT, 2013. Invited paper.
47. Distributed Verification and Hardness of Distributed Approximation
  - A. Das Sharma, S. Holzer, L. Kor, A. Korman, D. Nanongkai, G. Pandurangan, D. Peleg and R. Wattenhofer.
  - SIAM Journal on Computing (SICOMP), 2012.
48. Collaborative search on the plane without communication
  - O. Feinerman, A. Korman, Z. Lotker and J.S. Sereni.
  - PODC 2012.
49. Memory Lower Bounds for Randomized Collaborative Search and Implications for Biology
  - O. Feinerman and A. Korman.
  - DISC 2012.
50. Randomized Distributed Decision
  - P. Fraigniaud, M. Goos, A. Korman, M. Parter, and D. Peleg.
  - DISC 2012.
  - Comments: Selected to appear on the special issue of DISC 2012 in Distributed Computing.
51. On the Impact of Identifiers on Local Decision
  - M. M. Halldorsson, P. Fraigniaud, and A. Korman,
  - OPODIS, 2012.
52. Notions of Connectivity in Overlay Networks
  - Y. Emek, P. Fraigniaud, A. Korman, S. Kutten, and D. Peleg.
  - SIROCCO 2012.
  - Comments: Selected to appear on the special issue of SIROCCO 2012 in TCS.
53. Online Computation with Advice
  - Y. Emek, P. Fraigniaud, A. Korman and A. Rosen.
  - Theoretical Computer Science (TCS), 2011.
54. New Bounds for the Controller Problem
  - Y. Emek and A. Korman.
  - Distributed Computing, 2011.
55. Local Distributed Decision
  - P. Fraigniaud, A. Korman, and D. Peleg.
  - FOCS 2011.
56. Distributed Verification and Hardness of Distributed Approximation
  - A. Das Sharma, S. Holzer, L. Kor, A. Korman, D. Nanongkai, G. Pandurangan, D. Peleg and R. Wattenhofer.
  - STOC 2011.
  - Comments: Selected to appear on the special issue of STOC 2011 in SICOMP.
57. Approximating the Statistics of various Properties in Randomly Weighted Graphs
  - Y. Emek, A. Korman and Y. Shavitt.
  - SODA 2011.
58. Toward more Localized Local Algorithms: Removing Assumptions concerning Global Knowledge
  - A. Korman, J. S. Sereni, and L. Viennot.
  - PODC 2011.
  - Comments: Selected to appear on the special issue of PODC 2011 in Distributed Computing.
59. Fast and Compact Self-Stabilizing Verification, Computation, and Fault Detection of an MST
  - A. Korman, S. Kutten and T. Masuzawa.
  - PODC 2011.
  - Comments: Selected to appear on the special issue of PODC 2011 in Distributed Computing.
60. Tight Bounds for Distributed MST Verification
  - L. Kor, A. Korman and D. Peleg.
  - STACS 2011.
  - Comments: Selected to appear on the special issue of STACS 2011 in ToCS.
61. Local MST Computation with Short Advice
  - P. Fraigniaud, A. Korman and E. Lebhar.
  - Theory of Computing Systems (ToCS), 2010.
62. Proof Labeling Schemes
  - A. Korman, S. Kutten and D. Peleg.
  - Distributed Computing, 2010.
63. Labeling schemes for Vertex Connectivity
  - A. Korman.
  - ACM Transactions on Algorithms (TALG), 2010.
64. On the Additive Constant of the k-Server Work Function Algorithm
  - Y. Emek, P. Fraigniaud, A. Korman and A. Rosen,
  - Information Processing Letters (IPL), 2010.
65. Constructing Labeling Schemes through Universal Matrices
  - A. Korman, D. Peleg and Y. Rodeh,
  - Algorithmica, 2010
66. An optimal ancestry scheme and small universal posets
  - P. Fraigniaud, and A. Korman.
  - STOC 2010.
67. Compact Ancestry Labeling Schemes for XML Trees
  - P. Fraigniaud, and A. Korman.
  - SODA 2010.
68. Labeling Schemes for Tree Representation
  - R. Cohen, P. Fraigniaud, D. Ilcinkas , A. Korman and D. Peleg.
  - Algorithmica, 2009.
69. A Note on Models for Graph Representations
  - A. Korman and S. Kutten.
  - Theoretical Computer Science (TCS), 2009.
70. Efficient Threshold Detection in a Distributed Environment
  - Y. Emek and A. Korman.
  - PODC 2010.
71. New Bounds for the Controller Problem
  - Y. Emek and A. Korman.
  - DISC 2009.
  - Comments: Selected to appear on the special issue of DISC 2009 in Distributed Computing.
72. Compact Routing Schemes for Dynamic Trees in the Fixed Port Model
  - A. Korman.
  - ICDCN 2009.
  - Comment: Won the 2009 ICDCN best paper award.
73. On Randomized Representations of Graphs Using Short Labels
  - P. Fraigniaud, and A. Korman.
  - SPAA 2009.
74. On the Additive Constant of the k-Server Work Function Algorithm
  - Y. Emek, P. Fraigniaud, A. Korman and A. Rosen.
  - WAOA 2009.
75. Online Computation with Advice
  - Y. Emek, P. Fraigniaud, A. Korman and A. Rosen.
  - ICALP 2009.
  - Comments: Selected to appear on the special issue of ICALP 2009 in TCS.
76. Label-Guided Graph Exploration by a Finite Automation
  - R. Cohen, P. Fraigniaud, D. Ilcinkas, A. Korman and D. Peleg.
  - ACM Transactions on Algorithms (TALG), 2008.
77. Dynamic Routing Schemes for Graphs with Low Local Density
  - A. Korman and D. Peleg.
  - ACM Transactions on Algorithms (TALG), 2008.
78. Compact Separator Decompositions in Dynamic Trees and Applications to Labeling Schemes
  - A. Korman and D. Peleg.
  - Distributed Computing, 2008.
79. Improved Compact Routing Schemes for Dynamic Trees
  - A. Korman
  - PODC 2008.
80. Labeling Schemes for Weighted Dynamic Trees
  - A. Korman and D. Peleg.
  - Information and Computation (I&C), 2007.
81. General Compact Labeling Schemes for Dynamic Trees
  - A. Korman.
  - Distributed Computing, 2007.
82. Distributed Verification of Minimum Spanning Trees
  - A. Korman and S. Kutten.
  - Distributed Computing, 2007.
83. Labeling schemes for Vertex Connectivity
  - A. Korman.
  - ICALP 2007.
84. Local MST Computation with Short Advice
  - P. Fraigniaud, A. Korman and E. Lebhar.
  - SPAA 2007.
  - Comments: Selected to appear on the special issue of SPAA 2007 in ToCS.
85. Controller and Estimator for Dynamic Networks
  - A. Korman, S. Kutten.
  - PODC 2007.
86. Compact Separator Decompositions in Dynamic Trees and Applications to Labeling Schemes
  - A. Korman and D. Peleg.
  - DISC 2007.
  - Comments: Selected to appear on the special issue of DISC 2007 in Distributed Computing.
87. Labeling Schemes with Queries
  - A. Korman and S. Kutten.
  - SIROCCO 2007.
88. Distributed Verification of Minimum Spanning Trees
  - A. Korman and S. Kutten.
  - PODC 2006.
  - Comments: Selected to appear on the special issue of PODC 2006 in Distributed Computing.
89. Dynamic Routing Schemes for Graphs with Low Local Density
  - A. Korman and D. Peleg.
  - ICALP 2006.
90. Constructing Labeling Schemes through Universal Matrices
  - A. Korman, D. Peleg and Y. Rodeh,
  - ISAAC 2006
91. On Distributed Verification
  - A. Korman and S. Kutten
  - ICDCN 2006, Invited paper.
92. Proof Labeling Schemes
  - A. Korman, S. Kutten and D. Peleg.
  - PODC 2005.
93. Label-Guided Graph Exploration by a Finite Automation
  - R. Cohen, P. Fraigniaud, D. Ilcinkas, A. Korman and D. Peleg.
  - ICALP 2005.
94. General Compact Labeling Schemes for Dynamic Trees
  - A. Korman.
  - DISC 2005.
  - Comments: Won the best student paper award.
  - Selected to appear on the special issue of DISC 2005 in Distributed Computing.
95. Labeling Schemes for Tree Representation
  - R. Cohen, P. Fraigniaud, D. Ilcinkas, A. Korman and D. Peleg
  - IWDC, 2005.
96. Labeling Schemes for Flow and Connectivity
  - M. Katz, N. Katz, A. Korman and D. Peleg.
  - SIAM Journal on Computing (SICOMP), 2004.
97. Labeling Schemes for Dynamic Tree Networks
  - A. Korman, D. Peleg and Y. Rodeh.
  - Theory of Computing Systems (ToCS), 2004.
98. Labeling Schemes for Weighted Dynamic Trees
  - A. Korman and D. Peleg.
  - ICALP 2003.
99. Labeling Schemes for Flow and Connectivity
  - M. Katz, N. Katz, A. Korman and D. Peleg.
  - SODA 2002.
100. Labeling Schemes for Dynamic Tree Networks
  - A. Korman, D. Peleg and Y. Rodeh.
  - STACS 2002.
  - Comments: Selected to appear on the special issue of STACS 2002 in ToCS.