Leonid Barenboim

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