Tal Yankovitz

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

Collaborative distances:

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

2024

A stronger bound for linear 3-LCC.

Tal Yankovitz

Electron. Colloquium Comput. Complex., 2024

2023

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

Gil Cohen, Tal Yankovitz

Electron. Colloquium Comput. Complex., 2023

2022

Relaxed Locally Decodable and Correctable Codes: Beyond Tensoring.

Gil Cohen, Tal Yankovitz

Electron. Colloquium Comput. Complex., 2022

2021

Explicit Binary Tree Codes with Sub-Logarithmic Size Alphabet.

Inbar Ben Yaacov, Gil Cohen, Tal Yankovitz

Electron. Colloquium Comput. Complex., 2021

LCC and LDC: Tailor-made distance amplification and a refined separation.

Gil Cohen, Tal Yankovitz

Electron. Colloquium Comput. Complex., 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