Tal Yankovitz

Hello! I am a postdoctoral researcher in Computer Science at UT Austin, where I am hosted by Dana Moshkovitz and David Zuckerman. Before that, I was a Ph.D. student in Computer Science at Tel Aviv University. I was very fortunate to be advised by Gil Cohen. My research interests are within Theoretical Computer Science and include Error Correcting Codes and Complexity Theory.

Publications

Asymptotically good large-alphabet LDCs with polylogarithmic query complexity Tal Yankovitz Manuscript
CHS-alike 1/O(log log n)-rate tree codes from elementary binary shifts Tal Yankovitz Manuscript
A Study of Error Reduction Polynomials Gil Cohen, Dean Doron, Tomer Manket, Edward Pyne, Yichuan Wang, Tal Yankovitz Manuscript
A stronger bound for linear 3-LCC Tal Yankovitz FOCS 2024
Asymptotically-Good RLCCs with (log n)^(2+o(1)) Queries Gil Cohen, Tal Yankovitz CCC 2024
Relaxed Locally Decodable and Correctable Codes: Beyond Tensoring Gil Cohen, Tal Yankovitz FOCS 2022
LCC and LDC: Tailor-Made Distance Amplification and a Refined Separation Gil Cohen, Tal Yankovitz ICALP 2022
Explicit Binary Tree Codes with Sub-Logarithmic Size Alphabet Inbar Ben Yaacov, Gil Cohen, Tal Yankovitz STOC 2022
Rate Amplification and Query-Efficient Distance Amplification for linear LCC and LDC Gil Cohen, Tal Yankovitz CCC 2021

Contact Info

Publications