| 2022 | ICDCN | Memory Allocation for Neural Networks using Graph Coloring. | Leonid Barenboim, Rami Drucker, Oleg Zatulovsky, Eli Levi |
| 2021 | ICDCN | Distributed Backup K-Placement and Applications to Virtual Memory in Wireless Networks. | Gal Oren, Leonid Barenboim |
| 2021 | ICDCN | Sampling and Output Estimation in Distributed Algorithms and LCAs. | Leonid Barenboim, Tzalik Maimon |
| 2020 | OPODIS | Secured Distributed Algorithms Without Hardness Assumptions. | Leonid Barenboim, Harel Levin |
| 2020 | SODA | Distributed Backup Placement in One Round and its Applications to Maximum Matching Approximation and Self-Stabilization. | Leonid Barenboim, Gal Oren |
| 2020 | SOFSEM | Simple Distributed Spanners in Dense Congest Networks. | Leonid Barenboim, Tzalik Maimon |
| 2019 | ICDCN | Distributed symmetry-breaking with improved vertex-averaged complexity. | Leonid Barenboim, Yaniv Tzur |
| 2018 | Broadnets | Distributed Fault-Tolerant Backup-Placement in Overloaded Wireless Sensor Networks. | Gal Oren, Leonid Barenboim, Harel Levin |
| 2018 | CSR | Distributed Symmetry-Breaking Algorithms for Congested Cliques. | Leonid Barenboim, Victor Khazanov |
| 2018 | PODC | Locally-Iterative Distributed (Δ+ 1): -Coloring below Szegedy-Vishwanathan Barrier, and Applications to Self-Stabilization and to Restricted-Bandwidth Models. | Leonid Barenboim, Michael Elkin, Uri Goldenberg |
| 2018 | SPAA | Brief Announcement: Distributed Symmetry-Breaking with Improved Vertex-Averaged Complexity. | Leonid Barenboim, Yaniv Tzur |
| 2018 | SYSTOR | Distributed Fault-Tolerant Backup-Placement in Overloaded Wireless Sensor Networks. | Gal Oren, Leonid Barenboim, Harel Levin |
| 2017 | ICCS | Fully-Dynamic Graph Algorithms with Sublinear Time Inspired by Distributed Computing. | Leonid Barenboim, Tzalik Maimon |
| 2017 | IWCMC | Adaptive Distributed Hierarchical Sensing algorithm for reduction of wireless sensor network cluster-heads energy consumption. | Gal Oren, Leonid Barenboim, Harel Levin |
| 2017 | PODC | Deterministic Distributed (Delta + o(Delta))-Edge-Coloring, and Vertex-Coloring of Graphs with Bounded Diversity. | Leonid Barenboim, Michael Elkin, Tzalik Maimon |
| 2016 | SYSTOR | Memory-Aware Management for Multi-Level Main Memory Complex using an Optimization of the Aging Paging Algorithm. | Gal Oren, Leonid Barenboim, Lior Amar |
| 2015 | PODC | Deterministic (Δ + 1)-Coloring in Sublinear (in Δ) Time in Static, Dynamic and Faulty Networks. | Leonid Barenboim |
| 2015 | SIROCCO | A Fast Network-Decomposition Algorithm and Its Applications to Constant-Time Distributed Computation - (Extended Abstract). | Leonid Barenboim, Michael Elkin, Cyril Gavoille |
| 2015 | SIROCCO | Nearly Optimal Local Broadcasting in the SINR Model with Feedback. | Leonid Barenboim, David Peleg |
| 2012 | FOCS | The Locality of Distributed Symmetry Breaking. | Leonid Barenboim, Michael Elkin, Seth Pettie, Johannes Schneider |
| 2012 | ICALP | On the Locality of Some NP-Complete Problems. | Leonid Barenboim |
| 2011 | PODC | Distributed deterministic edge coloring using bounded neighborhood independence. | Leonid Barenboim, Michael Elkin |
| 2010 | PODC | Deterministic distributed vertex coloring in polylogarithmic time. | Leonid Barenboim, Michael Elkin |
| 2009 | STOC | Distributed (delta+1)-coloring in linear (in delta) time. | Leonid Barenboim, Michael Elkin |
| 2008 | PODC | Sublogarithmic distributed MIS algorithm for sparse graphs using nash-williams decomposition. | Leonid Barenboim, Michael Elkin |