פרופ' עמוס קורמן

• Fast and Robust Information Spreading in the Noisy PULL Model, D’Archivio, N., Korman, A., Natale, E. & Vacus, R., 24 May 2026, AAMAS 2026 - Proceedings of the 25th International Conference on Autonomous Agents and Multiagent Systems. Association for Computing Machinery, Inc, p. 3253-3255 3 p. (AAMAS 2026 - Proceedings of the 25th International Conference on Autonomous Agents and Multiagent Systems).
• Brief Announcement: Fast and Robust Information Spreading in the Noisy PULL Model, D'archivio, N., Korman, A., Natale, E. & Vacus, R., 13 Jun 2025, PODC 2025 - Proceedings of the 2025 ACM Symposium on Principles of Distributed Computing. Association for Computing Machinery, p. 545-548 4 p. (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing; vol. Part of F216205).
• Fast and Robust Information Spreading in the Noisy PULL Model, D'Archivio, N., Korman, A., Natale, E. & Vacus, R., Jun 2025, PODC '25: Proceedings of the ACM Symposium on Principles of Distributed Computing. New York: Association for Computing Machinery, p. 545 - 548
• The 2025 motile active matter roadmap, Gompper, G., Stone, H. A., Kurzthaler, C., Saintillan, D., Peruani, F., Fedosov, D. A., Auth, T., Cottin-Bizonne, C., Ybert, C., Clément, E., Darnige, T., Lindner, A., Goldstein, R. E., Liebchen, B., Binysh, J., Souslov, A., Isa, L., di Leonardo, R., Frangipane, G. & Gu, H. & 12 others, Nelson, B. J., Brauns, F., Marchetti, M. C., Cichos, F., Heuthe, V. L., Bechinger, C., Korman, A., Feinerman, O., Cavagna, A., Giardina, I., Jeckel, H. & Drescher, K., 7 Apr 2025, In: Journal of Physics Condensed Matter. 37, 14, 143501.
• The Query Complexity of Searching Trees with Permanently Noisy Advice, Boczkowski, L., Feige, U., Korman, A. & Rodeh, Y., 7 Feb 2025, In: ACM Transactions on Algorithms. 21, 2, 18.
• Comparing cooperative geometric puzzle solving in ants versus humans, Dreyer, T., Haluts, A., Korman, A., Gov, N., Fonio, E. & Feinerman, O., 7 Jan 2025, In: Proceedings of the National Academy of Sciences of the United States of America. 122, 1, e2414274121.
• Early adapting to trends: self-stabilizing information spread using passive communication, Korman, A. & Vacus, R., Dec 2024, In: Distributed Computing. 37, 4, p. 335-362 28 p.
• Fast and Robust Information Spreading in the Noisy PULL Model, D'Archivio, N., Korman, A., Natale, E. & Vacus, R., Nov 2024, In: CoRR. p. 1-41
• Abundant resources can trigger reduced consumption: Unveiling the paradox of excessive scrounging, Vacus, R. & Korman, A., 26 Mar 2024, In: Proceedings of the National Academy of Sciences of the United States of America. 121, 13, e2322955121.
• On the Role of Memory in Robust Opinion Dynamics, Becchetti, L., Clementi, A., Korman, A., Pasquale, F., Trevisan, L. & Vacus, R., 2023, Proceedings of the 32nd International Joint Conference on Artificial Intelligence, IJCAI 2023. Elkind, E. (ed.). International Joint Conferences on Artificial Intelligence, p. 29-37 9 p. (IJCAI International Joint Conference on Artificial Intelligence; vol. 2023-August).
• Public communication can facilitate low-risk coordination under surveillance, Korman, A. & Crescenzi, P., Dec 2022, In: Scientific Reports. 12, 1, 3433.
• Early Adapting to Trends: Self-Stabilizing Information Spread using Passive Communication, Korman, A. & Vacus, R., 21 Jul 2022, PODC 2022 - Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing. Association for Computing Machinery, p. 235-245 11 p. (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing).
• On the role of hypocrisy in escaping the tragedy of the commons, Korman, A. & Vacus, R., Dec 2021, In: Scientific Reports. 11, 1, 17585.
• Navigating in Trees with Permanently Noisy Advice, Boczkowski, L., Feige, U., Korman, A. & Rodeh, Y., Jun 2021, In: ACM Transactions on Algorithms. 17, 2, 3448305.
• Intermittent inverse-square Lévy walks are optimal for finding targets of all sizes, Guinard, B. & Korman, A., 9 Apr 2021, In: Science Advances. 7, 15, eabe8211.
• Multi-round cooperative search games with multiple players, Korman, A. & Rodeh, Y., Nov 2020, In: Journal of Computer and System Sciences. 113, p. 125-149 25 p.
• Reinforcement Learning Enables Resource Partitioning in Foraging Bats, Goldshtein, A., Handel, M., Eitan, O., Bonstein, A., Shaler, T., Collet, S., Greif, S., Medellín, R. A., Emek, Y., Korman, A. & Yovel, Y., 19 Oct 2020, In: Current Biology. 30, 20, p. 4096-4102.e6
• Tight bounds for the cover times of random walks with heterogeneous step lengths, Guinard, B. & Korman, A., Mar 2020, 37th International Symposium on Theoretical Aspects of Computer Science, STACS 2020. Paul, C. & Blaser, M. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, LIPIcs-STACS-2020-28. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 154).
• Multi-round cooperative search games with multiple players, Korman, A. & Rodeh, Y., 1 Jul 2019, 46th International Colloquium on Automata, Languages, and Programming, ICALP 2019. Baier, C., Chatzigiannakis, I., Flocchini, P. & Leonardi, S. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 146. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 132).
• Minimizing message size in stochastic communication patterns: fast self-stabilizing protocols with 3 bits, Boczkowski, L., Korman, A. & Natale, E., 1 Jun 2019, In: Distributed Computing. 32, 3, p. 173-191 19 p.
• Searching a tree with permanently noisy advice, Boczkowski, L., Korman, A. & Rodeh, Y., 1 Aug 2018, 26th European Symposium on Algorithms, ESA 2018. Bast, H., Herman, G. & Azar, Y. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, (Leibniz International Proceedings in Informatics, LIPIcs; vol. 112).
• Limits on reliable information flows through stochastic populations, Boczkowski, L., Natale, E., Feinerman, O. & Korman, A., Jun 2018, In: PLOS Computational Biology. 14, 6, e1006195.
• Random walks with multiple step lengths, Boczkowski, L., Guinard, B., Korman, A., Lotker, Z. & Renault, M., 2018, LATIN 2018: Theoretical Informatics - 13th Latin American Symposium, Proceedings. Mosteiro, M. A., Bender, M. A. & Farach-Colton, M. (eds.). Springer Verlag, p. 174-186 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10807 LNCS).
• Minimizing message size in stochastic communication patterns: Fast self-stabilizing protocols with 3 bits, Boczkowski, L., Korman, A. & Natale, E., 2017, 28th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017. Klein, P. N. (ed.). Association for Computing Machinery, p. 2540-2559 20 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 0).
• Individual versus collective cognition in social insects, Feinerman, O. & Korman, A., 1 Jan 2017, In: Journal of Experimental Biology. 220, 1, p. 73-82 10 p.
• Parallel exhaustive search without coordination, Fraigniaud, P., Korman, A. & Rodeh, Y., 19 Jun 2016, STOC 2016 - Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing. Mansour, Y. & Wichs, D. (eds.). Association for Computing Machinery, p. 312-323 12 p. (Proceedings of the Annual ACM Symposium on Theory of Computing; vol. 19-21-June-2016).
• An optimal ancestry labeling scheme with applications to XML trees and universal posets, Fraigniaud, P. & Korman, A., Feb 2016, In: Journal of the ACM. 63, 1, p. 1-31 31 p.
• Confidence Sharing: An Economic Strategy for Efficient Information Flows in Animal Groups, Korman, A., Greenwald, E. & Feinerman, O., 1 Oct 2014, In: PLOS Computational Biology. 10, 10
• Breathe before speaking: Efficient information dissemination despite noisy, limited and anonymous communication, Feinerman, O., Haeupler, B. & Korman, A., 15 Jul 2014, PODC 2014 - Proceedings of the 2014 ACM Symposium on Principles of Distributed Computing. Association for Computing Machinery, p. 114-123 10 p. (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing).
• Toward more localized local algorithms: Removing assumptions concerning global knowledge, Korman, A., Sereni, J. S. & Viennot, L., Oct 2013, In: Distributed Computing. 26, 5-6, p. 289-308 20 p.
• Tight Bounds for Distributed Minimum-Weight Spanning Tree Verification, Kor, L., Korman, A. & Peleg, D., Aug 2013, In: Theory of Computing Systems. 53, 2, p. 318-340 23 p.
• What can be decided locally without identifiers, Fraigniaud, P., Göös, M., Korman, A. & Suomela, J., 22 Jul 2013, PODC 2013 - Proceedings of the 2013 ACM Symposium on Principles of Distributed Computing. Association for Computing Machinery, p. 157-165 9 p. (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing).
• Randomized distributed decision, Fraigniaud, P., Korman, A., Parter, M. & Peleg, D., 2012, Distributed Computing - 26th International Symposium, DISC 2012, Proceedings. p. 371-385 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7611 LNCS).
• Memory lower bounds for randomized collaborative search and implications for biology, Feinerman, O. & Korman, A., 2012, Distributed Computing - 26th International Symposium, DISC 2012, Proceedings. p. 61-75 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7611 LNCS).
• Notions of connectivity in overlay networks, Emek, Y., Fraigniaud, P., Korman, A., Kutten, S. & Peleg, D., 2012, Structural Information and Communication Complexity - 19th International Colloquium, SIROCCO 2012, Proceedings. p. 25-35 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7355 LNCS).
• New bounds for the controller problem, Emek, Y. & Korman, A., Nov 2011, In: Distributed Computing. 24, 3-4, p. 177-186 10 p.
• Fast and compact self stabilizing verification, computation, and fault detection of an MST, Korman, A., Kutten, S. & Masuzawa, T., 6 Jun 2011, PODC'11 - Proceedings of the 2011 ACM Symposium Principles of Distributed Computing. Association for Computing Machinery, p. 311-320 10 p. (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing).
• Local distributed decision, Fraigniaud, P., Korman, A. & Peleg, D., 2011, Proceedings - 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, FOCS 2011. p. 708-717 10 p. 6108235. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS).
• Tight bounds for distributed MST verification, Kor, L., Korman, A. & Peleg, D., 2011, 28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011. p. 69-80 12 p. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 9).
• Proof labeling schemes, Korman, A., Kutten, S. & Peleg, D., May 2010, In: Distributed Computing. 22, 4, p. 215-233 19 p.
• Brief announcement: New bounds for the controller problem, Emek, Y. & Kormany, A., 10 Aug 2009, PODC'09 - Proceedings of the 2009 ACM Symposium on Principles of Distributed Computing. Association for Computing Machinery (ACM), p. 340-341 2 p. (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing).
• Compact routing schemes for dynamic trees in the fixed port model, Korman, A., 2009, Distributed Computing and Networking - 10th International Conference, ICDCN 2009, Proceedings. Springer Verlag, p. 218-229 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 5408 LNCS).
• General compact labeling schemes for dynamic trees, Korman, A., Oct 2007, In: Distributed Computing. 20, 3, p. 179-193 15 p.
• Compact separator decompositions in dynamic trees and applications to labeling schemes, Korman, A. & Peleg, D., 2007, Distributed Computing - 21st International Symposium, DISC 2007, Proceedings. Springer Verlag, p. 313-327 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4731 LNCS).
• On distributed verification, Korman, A. & Kutten, S., 2006, Distributed Computing and Networking - 8th International Conference, ICDCN 2006, Proceedings. p. 100-114 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4308 LNCS).
• Constructing labeling schemes through universal matrices, Korman, A., Peleg, D. & Rodeh, Y., 2006, Algorithms and Computation - 17th International Symposium, ISAAC 2006, Proceedings. p. 409-418 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4288 LNCS).
• Dynamic routing schemes for general graphs, Korman, A. & Peleg, D., 2006, Automata, Languages and Programming - 33rd International Colloquium, ICALP 2006, Proceedings. Springer Verlag, p. 619-630 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4051 LNCS).
• Label-guided graph exploration by a finite automaton, Cohen, R., Fraigniaud, P., Ilcinkas, D., Korman, A. & Peleg, D., 2005, ICALP 2005: Automata, Languages and Programming. p. 335-346 12 p. (Lecture Notes in Computer Science; vol. 3580).
• Labeling schemes for flow and connectivity (Extended abstract), Katz, M., Katz, N. A., Korman, A. & Peleg, D., 2002, Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2002. Association for Computing Machinery, p. 927-936 10 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 06-08-January-2002).
• Labeling schemes for dynamic tree networks, Korman, A., Peleg, D. & Rodeh, Y., 2002, STACS 2002 - 19th Annual Symposium on Theoretical Aspects of Computer Science, Proceedings. Alt, H. & Ferreira, A. (eds.). Springer Verlag, p. 76-87 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 2285).

• 2015: הביליטציה (HDR - Habilitation à diriger des recherches) אוניברסיטת פריז-דידרו. כותרת העבודה: ""Distributed Decision and Distributed Biological Algorithms"".
• 2000–2005: מסלול ישיר לדוקטורט (Ph.D) במדעי המחשב מכון ויצמן למדע בהנחיית פרופ' דוד פלג. כותרת התזה: ""Static and Dynamic Labeling Schemes"". זוכה פרס הדיקן לתלמידי דוקטורט. (התואר הוענק במאי 2006).
• 1998–1999: תואר שני (M.Sc) במתמטיקה אוניברסיטת סטנפורד, ארה""ב.
• 1995–1997: תואר ראשון (B.Sc) במתמטיקה האוניברסיטה העברית בירושלים, סיום בהצטיינות יתרה.

1. שילוב תיאוריה וניסוי: פיתוח מתודולוגיות המשלבות ניתוח אלגוריתמי קפדני עם תכנון מערכי ניסוי ביולוגיים.
2. תחזיות מבוססות מודלים: ביסוס ואימות של תחזיות משמעותיות הנגזרות מרעיונות וניתוחים אלגוריתמיים.
3. חסמים תחתונים בטבע: בחינת התובנות שחסמים תחתונים אלגוריתמיים מספקים לגבי המגבלות המובנות במערכות ביולוגיות וחברתיות.

• רעש ותחרות: כיצד גורמים אלו משפיעים על יעילות הקבוצה בביצוע משימות קולקטיביות?
• חיפוש מזון (Foraging) חישובי: אילו אתגרים חישוביים ניצבים בפני בעלי חיים בעת חיפוש משאבים, ואילו אסטרטגיות מאפשרות להתגבר עליהם?
• מחוקים פשוטים לדפוסים מורכבים: כיצד אינטראקציות בסיסיות ברמת הפרט מתגבשות להתנהגות קולקטיבית מורכבת ברמת הקבוצה?

2026: פרס דייקסטרה

2020: פרס SIROCCO לחדשנות בחישוב מבוזר.

2009: פרס המאמר המצטיין בכנס ICDCN.

2006: פרס הדיקן לתלמידי דוקטורט, מכון ויצמן למדע.

2005: פרס מאמר הסטודנט המצטיין בכנס DISC.

1997: סיום תואר ראשון באוניברסיטה העברית בהצטיינות יתרה.