Tzalik Maimon

According to our database, Tzalik Maimon authored at least 10 papers between 2016 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

RRO: A Regularized Routing Optimization Algorithm for Enhanced Throughput and Low Latency with Efficient Complexity.

David Zenati, Tzalik Maimon, Kobi Cohen

CoRR, 2024

2021

Sleeping Model: Local and Dynamic Algorithms.

Tzalik Maimon

CoRR, 2021

Deterministic Logarithmic Completeness in the Distributed Sleeping Model.

Leonid Barenboim, Tzalik Maimon

Proceedings of the 35th International Symposium on Distributed Computing, 2021

Sampling and Output Estimation in Distributed Algorithms and LCAs.

Leonid Barenboim, Tzalik Maimon

Proceedings of the ICDCN '21: International Conference on Distributed Computing and Networking, 2021

2020

Simple Distributed Spanners in Dense Congest Networks.

Leonid Barenboim, Tzalik Maimon

Proceedings of the SOFSEM 2020: Theory and Practice of Computer Science, 2020

2019

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

2018

Distributed Symmetry Breaking in Graphs with Bounded Diversity.

Leonid Barenboim, Tzalik Maimon

Proceedings of the 2018 IEEE International Parallel and Distributed Processing Symposium, 2018

2017

Deterministic Distributed (Delta + o(Delta))-Edge-Coloring, and Vertex-Coloring of Graphs with Bounded Diversity.

Leonid Barenboim, Michael Elkin, Tzalik Maimon

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2017

Fully-Dynamic Graph Algorithms with Sublinear Time Inspired by Distributed Computing.

Leonid Barenboim, Tzalik Maimon

Proceedings of the International Conference on Computational Science, 2017

2016

Deterministic Distributed (Delta + o(Δ))-Edge-Coloring, and Vertex-Coloring of Graphs with Bounded Diversity.

Leonid Barenboim, Michael Elkin, Tzalik Maimon

CoRR, 2016