Elad Tzalik

According to our database, Elad Tzalik authored at least 10 papers between 2023 and 2026.

Collaborative distances:

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

2026

Connectivity Labeling in Faulty Colored Graphs.

Asaf Petruschka, Shay Sapir, Elad Tzalik

Distributed Comput., June, 2026

Greedy Completion for Weighted (α,β)-Spanners.

Elad Tzalik

CoRR, March, 2026

Hypercube minor-universality.

Itai Benjamini, Or Bernard Kalifa, Elad Tzalik

Eur. J. Comb., 2026

New Greedy Spanners and Applications.

Elizaveta Popova, Elad Tzalik

Proceedings of the 17th Innovations in Theoretical Computer Science Conference, 2026

2025

Connectivity Certificate against Bounded-Degree Faults: Simpler, Better and Supporting Vertex Faults.

Merav Parter, Elad Tzalik

Proceedings of the 2025 Symposium on Simplicity in Algorithms, 2025

Parks and Recreation: Color Fault-Tolerant Spanners Made Local.

Merav Parter, Asaf Petruschka, Shay Sapir, Elad Tzalik

Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025

2024

Connectivity Labeling in Faulty Colored Graphs.

Asaf Petruschka, Shay Spair, Elad Tzalik

Proceedings of the 38th International Symposium on Distributed Computing, 2024

Color Fault-Tolerant Spanners.

Asaf Petruschka, Shay Sapir, Elad Tzalik

Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024

Are Your Keys Protected? Time Will Tell.

Yoav Ben Dov, Liron David, Moni Naor, Elad Tzalik

Proceedings of the 5th Conference on Information-Theoretic Cryptography, 2024

2023

Resistance to Timing Attacks for Sampling and Privacy Preserving Schemes.

Yoav Ben Dov, Liron David, Moni Naor, Elad Tzalik

Proceedings of the 4th Symposium on Foundations of Responsible Computing, 2023