| The locality of distributed symmetry breaking L Barenboim, M Elkin, S Pettie, J Schneider Journal of the ACM (JACM) 63 (3), 1-45, 2016 | 321 | 2016 |
| Distributed graph coloring: Fundamentals and recent developments L Barenboim, M Elkin Morgan & Claypool Publishers, 2013 | 267 | 2013 |
| Distributed (δ+ 1)-coloring in linear (in δ) time L Barenboim, M Elkin Proceedings of the forty-first annual ACM symposium on Theory of computing …, 2009 | 248 | 2009 |
| Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition L Barenboim, M Elkin Proceedings of the twenty-seventh ACM symposium on Principles of distributed …, 2008 | 215 | 2008 |
| Deterministic distributed vertex coloring in polylogarithmic time L Barenboim, M Elkin Journal of the ACM (JACM) 58 (5), 1-25, 2011 | 155 | 2011 |
| Deterministic (Δ+ 1)-coloring in sublinear (in Δ) time in static, dynamic, and faulty networks L Barenboim Journal of the ACM (JACM) 63 (5), 1-22, 2016 | 110 | 2016 |
| Locally-Iterative Distributed (Δ+ 1) -Coloring below Szegedy-Vishwanathan Barrier, and Applications to Self-Stabilization and to Restricted-Bandwidth Models L Barenboim, M Elkin, U Goldenberg Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing …, 2018 | 76 | 2018 |
| Dynamic SDN controller load balancing H Sufiev, Y Haddad, L Barenboim, J Soler Future Internet 11 (3), 75, 2019 | 57 | 2019 |
| A fast network-decomposition algorithm and its applications to constant-time distributed computation L Barenboim, M Elkin, C Gavoille Theoretical Computer Science 751, 2-23, 2018 | 51 | 2018 |
| Distributed deterministic edge coloring using bounded neighborhood independence L Barenboim, M Elkin Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of …, 2011 | 42 | 2011 |
| On the locality of some NP-complete problems L Barenboim International Colloquium on Automata, Languages, and Programming, 403-415, 2012 | 30 | 2012 |
| Deterministic distributed (Delta+ o (Delta))-edge-coloring, and vertex-coloring of graphs with bounded diversity L Barenboim, M Elkin, T Maimon Proceedings of the ACM Symposium on Principles of Distributed Computing, 175-184, 2017 | 29 | 2017 |
| Fully-dynamic graph algorithms with sublinear time inspired by distributed computing L Barenboim, T Maimon Procedia Computer Science 108, 89-98, 2017 | 27 | 2017 |
| Deterministic logarithmic completeness in the distributed sleeping model L Barenboim, T Maimon arXiv preprint arXiv:2108.01963, 2021 | 20 | 2021 |
| Distributed symmetry-breaking algorithms for congested cliques L Barenboim, V Khazanov International Computer Science Symposium in Russia, 41-52, 2018 | 20 | 2018 |
| Nearly optimal local broadcasting in the SINR model with feedback L Barenboim, D Peleg International Colloquium on Structural Information and Communication …, 2015 | 20 | 2015 |
| Combinatorial algorithms for distributed graph coloring L Barenboim, M Elkin Distributed Computing 27, 79-93, 2014 | 20 | 2014 |
| Locally-iterative distributed (Δ+ 1)-coloring and applications L Barenboim, M Elkin, U Goldenberg ACM Journal of the ACM (JACM) 69 (1), 1-26, 2021 | 16 | 2021 |
| Adaptive Distributed Hierarchical Sensing algorithm for reduction of wireless sensor network cluster-heads energy consumption G Oren, L Barenboim, H Levin 2017 13th International Wireless Communications and Mobile Computing …, 2017 | 14 | 2017 |
| Distributed symmetry-breaking with improved vertex-averaged complexity L Barenboim, Y Tzur Proceedings of the 20th International Conference on Distributed Computing …, 2019 | 13 | 2019 |
