Amos Korman
Cited by
Cited by
Distributed verification and hardness of distributed approximation
A Das Sarma, S Holzer, L Kor, A Korman, D Nanongkai, G Pandurangan, ...
Proceedings of the forty-third annual ACM symposium on Theory of computing …, 2011
Proof labeling schemes
A Korman, S Kutten, D Peleg
Proceedings of the twenty-fourth annual ACM symposium on Principles of …, 2005
Online computation with advice
Y Emek, P Fraigniaud, A Korman, A Rosén
Theoretical Computer Science 412 (24), 2642-2656, 2011
Towards a complexity theory for local distributed computing
P Fraigniaud, A Korman, D Peleg
Journal of the ACM (JACM) 60 (5), 1-26, 2013
Labeling schemes for flow and connectivity
M Katz, NA Katz, A Korman, D Peleg
SIAM Journal on Computing 34 (1), 23-40, 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
Distributed verification of minimum spanning trees
A Korman, S Kutten
Proceedings of the twenty-fifth annual ACM symposium on Principles of …, 2006
Individual versus collective cognition in social insects
O Feinerman, A Korman
Journal of Experimental Biology 220 (1), 73-82, 2017
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
Toward more localized local algorithms: removing assumptions concerning global knowledge
A Korman, JS Sereni, L Viennot
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of …, 2011
Local MST computation with short advice
P Fraigniaud, A Korman, E Lebhar
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms …, 2007
Tight bounds for distributed minimum-weight spanning tree verification
L Kor, A Korman, D Peleg
Theory of Computing Systems 53 (2), 318-340, 2013
Fast and compact self-stabilizing verification, computation, and fault detection of an MST
A Korman, S Kutten, T Masuzawa
Distributed Computing 28, 253-295, 2015
Labeling schemes for dynamic tree networks
A Korman, D Peleg, Y Rodeh
Theory of Computing Systems 37, 49-75, 2004
Memory lower bounds for randomized collaborative search and implications for biology
O Feinerman, A Korman
Distributed Computing: 26th International Symposium, DISC 2012, Salvador …, 2012
A locally-blazed ant trail achieves efficient collective navigation despite limited information
E Fonio, Y Heyman, L Boczkowski, A Gelblum, A Kosowski, A Korman, ...
Elife 5, e20185, 2016
Breathe before speaking: efficient information dissemination despite noisy, limited and anonymous communication
O Feinerman, B Haeupler, A Korman
Proceedings of the 2014 ACM symposium on Principles of distributed computing …, 2014
Randomized distributed decision
P Fraigniaud, M Göös, A Korman, M Parter, D Peleg
Distributed Computing 27 (6), 419-434, 2014
Theoretical distributed computing meets biology: A review
O Feinerman, A Korman
International Conference on Distributed Computing and Internet Technology, 1-18, 2013
Labeling schemes for weighted dynamic trees
A Korman, D Peleg
Information and Computation 205 (12), 1721-1740, 2007
The system can't perform the operation now. Try again later.
Articles 1–20