| Distributed verification and hardness of distributed approximation AD Sarma, S Holzer, L Kor, A Korman, D Nanongkai, G Pandurangan, ... SIAM Journal on Computing 41 (5), 1235-1265, 2012 | 276 | 2012 |
| Proof labeling schemes A Korman, S Kutten, D Peleg Distributed Computing 22 (4), 215-233, 2010 | 173 | 2010 |
| Towards a complexity theory for local distributed computing P Fraigniaud, A Korman, D Peleg Journal of the ACM (JACM) 60 (5), 1-26, 2013 | 147* | 2013 |
| Online computation with advice Y Emek, P Fraigniaud, A Korman, A Rosén Theoretical Computer Science 412 (24), 2642-2656, 2011 | 144 | 2011 |
| Labeling schemes for flow and connectivity M Katz, NA Katz, A Korman, D Peleg SIAM Journal on Computing 34 (1), 23-40, 2004 | 132 | 2004 |
| Collaborative search on the plane without communication O Feinerman, A Korman, Z Lotker, JS Sereni Proceedings of the 2012 ACM symposium on Principles of distributed computing …, 2012 | 104 | 2012 |
| Distributed verification of minimum spanning trees A Korman, S Kutten Distributed Computing 20 (4), 253-266, 2007 | 94 | 2007 |
| Label-guided graph exploration by a finite automaton R Cohen, P Fraigniaud, D Ilcinkas, A Korman, D Peleg ACM Transactions on Algorithms (TALG) 4 (4), 1-18, 2008 | 79 | 2008 |
| Local MST computation with short advice P Fraigniaud, A Korman, E Lebhar Theory of Computing Systems 47 (4), 920-933, 2010 | 70 | 2010 |
| Labeling schemes for dynamic tree networks A Korman, D Peleg, Y Rodeh Theory of Computing Systems 37 (1), 49-75, 2004 | 66 | 2004 |
| Labeling schemes for dynamic tree networks A Korman, D Peleg, Y Rodeh Theory of Computing Systems 37 (1), 49-75, 2004 | 66 | 2004 |
| Fast and compact self-stabilizing verification, computation, and fault detection of an MST A Korman, S Kutten, T Masuzawa Distributed Computing 28 (4), 253-295, 2015 | 58* | 2015 |
| Toward more localized local algorithms: removing assumptions concerning global knowledge A Korman, JS Sereni, L Viennot Distributed Computing 26 (5-6), 289-308, 2013 | 58 | 2013 |
| Tight bounds for distributed minimum-weight spanning tree verification L Kor, A Korman, D Peleg Theory of Computing Systems 53 (2), 318-340, 2013 | 57* | 2013 |
| Memory lower bounds for randomized collaborative search and implications for biology O Feinerman, A Korman International Symposium on Distributed Computing, 61-75, 2012 | 48 | 2012 |
| Labeling schemes for weighted dynamic trees A Korman, D Peleg Information and Computation 205 (12), 1721-1740, 2007 | 48* | 2007 |
| Individual versus collective cognition in social insects O Feinerman, A Korman Journal of Experimental Biology 220 (1), 73-82, 2017 | 47 | 2017 |
| General compact labeling schemes for dynamic trees A Korman Distributed Computing 20 (3), 179-193, 2007 | 42 | 2007 |
| Randomized distributed decision P Fraigniaud, M Göös, A Korman, M Parter, D Peleg Distributed Computing 27 (6), 419-434, 2014 | 40 | 2014 |
| Label-guided graph exploration by a finite automaton R Cohen, P Fraigniaud, D Ilcinkas, A Korman, D Peleg International Colloquium on Automata, Languages, and Programming, 335-346, 2005 | 39 | 2005 |
