Leonid Barenboim
Orcid: 0000-0002-9021-3549
According to our database1,
Leonid Barenboim
authored at least 49 papers
between 2009 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
Persona-PhysioSync AV: Personalized Interaction through Personality and Physiology Monitoring in Autonomous Vehicles.
Sensors, March, 2024
Proceedings of the 38th International Symposium on Distributed Computing, 2024
2023
J. Parallel Distributed Comput., January, 2023
Poster: Synchronizing Devices with Minimal Data Exchange and Applications for Graph-Based SLAM.
Proceedings of the IEEE/ACM Symposium on Edge Computing, 2023
2022
Proceedings of the ICDCN '22: 23rd International Conference on Distributed Computing and Networking, Delhi, AA, India, January 4, 2022
2021
Proceedings of the 35th International Symposium on Distributed Computing, 2021
Proceedings of the 41st IEEE International Conference on Distributed Computing Systems Workshops, 2021
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.
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.
CoRR, 2020
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.
Proceedings of the 3rd Symposium on Simplicity in Algorithms, 2020
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.
ACM J. Exp. Algorithmics, 2019
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.
Theor. Comput. Sci., 2018
Brief Announcement: Distributed Symmetry-Breaking with Improved Vertex-Averaged Complexity.
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.
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018
Proceedings of the 2018 IEEE International Parallel and Distributed Processing Symposium, 2018
Proceedings of the Computer Science - Theory and Applications, 2018
Proceedings of the Broadband Communications, Networks, and Systems, 2018
2017
Locally-Iterative Distributed (Delta + 1)-Coloring below Szegedy-Vishwanathan Barrier, and Applications to Self-Stabilization and to Restricted-Bandwidth Models.
CoRR, 2017
Load-Balancing Adaptive Clustering Refinement Algorithm for Wireless Sensor Network Clusters.
Proceedings of the Wired/Wireless Internet Communications, 2017
Deterministic Distributed (Delta + o(Delta))-Edge-Coloring, and Vertex-Coloring of Graphs with Bounded Diversity.
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.
Proceedings of the 13th International Wireless Communications and Mobile Computing Conference, 2017
Fully-Dynamic Graph Algorithms with Sublinear Time Inspired by Distributed Computing.
Proceedings of the International Conference on Computational Science, 2017
2016
Deterministic (Δ + 1)-Coloring in Sublinear (in Δ) Time in Static, Dynamic, and Faulty Networks.
J. ACM, 2016
Deterministic Distributed (Delta + o(Δ))-Edge-Coloring, and Vertex-Coloring of Graphs with Bounded Diversity.
CoRR, 2016
Memory-Aware Management for Multi-Level Main Memory Complex using an Optimization of the Aging Paging Algorithm.
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.
Proceedings of the 45th International Conference on Parallel Processing Workshops, 2016
2015
Proceedings of the Structural Information and Communication Complexity, 2015
A Fast Network-Decomposition Algorithm and Its Applications to Constant-Time Distributed Computation - (Extended Abstract).
Proceedings of the Structural Information and Communication Complexity, 2015
2014
ACM Trans. Sens. Networks, 2014
2013
Synthesis Lectures on Distributed Computing Theory, Morgan & Claypool Publishers, ISBN: 978-3-031-02009-4, 2013
Distributed Comput., 2013
2012
CoRR, 2012
Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012
2011
2010
Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition.
Distributed Comput., 2010
2009
Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009