Elad Tzalik
PhD Student | Weizmann Institute of Science
About
I am a PhD student at the Mathematics Department at the Weizmann Institute of Science, where I am very fortunate to be advised by Prof. Itai Benjamini. My research is supported by the ADAMS Fellowship.
I am intrigued by extremal questions on discrete structures such as graphs and simplicial complexes, and their relation to the design and analysis of algorithms. My interests span Algorithms, Combinatorics, and High Dimensional Combinatorics and Geometry.
Publications
-
The Structure of Cycles in Projective Geometry over 𝔽q
with Ran Tessler
[arXiv] (submitted) -
Greedy Completion for Weighted (α,β)-Spanners
Best student paper.
[arXiv][ESA'26] -
New Greedy Spanners and Applications
with Elizaveta Popova
[arXiv][ITCS'26] -
Hypercube Minor-Universality
with Itai Benjamini and Or Kalifa
[arXiv][European Journal of Combinatorics] -
Connectivity Certificate against Bounded-Degree Faults: Simpler, Better and Supporting Vertex Faults
with Merav Parter
[arXiv][SOSA'25] -
Parks and Recreation: Color Fault-Tolerant Spanners Made Local
with Merav Parter, Asaf Petruschka, and Shay Sapir
[arXiv][SODA'25] -
Are Your Keys Protected? Time Will Tell
with Yoav Ben Dov, Liron David, and Moni Naor
[ePrint][ITC'24] -
Connectivity Labeling in Faulty Colored Graphs
with Asaf Petruschka and Shay Sapir
[arXiv][DISC'24] -
Color Fault-Tolerant Spanners
with Asaf Petruschka and Shay Sapir
[arXiv][ITCS'24] -
Resistance to Timing Attacks for Sampling and Privacy Preserving Schemes
Best student paper.
with Yoav Ben Dov, Liron David, and Moni Naor
[FORC'23] -
The Number of Tiles of ℤd
with Itai Benjamini and Gady Kozma
[arXiv][Electronic Journal of Combinatorics] -
Determining a Points Configuration on the Line from a Subset of the Pairwise Distances
with Itai Benjamini
[arXiv] (submitted) -
On the Number of Shortest Paths in Graphs
with Itai Benjamini
[arXiv] (not intended for publication)
Contact
Feel free to reach out—I'd love to hear from you!
- tzalikemail at gmail dot com