Randomness Extractors: Constructions and Applications

Publications

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

Author(s): Gil Cohen, Talk Yankovitz
Published in: 36th Computational Complexity Conference (CCC 2021), 2021
Publisher: Schloss Dagstuhl - Leibniz-Zentrum fur Informatik
DOI: 10.4230/lipics.ccc.2021.1

Explicit Binary Tree Codes with Sub-Logarithmic Size Alphabet

Author(s): Inbar Ben Yaakov, Gil Cohen, Tal Yankovitz
Published in: 2022
Publisher: Association for Computing Machinery

Error Reduction for Weighted PRGs Against Read Once Branching Programs

Author(s): Gil Cohen, Dean Doron, Oren Renard, Ori Sberlo, Amnon Ta-Shma
Published in: 2021
Publisher: Schloss Dagstuhl -- Leibniz-Zentrum fur Informatik
DOI: 10.4230/lipics.ccc.2021.22

Approximating Iterated Multiplication of Stochastic Matrices in Small Space

Author(s): Gil Cohen, Dean Doron, Ori Sberlo, Amnon Ta-Shma
Published in: 55th Annual ACM Symposium on Theory of Computing (STOC 2023), 2023
Publisher: ACM

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

Author(s): Gil Cohen, Tal Yankovitz
Published in: 2022
Publisher: Leibniz International Proceedings in Informatics

Relaxed Locally Decodable and Correctable Codes: Beyond Tensoring

Author(s): Gil Cohen, Tal Yankovitz
Published in: IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS 2022), 2022
Publisher: IEEE
DOI: 10.1109/focs54457.2022.00010

Random Walks on Rotating Expanders

Author(s): Gil Cohen, Gal Maor
Published in: 55th Annual ACM Symposium on Theory of Computing (STOC 2023), 2023
Publisher: ACM

Expander Random Walks: The General Case and Limitations

Author(s): Gil Cohen, Dor Minzer, Shir Peleg, Aaron Potechin, Amnon Ta-Shma
Published in: 2022
Publisher: Leibniz International Proceedings in Informatics

Searching for OpenAIRE data...

Publications

Share this page

Download