Leonid Barenboim

Publication Activity (10 Years)

Years Active: 2008-2024
Publications (10 Years): 43

Top Topics

Maximum Matching

Distributed Computation

Top Venues

Publications

Jonathan Giron, Yaron Sela, Leonid Barenboim, Gail Gilboa-Freedman, Yair Amichai-Hamburger
Persona-PhysioSync AV: Personalized Interaction through Personality and Physiology Monitoring in Autonomous Vehicles. Sensors 24 (6) (2024)
Leonid Barenboim, Harel Levin
Secured distributed algorithms without hardness assumptions. J. Parallel Distributed Comput. 171 (2023)
Oleg Zatulovsky, Leonid Barenboim, Rami Drucker, Shai Segal
Poster: Synchronizing Devices with Minimal Data Exchange and Applications for Graph-Based SLAM. sec (2023)
Leonid Barenboim, Uri Goldenberg
Speedup of Distributed Algorithms for Power Graphs in the CONGEST Model. CoRR (2023)
Leonid Barenboim, Michael Elkin, Uri Goldenberg
Locally-iterative Distributed (Δ + 1)-coloring and Applications. J. ACM 69 (1) (2022)
Leonid Barenboim, Rami Drucker, Oleg Zatulovsky, Eli Levi
Memory Allocation for Neural Networks using Graph Coloring. ICDCN (2022)
Leonid Barenboim, Gal Oren
Distributed backup placement. Distributed Comput. 35 (5) (2022)
Leonid Barenboim, Tzalik Maimon
Deterministic Logarithmic Completeness in the Distributed Sleeping Model. DISC (2021)
Leonid Barenboim, Tzalik Maimon
Sampling and Output Estimation in Distributed Algorithms and LCAs. ICDCN (2021)
Leonid Barenboim, Tzalik Maimon
Deterministic Logarithmic Completeness in the Distributed Sleeping Model. CoRR (2021)
Gal Oren, Leonid Barenboim
Distributed Backup K-Placement and Applications to Virtual Memory in Wireless Networks. ICDCN (Adjunct Volume) (2021)
Gal Oren, Leonid Barenboim
Backup Placement in WSNs in the Network Management Distributed Setting. ICDCS Workshops (2021)
Leonid Barenboim, Gal Oren
Distributed Backup Placement in One Round and its Applications to Maximum Matching Approximation and Self-Stabilization. SOSA (2020)
Leonid Barenboim, Gal Oren
Fast Distributed Backup Placement in Sparse and Dense Networks. APOCS (2020)
Leonid Barenboim, Harel Levin
Secured Distributed Algorithms Without Hardness Assumptions. OPODIS (2020)
Gal Oren, Leonid Barenboim
Distributed K-Backup-Placement and Applications to Virtual Memory in Heterogeneous Networks. CoRR (2020)
Leonid Barenboim, Tzalik Maimon
Simple Distributed Spanners in Dense Congest Networks. SOFSEM (2020)
Leonid Barenboim, Harel Levin
Secured Distributed Algorithms without Hardness Assumptions. CoRR (2020)
Leonid Barenboim, Tzalik Maimon
Fully Dynamic Graph Algorithms Inspired by Distributed Computing: Deterministic Maximal Matching and Edge Coloring in Sublinear Update-Time. ACM J. Exp. Algorithmics 24 (1) (2019)
Leonid Barenboim, Gal Oren
Distributed Backup Placement in One Round and its Applications to Maximum Matching Approximation and Self-Stabilization. CoRR (2019)
Leonid Barenboim, Yaniv Tzur
Distributed symmetry-breaking with improved vertex-averaged complexity. ICDCN (2019)
Hadar Sufiev, Yoram Haddad, Leonid Barenboim, José Soler
Dynamic SDN Controller Load Balancing. Future Internet 11 (3) (2019)
Leonid Barenboim, Gal Oren
Fast Distributed Backup Placement in Sparse and Dense Graphs. CoRR (2019)
Leonid Barenboim, Yaniv Tzur
Brief Announcement: Distributed Symmetry-Breaking with Improved Vertex-Averaged Complexity. SPAA (2018)
Leonid Barenboim, Yaniv Tzur
Distributed Symmetry-Breaking with Improved Vertex-Averaged Complexity. CoRR (2018)
Leonid Barenboim, Michael Elkin, Cyril Gavoille
A fast network-decomposition algorithm and its applications to constant-time distributed computation. Theor. Comput. Sci. 751 (2018)
Leonid Barenboim, Victor Khazanov
Distributed Symmetry-Breaking Algorithms for Congested Cliques. CoRR (2018)
Gal Oren, Leonid Barenboim, Harel Levin
Distributed Fault-Tolerant Backup-Placement in Overloaded Wireless Sensor Networks. SYSTOR (2018)
Leonid Barenboim, Tzalik Maimon
Distributed Symmetry Breaking in Graphs with Bounded Diversity. IPDPS (2018)
Gal Oren, Leonid Barenboim, Harel Levin
Distributed Fault-Tolerant Backup-Placement in Overloaded Wireless Sensor Networks. BROADNETS (2018)
Leonid Barenboim, Michael Elkin, Uri Goldenberg
Locally-Iterative Distributed (Δ+ 1): -Coloring below Szegedy-Vishwanathan Barrier, and Applications to Self-Stabilization and to Restricted-Bandwidth Models. PODC (2018)
Leonid Barenboim, Victor Khazanov
Distributed Symmetry-Breaking Algorithms for Congested Cliques. CSR (2018)
Leonid Barenboim, Michael Elkin, Uri Goldenberg
Locally-Iterative Distributed (Delta + 1)-Coloring below Szegedy-Vishwanathan Barrier, and Applications to Self-Stabilization and to Restricted-Bandwidth Models. CoRR (2017)
Gal Oren, Leonid Barenboim, Harel Levin
Adaptive Distributed Hierarchical Sensing Algorithm for Reduction of Wireless Sensor Network Cluster-Heads Energy Consumption. CoRR (2017)
Leonid Barenboim, Michael Elkin, Tzalik Maimon
Deterministic Distributed (Delta + o(Delta))-Edge-Coloring, and Vertex-Coloring of Graphs with Bounded Diversity. PODC (2017)
Leonid Barenboim, Tzalik Maimon
Fully-Dynamic Graph Algorithms with Sublinear Time Inspired by Distributed Computing. ICCS (2017)
Gal Oren, Leonid Barenboim, Harel Levin
Adaptive Distributed Hierarchical Sensing algorithm for reduction of wireless sensor network cluster-heads energy consumption. IWCMC (2017)
Gal Oren, Leonid Barenboim, Harel Levin
Load-Balancing Adaptive Clustering Refinement Algorithm for Wireless Sensor Network Clusters. WWIC (2017)
Leonid Barenboim
Deterministic (Δ + 1)-Coloring in Sublinear (in Δ) Time in Static, Dynamic, and Faulty Networks. J. ACM 63 (5) (2016)
Gal Oren, Leonid Barenboim, Lior Amar
Memory-Aware Management for Multi-Level Main Memory Complex using an Optimization of the Aging Paging Algorithm. SYSTOR (2016)
Leonid Barenboim, Michael Elkin, Tzalik Maimon
Deterministic Distributed (Delta + o(Δ))-Edge-Coloring, and Vertex-Coloring of Graphs with Bounded Diversity. CoRR (2016)
Gal Oren, Leonid Barenboim, Lior Amar
Memory-Aware Management for Heterogeneous Main Memory Using an Optimization of the Aging Paging Algorithm. ICPP Workshops (2016)
Leonid Barenboim, Michael Elkin, Seth Pettie, Johannes Schneider
The Locality of Distributed Symmetry Breaking. J. ACM 63 (3) (2016)
Leonid Barenboim, Michael Elkin, Cyril Gavoille
A Fast Network-Decomposition Algorithm and its Applications to Constant-Time Distributed Computation. CoRR (2015)
Leonid Barenboim, Michael Elkin, Cyril Gavoille
A Fast Network-Decomposition Algorithm and Its Applications to Constant-Time Distributed Computation - (Extended Abstract). SIROCCO (2015)
Leonid Barenboim
Distributed Symmetry: Breaking from a Local Point of View. SIGACT News 46 (4) (2015)
Leonid Barenboim, David Peleg
Nearly Optimal Local Broadcasting in the SINR Model with Feedback. SIROCCO (2015)
Leonid Barenboim
Deterministic (Δ + 1)-Coloring in Sublinear (in Δ) Time in Static, Dynamic and Faulty Networks. PODC (2015)
Leonid Barenboim, Michael Elkin, Fabian Kuhn
Distributed (Delta+1)-Coloring in Linear (in Delta) Time. SIAM J. Comput. 43 (1) (2014)
Leonid Barenboim, Shlomi Dolev, Rafail Ostrovsky
Deterministic and Energy-Optimal Wireless Synchronization. ACM Trans. Sens. Networks 11 (1) (2014)
Leonid Barenboim, Michael Elkin
Combinatorial algorithms for distributed graph coloring. Distributed Comput. 27 (2) (2014)
Leonid Barenboim, Michael Elkin
Distributed deterministic edge coloring using bounded neighborhood independence. Distributed Comput. 26 (5-6) (2013)
Leonid Barenboim
On the Locality of Some NP-Complete Problems. ICALP (2) (2012)
Leonid Barenboim
On the Locality of Some NP-Complete Problems CoRR (2012)
Leonid Barenboim, Michael Elkin, Seth Pettie, Johannes Schneider
The Locality of Distributed Symmetry Breaking. FOCS (2012)
Leonid Barenboim, Michael Elkin, Seth Pettie, Johannes Schneider
Fast Distributed Algorithms for Maximal Matching and Maximal Independent Set CoRR (2012)
Leonid Barenboim, Shlomi Dolev, Rafail Ostrovsky
Deterministic and Energy-Optimal Wireless Synchronization. DISC (2011)
Leonid Barenboim, Michael Elkin
Combinatorial Algorithms for Distributed Graph Coloring. DISC (2011)
Leonid Barenboim, Michael Elkin
Distributed deterministic edge coloring using bounded neighborhood independence. PODC (2011)
Leonid Barenboim, Michael Elkin
Deterministic Distributed Vertex Coloring in Polylogarithmic Time. J. ACM 58 (5) (2011)
Leonid Barenboim, Michael Elkin
Deterministic distributed vertex coloring in polylogarithmic time. PODC (2010)
Leonid Barenboim
A review of PODC 2010. SIGACT News 41 (4) (2010)
Leonid Barenboim, Shlomi Dolev, Rafail Ostrovsky
Deterministic and Energy-Optimal Wireless Synchronization CoRR (2010)
Leonid Barenboim, Michael Elkin
Deterministic Distributed Vertex Coloring in Polylogarithmic Time CoRR (2010)
Leonid Barenboim, Michael Elkin
Distributed Deterministic Edge Coloring using Bounded Neighborhood Independence CoRR (2010)
Leonid Barenboim, Michael Elkin
Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition. Distributed Comput. 22 (5-6) (2010)
Leonid Barenboim, Michael Elkin
Distributed (delta+1)-coloring in linear (in delta) time. STOC (2009)
Leonid Barenboim, Michael Elkin
Sublogarithmic distributed MIS algorithm for sparse graphs using nash-williams decomposition. PODC (2008)
Leonid Barenboim, Michael Elkin
Distributed (Delta + 1)-coloring in linear (in Delta) time CoRR (2008)