Distributed (delta+1)-coloring in linear (in delta) time. - Leonid Barenboim; Michael Elkin (STOC, 2009)

Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition. - Leonid Barenboim; Michael Elkin (Distributed Comput., 2010)

A review of PODC 2010. - Leonid Barenboim (SIGACT News, 2010)

Deterministic Distributed Vertex Coloring in Polylogarithmic Time. - Leonid Barenboim; Michael Elkin (J. ACM, 2011)

On the Locality of Some NP-Complete Problems. - Leonid Barenboim (ICALP (2), 2012)

Fast Distributed Algorithms for Maximal Matching and Maximal Independent Set - Leonid Barenboim; Michael Elkin; Seth Pettie; Johannes Schneider 002 (CoRR, 2012)

Distributed deterministic edge coloring using bounded neighborhood independence. - Leonid Barenboim; Michael Elkin (Distributed Comput., 2013)

Distributed Graph Coloring: Fundamentals and Recent Developments - Leonid Barenboim; Michael Elkin (Distributed Graph Coloring, 2013)

Combinatorial algorithms for distributed graph coloring. - Leonid Barenboim; Michael Elkin (Distributed Comput., 2014)

Distributed (Delta+1)-Coloring in Linear (in Delta) Time. - Leonid Barenboim; Michael Elkin; Fabian Kuhn (SIAM J. Comput., 2014)

Deterministic and Energy-Optimal Wireless Synchronization. - Leonid Barenboim; Shlomi Dolev; Rafail Ostrovsky (ACM Trans. Sens. Networks, 2014)

A Fast Network-Decomposition Algorithm and Its Applications to Constant-Time Distributed Computation - (Extended Abstract). - Leonid Barenboim; Michael Elkin; Cyril Gavoille (SIROCCO, 2015)

Nearly Optimal Local Broadcasting in the SINR Model with Feedback. - Leonid Barenboim; David Peleg (SIROCCO, 2015)

Distributed Symmetry: Breaking from a Local Point of View. - Leonid Barenboim (SIGACT News, 2015)

Memory-Aware Management for Heterogeneous Main Memory Using an Optimization of the Aging Paging Algorithm. - Gal Oren 001; Leonid Barenboim; Lior Amar (ICPP Workshops, 2016)

Memory-Aware Management for Multi-Level Main Memory Complex using an Optimization of the Aging Paging Algorithm. - Gal Oren 001; Leonid Barenboim; Lior Amar (SYSTOR, 2016)

Deterministic Distributed (Delta + o(Δ))-Edge-Coloring, and Vertex-Coloring of Graphs with Bounded Diversity. - Leonid Barenboim; Michael Elkin; Tzalik Maimon (CoRR, 2016)

Deterministic (Δ + 1)-Coloring in Sublinear (in Δ) Time in Static, Dynamic, and Faulty Networks. - Leonid Barenboim (J. ACM, 2016)

The Locality of Distributed Symmetry Breaking. - Leonid Barenboim; Michael Elkin; Seth Pettie; Johannes Schneider 002 (J. ACM, 2016)

Fully-Dynamic Graph Algorithms with Sublinear Time Inspired by Distributed Computing. - Leonid Barenboim; Tzalik Maimon (ICCS, 2017)

Adaptive Distributed Hierarchical Sensing algorithm for reduction of wireless sensor network cluster-heads energy consumption. - Gal Oren 001; Leonid Barenboim; Harel Levin (IWCMC, 2017)

Deterministic Distributed (Delta + o(Delta))-Edge-Coloring, and Vertex-Coloring of Graphs with Bounded Diversity. - Leonid Barenboim; Michael Elkin; Tzalik Maimon (PODC, 2017)

Load-Balancing Adaptive Clustering Refinement Algorithm for Wireless Sensor Network Clusters. - Gal Oren 001; Leonid Barenboim; Harel Levin (WWIC, 2017)

Locally-Iterative Distributed (Delta + 1)-Coloring below Szegedy-Vishwanathan Barrier, and Applications to Self-Stabilization and to Restricted-Bandwidth Models. - Leonid Barenboim; Michael Elkin; Uri Goldenberg (CoRR, 2017)

Distributed Fault-Tolerant Backup-Placement in Overloaded Wireless Sensor Networks. - Gal Oren 001; Leonid Barenboim; Harel Levin (BROADNETS, 2018)

Distributed Symmetry-Breaking Algorithms for Congested Cliques. - Leonid Barenboim; Victor Khazanov (CSR, 2018)

Distributed Symmetry Breaking in Graphs with Bounded Diversity. - Leonid Barenboim; Tzalik Maimon (IPDPS, 2018)

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 (PODC, 2018)

Brief Announcement: Distributed Symmetry-Breaking with Improved Vertex-Averaged Complexity. - Leonid Barenboim; Yaniv Tzur (SPAA, 2018)

A fast network-decomposition algorithm and its applications to constant-time distributed computation. - Leonid Barenboim; Michael Elkin; Cyril Gavoille (Theor. Comput. Sci., 2018)

Distributed symmetry-breaking with improved vertex-averaged complexity. - Leonid Barenboim; Yaniv Tzur (ICDCN, 2019)

Fast Distributed Backup Placement in Sparse and Dense Graphs. - Leonid Barenboim; Gal Oren 001 (CoRR, 2019)

Dynamic SDN Controller Load Balancing. - Hadar Sufiev; Yoram Haddad 001; Leonid Barenboim; José Soler (Future Internet, 2019)

Fully Dynamic Graph Algorithms Inspired by Distributed Computing: Deterministic Maximal Matching and Edge Coloring in Sublinear Update-Time. - Leonid Barenboim; Tzalik Maimon (ACM J. Exp. Algorithmics, 2019)

Fast Distributed Backup Placement in Sparse and Dense Networks. - Leonid Barenboim; Gal Oren 001 (APOCS, 2020)

Distributed Backup Placement in One Round and its Applications to Maximum Matching Approximation and Self-Stabilization. - Leonid Barenboim; Gal Oren 001 (SOSA, 2020)

Simple Distributed Spanners in Dense Congest Networks. - Leonid Barenboim; Tzalik Maimon (SOFSEM, 2020)

Distributed K-Backup-Placement and Applications to Virtual Memory in Heterogeneous Networks. - Gal Oren 001; Leonid Barenboim (CoRR, 2020)

Distributed Backup K-Placement and Applications to Virtual Memory in Wireless Networks. - Gal Oren 001; Leonid Barenboim (ICDCN (Adjunct Volume), 2021)

Backup Placement in WSNs in the Network Management Distributed Setting. - Gal Oren 001; Leonid Barenboim (ICDCS Workshops, 2021)

Deterministic Logarithmic Completeness in the Distributed Sleeping Model. - Leonid Barenboim; Tzalik Maimon (DISC, 2021)

Memory Allocation for Neural Networks using Graph Coloring. - Leonid Barenboim; Rami Drucker; Oleg Zatulovsky; Eli Levi (ICDCN, 2022)

Distributed backup placement. - Leonid Barenboim; Gal Oren 001 (Distributed Comput., 2022)

Locally-iterative Distributed (Δ + 1)-coloring and Applications. - Leonid Barenboim; Michael Elkin; Uri Goldenberg (J. ACM, 2022)

Poster: Synchronizing Devices with Minimal Data Exchange and Applications for Graph-Based SLAM. - Oleg Zatulovsky; Leonid Barenboim; Rami Drucker; Shai Segal (SEC, 2023)

Secured distributed algorithms without hardness assumptions. - Leonid Barenboim; Harel Levin (J. Parallel Distributed Comput., 2023)

Speedup of Distributed Algorithms for Power Graphs in the CONGEST Model. - Leonid Barenboim; Uri Goldenberg (DISC, 2024)

Persona-PhysioSync AV: Personalized Interaction through Personality and Physiology Monitoring in Autonomous Vehicles. - Jonathan Giron; Yaron Sela; Leonid Barenboim; Gail Gilboa-Freedman; Yair Amichai-Hamburger (Sensors, 2024)

Sampling and output estimation in distributed algorithms and LCAs. - Leonid Barenboim; Tzalik Maimon (Theor. Comput. Sci., 2025)