I am fortunate to advise bright, creative, and fun to work with students thanks to the generous support by the ERC starting grant, the ISF grant, and the Azrieli fellows program.
PhD student, graduated 2023 (co-advised with Amnon Ta-Shma).
Thesis: Error correcting codes and space-bounded derandomization (download thesis). One paper that resulted from this thesis, appeared in CCC 2022, simplifies the (quite complex) STOC 2018 joint paper with Braverman and Garg. A second paper improves the seminal Saks-Zhou algorithm, yielding near-optimal space in the high-power regime for stochastic matrix powering, and more generally for iterated matrix multiplication.
Inbar Ben Yaacov
MSC student, graduated 2022.
Thesis: Improved explicit binary tree codes and conditional asymptotically-good ones (download thesis). One paper that resulted from this thesis improved upon the state-of-the-art tree code constructions, and appeared at STOC 2022. Another paper, that appeared at RANDOM 2021, gives a conditional asymptotically-good tree code.
MSC student, graduated 2020.
Thesis: Rate amplification and query-efficient distance amplification for locally decodable codes (download). The paper that came out of this thesis appeared in CCC 2021. See also a talk I gave at HUJI. Followup papers, which are part of Tal's ongoing PhD thesis, appeared at ICALP 2022 and FOCS 2022.
MSC student (graduated 2020)
If you are a bright, creative graduate student, enthusiastic about theoretical computer science that is looking for an advisor - email me. Make sure to attach your CV and grade sheets (undergraduate and graduate). Generally, I only consider students with undergrad average 95+.
PhD students with a strong track record from top American / European universities: If you are interested in visiting TAU and working together for a period of one to three months, please email me. CV, LoP, and a reference for a recommendation letter are required.
Postdoctoral fellowships are available. Please email me directly for more information.