Leonid Barenboim

According to our database, Leonid Barenboim authored at least 49 papers between 2009 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

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, March, 2024

2023

Secured distributed algorithms without hardness assumptions.

Leonid Barenboim, Harel Levin

J. Parallel Distributed Comput., January, 2023

Speedup of Distributed Algorithms for Power Graphs in the CONGEST Model.

Leonid Barenboim, Uri Goldenberg

CoRR, 2023

Poster: Synchronizing Devices with Minimal Data Exchange and Applications for Graph-Based SLAM.

Oleg Zatulovsky, Leonid Barenboim, Rami Drucker, Shai Segal

Proceedings of the IEEE/ACM Symposium on Edge Computing, 2023

2022

Locally-iterative Distributed (Δ + 1)-coloring and Applications.

Leonid Barenboim, Michael Elkin, Uri Goldenberg

J. ACM, 2022

Distributed backup placement.

Leonid Barenboim, Gal Oren

Distributed Comput., 2022

Memory Allocation for Neural Networks using Graph Coloring.

Leonid Barenboim, Rami Drucker, Oleg Zatulovsky, Eli Levi

Proceedings of the ICDCN '22: 23rd International Conference on Distributed Computing and Networking, Delhi, AA, India, January 4, 2022

2021

Deterministic Logarithmic Completeness in the Distributed Sleeping Model.

Leonid Barenboim, Tzalik Maimon

Proceedings of the 35th International Symposium on Distributed Computing, 2021

Backup Placement in WSNs in the Network Management Distributed Setting.

Gal Oren, Leonid Barenboim

Proceedings of the 41st IEEE International Conference on Distributed Computing Systems Workshops, 2021

Sampling and Output Estimation in Distributed Algorithms and LCAs.

Leonid Barenboim, Tzalik Maimon

Proceedings of the ICDCN '21: International Conference on Distributed Computing and Networking, 2021

Distributed Backup K-Placement and Applications to Virtual Memory in Wireless Networks.

Gal Oren, Leonid Barenboim

Proceedings of the ICDCN '21: International Conference on Distributed Computing and Networking, 2021

2020

Distributed K-Backup-Placement and Applications to Virtual Memory in Heterogeneous Networks.

Gal Oren, Leonid Barenboim

CoRR, 2020

Simple Distributed Spanners in Dense Congest Networks.

Leonid Barenboim, Tzalik Maimon

Proceedings of the SOFSEM 2020: Theory and Practice of Computer Science, 2020

Distributed Backup Placement in One Round and its Applications to Maximum Matching Approximation and Self-Stabilization.

Leonid Barenboim, Gal Oren

Proceedings of the 3rd Symposium on Simplicity in Algorithms, 2020

Fast Distributed Backup Placement in Sparse and Dense Networks.

Leonid Barenboim, Gal Oren

Proceedings of the 1st Symposium on Algorithmic Principles of Computer Systems, 2020

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

Dynamic SDN Controller Load Balancing.

Hadar Sufiev, Yoram Haddad, Leonid Barenboim, José Soler

Future Internet, 2019

Fast Distributed Backup Placement in Sparse and Dense Graphs.

Leonid Barenboim, Gal Oren

CoRR, 2019

Distributed symmetry-breaking with improved vertex-averaged complexity.

Leonid Barenboim, Yaniv Tzur

Proceedings of the 20th International Conference on Distributed Computing and Networking, 2019

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 Fault-Tolerant Backup-Placement in Overloaded Wireless Sensor Networks.

Gal Oren, Leonid Barenboim, Harel Levin

Proceedings of the 11th ACM International Systems and Storage Conference, 2018

Brief Announcement: Distributed Symmetry-Breaking with Improved Vertex-Averaged Complexity.

Leonid Barenboim, Yaniv Tzur

Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, 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

Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018

Distributed Symmetry Breaking in Graphs with Bounded Diversity.

Leonid Barenboim, Tzalik Maimon

Proceedings of the 2018 IEEE International Parallel and Distributed Processing Symposium, 2018

Distributed Symmetry-Breaking Algorithms for Congested Cliques.

Leonid Barenboim, Victor Khazanov

Proceedings of the Computer Science - Theory and Applications, 2018

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

Load-Balancing Adaptive Clustering Refinement Algorithm for Wireless Sensor Network Clusters.

Gal Oren, Leonid Barenboim, Harel Levin

Proceedings of the Wired/Wireless Internet Communications, 2017

Deterministic Distributed (Delta + o(Delta))-Edge-Coloring, and Vertex-Coloring of Graphs with Bounded Diversity.

Leonid Barenboim, Michael Elkin, Tzalik Maimon

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2017

Adaptive Distributed Hierarchical Sensing algorithm for reduction of wireless sensor network cluster-heads energy consumption.

Gal Oren, Leonid Barenboim, Harel Levin

Proceedings of the 13th International Wireless Communications and Mobile Computing Conference, 2017

Fully-Dynamic Graph Algorithms with Sublinear Time Inspired by Distributed Computing.

Leonid Barenboim, Tzalik Maimon

Proceedings of the International Conference on Computational Science, 2017

2016

The Locality of Distributed Symmetry Breaking.

Leonid Barenboim, Michael Elkin, Seth Pettie, Johannes Schneider

J. ACM, 2016

Deterministic (Δ + 1)-Coloring in Sublinear (in Δ) Time in Static, Dynamic, and Faulty Networks.

Leonid Barenboim

J. ACM, 2016

Deterministic Distributed (Delta + o(Δ))-Edge-Coloring, and Vertex-Coloring of Graphs with Bounded Diversity.

Leonid Barenboim, Michael Elkin, Tzalik Maimon

CoRR, 2016

Memory-Aware Management for Multi-Level Main Memory Complex using an Optimization of the Aging Paging Algorithm.

Gal Oren, Leonid Barenboim, Lior Amar

Proceedings of the 9th ACM International on Systems and Storage Conference, 2016

Memory-Aware Management for Heterogeneous Main Memory Using an Optimization of the Aging Paging Algorithm.

Gal Oren, Leonid Barenboim, Lior Amar

Proceedings of the 45th International Conference on Parallel Processing Workshops, 2016

2015

Distributed Symmetry: Breaking from a Local Point of View.

Leonid Barenboim

SIGACT News, 2015

Nearly Optimal Local Broadcasting in the SINR Model with Feedback.

Leonid Barenboim, David Peleg

Proceedings of the Structural Information and Communication Complexity, 2015

A Fast Network-Decomposition Algorithm and Its Applications to Constant-Time Distributed Computation - (Extended Abstract).

Leonid Barenboim, Michael Elkin, Cyril Gavoille

Proceedings of the Structural Information and Communication Complexity, 2015

2014

Deterministic and Energy-Optimal Wireless Synchronization.

Leonid Barenboim, Shlomi Dolev, Rafail Ostrovsky

ACM Trans. Sens. Networks, 2014

Distributed (Delta+1)-Coloring in Linear (in Delta) Time.

Leonid Barenboim, Michael Elkin, Fabian Kuhn

SIAM J. Comput., 2014

Combinatorial algorithms for distributed graph coloring.

Leonid Barenboim, Michael Elkin

Distributed Comput., 2014

2013

Distributed Graph Coloring: Fundamentals and Recent Developments

Leonid Barenboim, Michael Elkin

Synthesis Lectures on Distributed Computing Theory, Morgan & Claypool Publishers, ISBN: 978-3-031-02009-4, 2013

Distributed deterministic edge coloring using bounded neighborhood independence.

Leonid Barenboim, Michael Elkin

Distributed Comput., 2013

2012

Fast Distributed Algorithms for Maximal Matching and Maximal Independent Set

Leonid Barenboim, Michael Elkin, Seth Pettie, Johannes Schneider

CoRR, 2012

On the Locality of Some NP-Complete Problems.

Leonid Barenboim

Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

2011

Deterministic Distributed Vertex Coloring in Polylogarithmic Time.

Leonid Barenboim, Michael Elkin

J. ACM, 2011

2010

A review of PODC 2010.

Leonid Barenboim

SIGACT News, 2010

Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition.

Leonid Barenboim, Michael Elkin

Distributed Comput., 2010

2009

Distributed (delta+1)-coloring in linear (in delta) time.

Leonid Barenboim, Michael Elkin

Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009