Tzalik Maimon

16 papers A* 2A 2B 2Misc 2Journal 8
YearRankTypeTitle / Venue / Authors
2026 A* conf
Peeling Rotten Potatoes for a Faster Approximation of Convex Cover.
SODA
Omrit Filtser, Tzalik Maimon, Ofir Yomtovyan
2025 B conf
A Regularized Routing Optimization Approach for Enhanced Throughput and Low Latency with Efficient Complexity in Communication Networks.
WCNC
David Zenati, Tzalik Maimon, Kobi Cohen
2025 J jnl
Interference in Wireless Networks - A Power Allocation Approach.
CoRR
Tzalik Maimon, Shirley Alus, Gil Kedar
2025 J jnl
RRO: A Regularized Routing Optimization Algorithm for Enhanced Throughput and Low Latency With Efficient Complexity.
IEEE J. Sel. Areas Commun.
David Zenati, Tzalik Maimon, Kobi Cohen
2025 J jnl
Sampling and output estimation in distributed algorithms and LCAs.
Theor. Comput. Sci.
Leonid Barenboim, Tzalik Maimon
2024 J jnl
RRO: A Regularized Routing Optimization Algorithm for Enhanced Throughput and Low Latency with Efficient Complexity.
CoRR
David Zenati, Tzalik Maimon, Kobi Cohen
2021 A conf
Deterministic Logarithmic Completeness in the Distributed Sleeping Model.
DISC
Leonid Barenboim, Tzalik Maimon
2021 J jnl
Deterministic Logarithmic Completeness in the Distributed Sleeping Model.
CoRR
Leonid Barenboim, Tzalik Maimon
2021 Misc conf
Sampling and Output Estimation in Distributed Algorithms and LCAs.
ICDCN
Leonid Barenboim, Tzalik Maimon
2021 J jnl
Sleeping Model: Local and Dynamic Algorithms.
CoRR
Tzalik Maimon
2020 B conf
Simple Distributed Spanners in Dense Congest Networks.
SOFSEM
Leonid Barenboim, Tzalik Maimon
2019 J jnl
Fully Dynamic Graph Algorithms Inspired by Distributed Computing: Deterministic Maximal Matching and Edge Coloring in Sublinear Update-Time.
ACM J. Exp. Algorithmics
Leonid Barenboim, Tzalik Maimon
2018 A conf
Distributed Symmetry Breaking in Graphs with Bounded Diversity.
IPDPS
Leonid Barenboim, Tzalik Maimon
2017 A* conf
Deterministic Distributed (Delta + o(Delta))-Edge-Coloring, and Vertex-Coloring of Graphs with Bounded Diversity.
PODC
Leonid Barenboim, Michael Elkin, Tzalik Maimon
2017 Misc conf
Fully-Dynamic Graph Algorithms with Sublinear Time Inspired by Distributed Computing.
ICCS
Leonid Barenboim, Tzalik Maimon
2016 J jnl
Deterministic Distributed (Delta + o(Δ))-Edge-Coloring, and Vertex-Coloring of Graphs with Bounded Diversity.
CoRR
Leonid Barenboim, Michael Elkin, Tzalik Maimon