Leonid Barenboim, Gal Oren: Distributed Backup Placement in One Round and its Applications to Maximum Matching Approximation and Self-Stabilization, SOSA 2020, Salt Lake City, UT, USA
Leonid Barenboim, Yaniv Tzur. Distributed symmetry-breaking with improved vertex-averaged complexity, ICDCN 2019, Bangalore, India
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, Egham, United Kingdom
PODC 2018 Best Paper Award:
Leonid Barenboim, Michael Elkin, Tzalik Maimon: Leonid Barenboim, Michael Elkin, Tzalik Maimon: Deterministic Distributed (Delta + o(Delta))-Edge-Coloring, and Vertex-Coloring of Graphs with Bounded Diversity. PODC 2017, Washington, DC, USA
Leonid Barenboim: Deterministic (Δ + 1)-Coloring in Sublinear (in Δ) Time in Static, Dynamic and Faulty Networks. PODC 2015. Donostia-San Sebastián, Spain
PODC 2015 Best Paper Award:
Leonid Barenboim and David Peleg: Nearly Optimal Local Broadcasting in the SINR Model with Feedback. SIROCCO 2015. Montserrat, Spain
Leonid Barenboim, Michael Elkin, Seth Pettie, and Johannes Schneider. The Locality of Distributed Symmetry Breaking. In proc. of the Symposium on Foundations of Computer Science, FOCS 2012, New Brunswick, NJ, USA
Leonid Barenboim. On the Locality of Some NP-Complete Problems. In proc. of the International Colloquium on Automata, Languages and Programming, ICALP 2012, Warwick, UK
ICALP 2012 Best Student Paper Award. (Track C.):
Leonid Barenboim, Shlomi Dolev and Rafail Ostrovsky. Deterministic and Energy-Optimal Wireless Synchronization. In proc. of the International Symposium on Distributed Computing, Disc 2011, Rome, Italy
Leonid Barenboim and Michael Elkin. Combinatorial Algorithms for Distributed Graph Coloring. In proc. of the International Symposium on Distributed Computing, Disc 2011, Rome, Italy
Leonid Barenboim and Michael Elkin. Distributed Deterministic Edge Coloring using Bounded Neighborhood Independence. In proc. of the Symposium on the Principles of Distributed Computing, PODC 2011, San Jose, California, USA
PODC 2011 Best Student Paper Award:
Leonid Barenboim and Michael Elkin. Deterministic Distributed Vertex Coloring in Polylogarithmic Time. In proc. of the Symposium on the Principles of Distributed Computing, PODC 2010, Zurich, Switzerland
PODC 2010 Best Paper Award:
Leonid Barenboim and Michael Elkin. Distributed (Delta + 1)-coloring in linear (in Delta) time. In proc. of the Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA
Leonid Barenboim and Michael Elkin. Sublogarithmic Distributed MIS Algorithm for Sparse Graphs using Nash-Williams Decomposition. In proc. of the Symposium on the Principles of Distributed Computing, PODC 2008, Toronto, Canada