Deterministic Distributed (Delta + o(Δ))-Edge-Coloring, and Vertex-Coloring of Graphs with Bounded Diversity. - Leonid Barenboim; Michael Elkin; Tzalik Maimon (CoRR, 2016)

Fully-Dynamic Graph Algorithms with Sublinear Time Inspired by Distributed Computing. - Leonid Barenboim; Tzalik Maimon (ICCS, 2017)

Deterministic Distributed (Delta + o(Delta))-Edge-Coloring, and Vertex-Coloring of Graphs with Bounded Diversity. - Leonid Barenboim; Michael Elkin; Tzalik Maimon (PODC, 2017)

Distributed Symmetry Breaking in Graphs with Bounded Diversity. - Leonid Barenboim; Tzalik Maimon (IPDPS, 2018)

Fully Dynamic Graph Algorithms Inspired by Distributed Computing: Deterministic Maximal Matching and Edge Coloring in Sublinear Update-Time. - Leonid Barenboim; Tzalik Maimon (ACM J. Exp. Algorithmics, 2019)

Simple Distributed Spanners in Dense Congest Networks. - Leonid Barenboim; Tzalik Maimon (SOFSEM, 2020)

Deterministic Logarithmic Completeness in the Distributed Sleeping Model. - Leonid Barenboim; Tzalik Maimon (DISC, 2021)

Sleeping Model: Local and Dynamic Algorithms. - Tzalik Maimon (CoRR, 2021)

A Regularized Routing Optimization Approach for Enhanced Throughput and Low Latency with Efficient Complexity in Communication Networks. - David Zenati; Tzalik Maimon; Kobi Cohen (WCNC, 2025)

Sampling and output estimation in distributed algorithms and LCAs. - Leonid Barenboim; Tzalik Maimon (Theor. Comput. Sci., 2025)

Interference in Wireless Networks - A Power Allocation Approach. - Tzalik Maimon; Shirley Alus; Gil Kedar (CoRR, 2025)

RRO: A Regularized Routing Optimization Algorithm for Enhanced Throughput and Low Latency With Efficient Complexity. - David Zenati; Tzalik Maimon; Kobi Cohen (IEEE J. Sel. Areas Commun., 2025)