Gil Cohen

Publication Activity (10 Years)

Years Active: 2010-2024
Publications (10 Years): 62

Top Topics

Error Reduction

Attribute Efficient Learning

Top Venues

Electron. Colloquium Comput. Complex.

Publications

Gil Cohen, Tal Yankovitz
Asymptotically-Good RLCCs with (log n)^(2+o(1)) Queries. CCC (2024)
Gil Cohen, Dean Doron, Tomer Manket, Edward Pyne, Yichuan Wang, Tal Yankovitz
A Study of Error Reduction Polynomials. Electron. Colloquium Comput. Complex. (2024)
Gil Cohen, Itay Cohen, Gal Maor
Tight Bounds for the Zig-Zag Product. Electron. Colloquium Comput. Complex. (2024)
Gil Cohen, Itay Cohen, Gal Maor, Yuval Peled
Derandomized Squaring: An Analytical Insight into Its True Behavior. Electron. Colloquium Comput. Complex. (2023)
Gil Cohen, Itay Cohen
Spectral Expanding Expanders. CCC (2023)
Gil Cohen, Gal Maor
Random Walks on Rotating Expanders. STOC (2023)
Gil Cohen, Dean Doron, Ori Sberlo, Amnon Ta-Shma
Approximating Iterated Multiplication of Stochastic Matrices in Small Space. STOC (2023)
Gil Cohen, Tal Yankovitz
Asymptotically-Good RLCCs with $(\log{n})^{2+o(1)}$ Queries. Electron. Colloquium Comput. Complex. (2023)
Gil Cohen, Tal Yankovitz
Relaxed Locally Decodable and Correctable Codes: Beyond Tensoring. Electron. Colloquium Comput. Complex. (2022)
Gil Cohen, Tal Yankovitz
LCC and LDC: Tailor-Made Distance Amplification and a Refined Separation. ICALP (2022)
Gil Cohen, Gal Maor
Random Walks on Rotating Expanders. Electron. Colloquium Comput. Complex. (2022)
Inbar Ben Yaacov, Gil Cohen, Tal Yankovitz
Explicit binary tree codes with sub-logarithmic size alphabet. STOC (2022)
Gil Cohen, Dean Doron, Ori Sberlo, Amnon Ta-Shma
Approximating Iterated Multiplication of Stochastic Matrices in Small Space. Electron. Colloquium Comput. Complex. (2022)
Gil Cohen, Tal Yankovitz
Relaxed Locally Decodable and Correctable Codes: Beyond Tensoring. FOCS (2022)
Gil Cohen, Dean Doron, Ori Sberlo
Approximating Large Powers of Stochastic Matrices in Small Space. Electron. Colloquium Comput. Complex. 29 (2022)
Gil Cohen, Itay Cohen
Spectral Expanding Expanders. Electron. Colloquium Comput. Complex. (2022)
Gil Cohen, Dor Minzer, Shir Peleg, Aaron Potechin, Amnon Ta-Shma
Expander Random Walks: The General Case and Limitations. ICALP (2022)
Inbar Ben Yaacov, Gil Cohen, Tal Yankovitz
Explicit Binary Tree Codes with Sub-Logarithmic Size Alphabet. Electron. Colloquium Comput. Complex. 28 (2021)
Inbar Ben Yaacov, Gil Cohen, Anand Kumar Narayanan
Candidate Tree Codes via Pascal Determinant Cubes. APPROX-RANDOM (2021)
Gil Cohen, Mahmoud Qadan
The Information Conveyed in a SPAC′s Offering. Entropy 23 (9) (2021)
Gil Cohen, Tal Yankovitz
LCC and LDC: Tailor-made distance amplification and a refined separation. Electron. Colloquium Comput. Complex. 28 (2021)
Gil Cohen, Dean Doron, Oren Renard, Ori Sberlo, Amnon Ta-Shma
Error Reduction for Weighted PRGs Against Read Once Branching Programs. Computational Complexity Conference (2021)
Gil Cohen
Two-Source Dispersers for Polylogarithmic Entropy and Improved Ramsey Graphs. SIAM J. Comput. 50 (3) (2021)
Gil Cohen, Noam Peri, Amnon Ta-Shma
Expander random walks: a Fourier-analytic approach. STOC (2021)
Gil Cohen, Dean Doron, Oren Renard, Ori Sberlo, Amnon Ta-Shma
Error Reduction For Weighted PRGs Against Read Once Branching Programs. Electron. Colloquium Comput. Complex. 28 (2021)
Gil Cohen, Dor Minzer, Shir Peleg, Aaron Potechin, Amnon Ta-Shma
Expander Random Walks: The General Case and Limitations. Electron. Colloquium Comput. Complex. 28 (2021)
Gil Cohen, Tal Yankovitz
Rate Amplification and Query-Efficient Distance Amplification for Linear LCC and LDC. Computational Complexity Conference (2021)
Gil Cohen
Forecasting Bitcoin Trends Using Algorithmic Learning Systems. Entropy 22 (8) (2020)
Gil Cohen, Dean Doron, Shahar Samocha
Seed Protecting Extractors. Electron. Colloquium Comput. Complex. 27 (2020)
Gil Cohen, Shahar Samocha
Palette-Alternating Tree Codes. Electron. Colloquium Comput. Complex. 27 (2020)
Gil Cohen, Tal Yankovitz
Rate Amplification and Query-Efficient Distance Amplification for Locally Decodable Codes. Electron. Colloquium Comput. Complex. 27 (2020)
Mark Braverman, Gil Cohen, Sumegha Garg
Pseudorandom Pseudo-distributions with Near-Optimal Error for Read-Once Branching Programs. SIAM J. Comput. 49 (5) (2020)
Gil Cohen, Noam Peri, Amnon Ta-Shma
Expander Random Walks: A Fourier-Analytic Approach. Electron. Colloquium Comput. Complex. 27 (2020)
Gil Cohen, Shahar Samocha
Palette-Alternating Tree Codes. Computational Complexity Conference (2020)
Inbar Ben Yaacov, Gil Cohen, Anand Kumar Narayanan
Candidate Tree Codes via Pascal Determinant Cubes. Electron. Colloquium Comput. Complex. 27 (2020)
Avraham Ben-Aroya, Gil Cohen, Dean Doron, Amnon Ta-Shma
Two-Source Condensers with Low Error and Small Entropy Gap via Entropy-Resilient Functions. APPROX-RANDOM (2019)
Gil Cohen, Shahar Samocha
Capacity-Approaching Deterministic Interactive Coding Schemes Against Adversarial Errors. Electron. Colloquium Comput. Complex. 26 (2019)
Gil Cohen, Bernhard Haeupler, Leonard J. Schulman
Explicit Binary Tree Codes with Polylogarithmic Size Alphabet. Electron. Colloquium Comput. Complex. 25 (2018)
Mark Braverman, Gil Cohen, Sumegha Garg
Hitting sets with near-optimal error for read-once branching programs. STOC (2018)
Avraham Ben-Aroya, Gil Cohen, Dean Doron, Amnon Ta-Shma
Two-Source Condensers with Low Error and Small Entropy Gap via Entropy-Resilient Functions. Electron. Colloquium Comput. Complex. 25 (2018)
Gil Cohen, Bernhard Haeupler, Leonard J. Schulman
Explicit binary tree codes with polylogarithmic size alphabet. STOC (2018)
Gil Cohen, Amir Shpilka, Avishay Tal
On the degree of univariate polynomials over the integers. Comb. 37 (3) (2017)
Mark Braverman, Gil Cohen, Sumegha Garg
Hitting Sets with Near-Optimal Error for Read-Once Branching Programs. Electron. Colloquium Comput. Complex. 24 (2017)
Gil Cohen
Towards optimal two-source extractors and Ramsey graphs. STOC (2017)
Gil Cohen
Non-Malleable Extractors - New Tools and Improved Constructions. Computational Complexity Conference (2016)
Gil Cohen, Leonard J. Schulman
Extractors for Near Logarithmic Min-Entropy. Electron. Colloquium Comput. Complex. 23 (2016)
Gil Cohen
Two-source dispersers for polylogarithmic entropy and improved ramsey graphs. STOC (2016)
Gil Cohen, Igor Shinkar
The Complexity of DNF of Parities. ITCS (2016)
Gil Cohen
Local Correlation Breakers and Applications to Three-Source Extractors and Mergers. SIAM J. Comput. 45 (4) (2016)
Gil Cohen
Making the Most of Advice: New Correlation Breakers and Their Applications. FOCS (2016)
Gil Cohen
Non-Malleable Extractors with Logarithmic Seeds. Electron. Colloquium Comput. Complex. 23 (2016)
Gil Cohen, Leonard J. Schulman
Extractors for Near Logarithmic Min-Entropy. FOCS (2016)
Gil Cohen
Two-Source Extractors for Quasi-Logarithmic Min-Entropy and Improved Privacy Amplification Protocols. Electron. Colloquium Comput. Complex. 23 (2016)
Gil Cohen
Making the Most of Advice: New Correlation Breakers and Their Applications. Electron. Colloquium Comput. Complex. 23 (2016)
Gil Cohen
Two-Source Dispersers for Polylogarithmic Entropy and Improved Ramsey Graphs. CoRR (2015)
Noga Alon, Gil Cohen
On Rigid Matrices and U-Polynomials. Comput. Complex. 24 (4) (2015)
Gil Cohen
Two-Source Dispersers for Polylogarithmic Entropy and Improved Ramsey Graphs. Electron. Colloquium Comput. Complex. 22 (2015)
Gil Cohen
Local Correlation Breakers and Applications to Three-Source Extractors and Mergers. Electron. Colloquium Comput. Complex. 22 (2015)
Gil Cohen, Igor Shinkar
Zero-Fixing Extractors for Sub-Logarithmic Entropy. ICALP (1) (2015)
Gil Cohen, Avishay Tal
Two Structural Results for Low Degree Polynomials and Applications. APPROX-RANDOM (2015)
Gil Cohen
Non-Malleable Extractors - New Tools and Improved Constructions. Electron. Colloquium Comput. Complex. 22 (2015)
Gil Cohen
Local Correlation Breakers and Applications to Three-Source Extractors and Mergers. FOCS (2015)
Gil Cohen, Igor Shinkar
The Complexity of DNF of Parities. Electron. Colloquium Comput. Complex. 21 (2014)
Itai Benjamini, Gil Cohen, Igor Shinkar
Bi-Lipschitz Bijection between the Boolean Cube and the Hamming Ball. FOCS (2014)
Gil Cohen, Anat Ganor, Ran Raz
Two Sides of the Coin Problem. APPROX-RANDOM (2014)
Gil Cohen, Ran Raz, Gil Segev
Nonmalleable Extractors with Short Seeds and Applications to Privacy Amplification. SIAM J. Comput. 43 (2) (2014)
Gil Cohen, Anat Ganor, Ran Raz
Two Sides of the Coin Problem. Electron. Colloquium Comput. Complex. 21 (2014)
Gil Cohen, Avishay Tal
Two Structural Results for Low Degree Polynomials and Applications. CoRR (2014)
Gil Cohen, Igor Shinkar
Zero-Fixing Extractors for Sub-Logarithmic Entropy. Electron. Colloquium Comput. Complex. 21 (2014)
Gil Cohen, Ivan Bjerre Damgård, Yuval Ishai, Jonas Kölker, Peter Bro Miltersen, Ran Raz, Ron D. Rothblum
Efficient Multiparty Protocols via Log-Depth Threshold Formulae - (Extended Abstract). CRYPTO (2) (2013)
Gil Cohen, Ivan Bjerre Damgård, Yuval Ishai, Jonas Kölker, Peter Bro Miltersen, Ran Raz, Ron Rothblum
Efficient Multiparty Protocols via Log-Depth Threshold Formulae. Electron. Colloquium Comput. Complex. 20 (2013)
Gil Cohen, Amnon Ta-Shma
Pseudorandom Generators for Low Degree Polynomials from Algebraic Geometry Codes. Electron. Colloquium Comput. Complex. 20 (2013)
Itai Benjamini, Gil Cohen, Igor Shinkar
Bi-Lipschitz Bijection between the Boolean Cube and the Hamming Ball. Electron. Colloquium Comput. Complex. 20 (2013)
Noga Alon, Gil Cohen
On Rigid Matrices and U-polynomials. Computational Complexity Conference (2013)
Gil Cohen, Avishay Tal
Two Structural Results for Low Degree Polynomials and Applications. Electron. Colloquium Comput. Complex. 20 (2013)
Itai Benjamini, Gil Cohen, Igor Shinkar
Bi-Lipschitz Bijection between the Boolean Cube and the Hamming Ball. CoRR (2013)
Gil Cohen, Ivan Bjerre Damgård, Yuval Ishai, Jonas Kölker, Peter Bro Miltersen, Ran Raz, Ron D. Rothblum
Efficient Multiparty Protocols via Log-Depth Threshold Formulae. IACR Cryptol. ePrint Arch. 2013 (2013)
Gil Cohen, Amir Shpilka, Avishay Tal
On the degree of univariate polynomials over the integers. ITCS (2012)
Avraham Ben-Aroya, Gil Cohen
Gradual Small-Bias Sample Spaces. Electron. Colloquium Comput. Complex. 19 (2012)
Gil Cohen, Ran Raz, Gil Segev
Non-malleable Extractors with Short Seeds and Applications to Privacy Amplification. Computational Complexity Conference (2012)
Noga Alon, Gil Cohen
On Rigid Matrices and Subspace Polynomials. Electron. Colloquium Comput. Complex. 19 (2012)
Gil Cohen, Ran Raz, Gil Segev
Non-Malleable Extractors with Short Seeds and Applications to Privacy Amplification. Electron. Colloquium Comput. Complex. 18 (2011)
Gil Cohen, Amir Shpilka, Avishay Tal
On the Degree of Univariate Polynomials Over the Integers. Electron. Colloquium Comput. Complex. 18 (2011)
Gil Cohen, Amir Shpilka
On the degree of symmetric functions on the Boolean cube. Electron. Colloquium Comput. Complex. 17 (2010)