Tal Yankovitz

According to our database, Tal Yankovitz authored at least 8 papers between 2020 and 2024.

Collaborative distances:

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

2024

A Study of Error Reduction Polynomials.

Gil Cohen, Dean Doron, Tomer Manket, Edward Pyne, Yichuan Wang, Tal Yankovitz

Electron. Colloquium Comput. Complex., 2024

A Stronger Bound for Linear 3-LCC.

Tal Yankovitz

Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024

Asymptotically-Good RLCCs with (log n)^(2+o(1)) Queries.

Gil Cohen, Tal Yankovitz

Proceedings of the 39th Computational Complexity Conference, 2024

2022

Explicit binary tree codes with sub-logarithmic size alphabet.

Inbar Ben Yaacov, Gil Cohen, Tal Yankovitz

Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

LCC and LDC: Tailor-Made Distance Amplification and a Refined Separation.

Gil Cohen, Tal Yankovitz

Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

Relaxed Locally Decodable and Correctable Codes: Beyond Tensoring.

Gil Cohen, Tal Yankovitz

Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

2021

Rate Amplification and Query-Efficient Distance Amplification for Linear LCC and LDC.

Gil Cohen, Tal Yankovitz

Proceedings of the 36th Computational Complexity Conference, 2021

2020

Rate Amplification and Query-Efficient Distance Amplification for Locally Decodable Codes.

Gil Cohen, Tal Yankovitz

Electron. Colloquium Comput. Complex., 2020