Randomness Extractors: Constructions and Applications

Publicaciones

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

Autores: Gil Cohen, Talk Yankovitz
Publicado en: 36th Computational Complexity Conference (CCC 2021), 2021
Editor: Schloss Dagstuhl - Leibniz-Zentrum fur Informatik
DOI: 10.4230/lipics.ccc.2021.1

Explicit Binary Tree Codes with Sub-Logarithmic Size Alphabet

Autores: Inbar Ben Yaakov, Gil Cohen, Tal Yankovitz
Publicado en: 2022
Editor: Association for Computing Machinery

Error Reduction for Weighted PRGs Against Read Once Branching Programs

Autores: Gil Cohen, Dean Doron, Oren Renard, Ori Sberlo, Amnon Ta-Shma
Publicado en: 2021
Editor: Schloss Dagstuhl -- Leibniz-Zentrum fur Informatik
DOI: 10.4230/lipics.ccc.2021.22

Approximating Iterated Multiplication of Stochastic Matrices in Small Space

Autores: Gil Cohen, Dean Doron, Ori Sberlo, Amnon Ta-Shma
Publicado en: 55th Annual ACM Symposium on Theory of Computing (STOC 2023), 2023
Editor: ACM

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

Autores: Gil Cohen, Tal Yankovitz
Publicado en: 2022
Editor: Leibniz International Proceedings in Informatics

Relaxed Locally Decodable and Correctable Codes: Beyond Tensoring

Autores: Gil Cohen, Tal Yankovitz
Publicado en: IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS 2022), 2022
Editor: IEEE
DOI: 10.1109/focs54457.2022.00010

Random Walks on Rotating Expanders

Autores: Gil Cohen, Gal Maor
Publicado en: 55th Annual ACM Symposium on Theory of Computing (STOC 2023), 2023
Editor: ACM

Expander Random Walks: The General Case and Limitations

Autores: Gil Cohen, Dor Minzer, Shir Peleg, Aaron Potechin, Amnon Ta-Shma
Publicado en: 2022
Editor: Leibniz International Proceedings in Informatics

Buscando datos de OpenAIRE...

Publicaciones

Compartir esta página

Descargar