default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLeonid Barenboim
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j17]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): 1977 (2024)- [c35]Leonid Barenboim, Uri Goldenberg:
Speedup of Distributed Algorithms for Power Graphs in the CONGEST Model. DISC 2024: 6:1-6:23 - 2023
- [j16]Leonid Barenboim, Harel Levin:
Secured distributed algorithms without hardness assumptions. J. Parallel Distributed Comput. 171: 130-140 (2023) - [c34]Oleg Zatulovsky, Leonid Barenboim, Rami Drucker, Shai Segal:
Poster: Synchronizing Devices with Minimal Data Exchange and Applications for Graph-Based SLAM. SEC 2023: 258-260 - [i18]Leonid Barenboim, Uri Goldenberg:
Speedup of Distributed Algorithms for Power Graphs in the CONGEST Model. CoRR abs/2305.04358 (2023) - 2022
- [j15]Leonid Barenboim, Gal Oren:
Distributed backup placement. Distributed Comput. 35(5): 455-473 (2022) - [j14]Leonid Barenboim, Michael Elkin, Uri Goldenberg:
Locally-iterative Distributed (Δ + 1)-coloring and Applications. J. ACM 69(1): 5:1-5:26 (2022) - [c33]Leonid Barenboim, Rami Drucker, Oleg Zatulovsky, Eli Levi:
Memory Allocation for Neural Networks using Graph Coloring. ICDCN 2022: 232-233 - 2021
- [c32]Leonid Barenboim, Tzalik Maimon:
Sampling and Output Estimation in Distributed Algorithms and LCAs. ICDCN 2021: 136-145 - [c31]Gal Oren, Leonid Barenboim:
Distributed Backup K-Placement and Applications to Virtual Memory in Wireless Networks. ICDCN (Adjunct Volume) 2021: 139-144 - [c30]Gal Oren, Leonid Barenboim:
Backup Placement in WSNs in the Network Management Distributed Setting. ICDCS Workshops 2021: 49-54 - [c29]Leonid Barenboim, Tzalik Maimon:
Deterministic Logarithmic Completeness in the Distributed Sleeping Model. DISC 2021: 10:1-10:19 - [i17]Leonid Barenboim, Tzalik Maimon:
Deterministic Logarithmic Completeness in the Distributed Sleeping Model. CoRR abs/2108.01963 (2021) - 2020
- [c28]Leonid Barenboim, Gal Oren:
Fast Distributed Backup Placement in Sparse and Dense Networks. APOCS 2020: 90-104 - [c27]Leonid Barenboim, Harel Levin:
Secured Distributed Algorithms Without Hardness Assumptions. OPODIS 2020: 32:1-32:16 - [c26]Leonid Barenboim, Gal Oren:
Distributed Backup Placement in One Round and its Applications to Maximum Matching Approximation and Self-Stabilization. SOSA 2020: 99-105 - [c25]Leonid Barenboim, Tzalik Maimon:
Simple Distributed Spanners in Dense Congest Networks. SOFSEM 2020: 260-272 - [i16]Gal Oren, Leonid Barenboim:
Distributed K-Backup-Placement and Applications to Virtual Memory in Heterogeneous Networks. CoRR abs/2005.04198 (2020) - [i15]Leonid Barenboim, Harel Levin:
Secured Distributed Algorithms without Hardness Assumptions. CoRR abs/2011.07863 (2020)
2010 – 2019
- 2019
- [j13]Hadar Sufiev, Yoram Haddad, Leonid Barenboim, José Soler:
Dynamic SDN Controller Load Balancing. Future Internet 11(3): 75 (2019) - [j12]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): 1.14:1-1.14:24 (2019) - [c24]Leonid Barenboim, Yaniv Tzur:
Distributed symmetry-breaking with improved vertex-averaged complexity. ICDCN 2019: 31-40 - [i14]Leonid Barenboim, Gal Oren:
Fast Distributed Backup Placement in Sparse and Dense Graphs. CoRR abs/1902.08819 (2019) - [i13]Leonid Barenboim, Gal Oren:
Distributed Backup Placement in One Round and its Applications to Maximum Matching Approximation and Self-Stabilization. CoRR abs/1908.05700 (2019) - 2018
- [j11]Leonid Barenboim, Michael Elkin, Cyril Gavoille:
A fast network-decomposition algorithm and its applications to constant-time distributed computation. Theor. Comput. Sci. 751: 2-23 (2018) - [c23]Gal Oren, Leonid Barenboim, Harel Levin:
Distributed Fault-Tolerant Backup-Placement in Overloaded Wireless Sensor Networks. BROADNETS 2018: 212-224 - [c22]Leonid Barenboim, Victor Khazanov:
Distributed Symmetry-Breaking Algorithms for Congested Cliques. CSR 2018: 41-52 - [c21]Leonid Barenboim, Tzalik Maimon:
Distributed Symmetry Breaking in Graphs with Bounded Diversity. IPDPS 2018: 723-732 - [c20]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: 437-446 - [c19]Leonid Barenboim, Yaniv Tzur:
Brief Announcement: Distributed Symmetry-Breaking with Improved Vertex-Averaged Complexity. SPAA 2018: 223-226 - [c18]Gal Oren, Leonid Barenboim, Harel Levin:
Distributed Fault-Tolerant Backup-Placement in Overloaded Wireless Sensor Networks. SYSTOR 2018: 127 - [i12]Leonid Barenboim, Victor Khazanov:
Distributed Symmetry-Breaking Algorithms for Congested Cliques. CoRR abs/1802.07209 (2018) - [i11]Leonid Barenboim, Yaniv Tzur:
Distributed Symmetry-Breaking with Improved Vertex-Averaged Complexity. CoRR abs/1805.09861 (2018) - 2017
- [c17]Leonid Barenboim, Tzalik Maimon:
Fully-Dynamic Graph Algorithms with Sublinear Time Inspired by Distributed Computing. ICCS 2017: 89-98 - [c16]Gal Oren, Leonid Barenboim, Harel Levin:
Adaptive Distributed Hierarchical Sensing algorithm for reduction of wireless sensor network cluster-heads energy consumption. IWCMC 2017: 980-986 - [c15]Leonid Barenboim, Michael Elkin, Tzalik Maimon:
Deterministic Distributed (Delta + o(Delta))-Edge-Coloring, and Vertex-Coloring of Graphs with Bounded Diversity. PODC 2017: 175-184 - [c14]Gal Oren, Leonid Barenboim, Harel Levin:
Load-Balancing Adaptive Clustering Refinement Algorithm for Wireless Sensor Network Clusters. WWIC 2017: 157-173 - [i10]Gal Oren, Leonid Barenboim, Harel Levin:
Adaptive Distributed Hierarchical Sensing Algorithm for Reduction of Wireless Sensor Network Cluster-Heads Energy Consumption. CoRR abs/1707.07738 (2017) - [i9]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 abs/1712.00285 (2017) - 2016
- [j10]Leonid Barenboim, Michael Elkin, Seth Pettie, Johannes Schneider:
The Locality of Distributed Symmetry Breaking. J. ACM 63(3): 20:1-20:45 (2016) - [j9]Leonid Barenboim:
Deterministic (Δ + 1)-Coloring in Sublinear (in Δ) Time in Static, Dynamic, and Faulty Networks. J. ACM 63(5): 47:1-47:22 (2016) - [c13]Gal Oren, Leonid Barenboim, Lior Amar:
Memory-Aware Management for Heterogeneous Main Memory Using an Optimization of the Aging Paging Algorithm. ICPP Workshops 2016: 98-105 - [c12]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: 25:1 - [i8]Leonid Barenboim, Michael Elkin, Tzalik Maimon:
Deterministic Distributed (Delta + o(Δ))-Edge-Coloring, and Vertex-Coloring of Graphs with Bounded Diversity. CoRR abs/1610.06759 (2016) - 2015
- [j8]Leonid Barenboim:
Distributed Symmetry: Breaking from a Local Point of View. SIGACT News 46(4): 84-87 (2015) - [c11]Leonid Barenboim:
Deterministic (Δ + 1)-Coloring in Sublinear (in Δ) Time in Static, Dynamic and Faulty Networks. PODC 2015: 345-354 - [c10]Leonid Barenboim, David Peleg:
Nearly Optimal Local Broadcasting in the SINR Model with Feedback. SIROCCO 2015: 164-178 - [c9]Leonid Barenboim, Michael Elkin, Cyril Gavoille:
A Fast Network-Decomposition Algorithm and Its Applications to Constant-Time Distributed Computation - (Extended Abstract). SIROCCO 2015: 209-223 - [i7]Leonid Barenboim, Michael Elkin, Cyril Gavoille:
A Fast Network-Decomposition Algorithm and its Applications to Constant-Time Distributed Computation. CoRR abs/1505.05697 (2015) - 2014
- [j7]Leonid Barenboim, Michael Elkin:
Combinatorial algorithms for distributed graph coloring. Distributed Comput. 27(2): 79-93 (2014) - [j6]Leonid Barenboim, Michael Elkin, Fabian Kuhn:
Distributed (Delta+1)-Coloring in Linear (in Delta) Time. SIAM J. Comput. 43(1): 72-95 (2014) - [j5]Leonid Barenboim, Shlomi Dolev, Rafail Ostrovsky:
Deterministic and Energy-Optimal Wireless Synchronization. ACM Trans. Sens. Networks 11(1): 13:1-13:25 (2014) - 2013
- [b1]Leonid Barenboim, Michael Elkin:
Distributed Graph Coloring: Fundamentals and Recent Developments. Synthesis Lectures on Distributed Computing Theory, Morgan & Claypool Publishers 2013, ISBN 9781627050180, pp. 1-171 - [j4]Leonid Barenboim, Michael Elkin:
Distributed deterministic edge coloring using bounded neighborhood independence. Distributed Comput. 26(5-6): 273-287 (2013) - 2012
- [c8]Leonid Barenboim, Michael Elkin, Seth Pettie, Johannes Schneider:
The Locality of Distributed Symmetry Breaking. FOCS 2012: 321-330 - [c7]Leonid Barenboim:
On the Locality of Some NP-Complete Problems. ICALP (2) 2012: 403-415 - [i6]Leonid Barenboim, Michael Elkin, Seth Pettie, Johannes Schneider:
Fast Distributed Algorithms for Maximal Matching and Maximal Independent Set. CoRR abs/1202.1983 (2012) - [i5]Leonid Barenboim:
On the Locality of Some NP-Complete Problems. CoRR abs/1204.6675 (2012) - 2011
- [j3]Leonid Barenboim, Michael Elkin:
Deterministic Distributed Vertex Coloring in Polylogarithmic Time. J. ACM 58(5): 23:1-23:25 (2011) - [c6]Leonid Barenboim, Michael Elkin:
Distributed deterministic edge coloring using bounded neighborhood independence. PODC 2011: 129-138 - [c5]Leonid Barenboim, Michael Elkin:
Combinatorial Algorithms for Distributed Graph Coloring. DISC 2011: 66-81 - [c4]Leonid Barenboim, Shlomi Dolev, Rafail Ostrovsky:
Deterministic and Energy-Optimal Wireless Synchronization. DISC 2011: 237-251 - 2010
- [j2]Leonid Barenboim, Michael Elkin:
Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition. Distributed Comput. 22(5-6): 363-379 (2010) - [j1]Leonid Barenboim:
A review of PODC 2010. SIGACT News 41(4): 100-105 (2010) - [c3]Leonid Barenboim, Michael Elkin:
Deterministic distributed vertex coloring in polylogarithmic time. PODC 2010: 410-419 - [i4]Leonid Barenboim, Michael Elkin:
Deterministic Distributed Vertex Coloring in Polylogarithmic Time. CoRR abs/1003.1608 (2010) - [i3]Leonid Barenboim, Shlomi Dolev, Rafail Ostrovsky:
Deterministic and Energy-Optimal Wireless Synchronization. CoRR abs/1010.1112 (2010) - [i2]Leonid Barenboim, Michael Elkin:
Distributed Deterministic Edge Coloring using Bounded Neighborhood Independence. CoRR abs/1010.2454 (2010)
2000 – 2009
- 2009
- [c2]Leonid Barenboim, Michael Elkin:
Distributed (delta+1)-coloring in linear (in delta) time. STOC 2009: 111-120 - 2008
- [c1]Leonid Barenboim, Michael Elkin:
Sublogarithmic distributed MIS algorithm for sparse graphs using nash-williams decomposition. PODC 2008: 25-34 - [i1]Leonid Barenboim, Michael Elkin:
Distributed (Delta + 1)-coloring in linear (in Delta) time. CoRR abs/0812.1379 (2008)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-25 20:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
