Gil Cohen

According to our database, Gil Cohen authored at least 52 papers between 2010 and 2025.

Collaborative distances:

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

2025

Predicting the Bitcoin's price using AI.

Gil Cohen, Avishay Aiche

Frontiers Artif. Intell., 2025

Artificial Intelligence Models for Predicting Stock Returns Using Fundamental, Technical, and Entropy-Based Strategies: A Semantic-Augmented Hybrid Approach.

Gil Cohen, Avishay Aiche, Ron Eichel

Entropy, 2025

The Rate-Immediacy Barrier in Explicit Tree Code Constructions.

Gil Cohen, Leonard J. Schulman, Piyush Srivastava

Electron. Colloquium Comput. Complex., 2025

Derandomized Squaring: An Analytical Insight into Its True Behavior.

Gil Cohen, Itay Cohen, Gal Maor, Yuval Peled

Proceedings of the 16th Innovations in Theoretical Computer Science Conference, 2025

2024

A Study of Error Reduction Polynomials.

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

Electron. Colloquium Comput. Complex., 2024

Tight Bounds for the Zig-Zag Product.

Gil Cohen, Itay Cohen, Gal Maor

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

2023

Random Walks on Rotating Expanders.

Gil Cohen, Gal Maor

Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

Approximating Iterated Multiplication of Stochastic Matrices in Small Space.

Gil Cohen, Dean Doron, Ori Sberlo, Amnon Ta-Shma

Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

Spectral Expanding Expanders.

Gil Cohen, Itay Cohen

Proceedings of the 38th Computational Complexity Conference, 2023

2022

Approximating Large Powers of Stochastic Matrices in Small Space.

Gil Cohen, Dean Doron, Ori Sberlo

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

Expander Random Walks: The General Case and Limitations.

Gil Cohen, Dor Minzer, Shir Peleg, Aaron Potechin, Amnon Ta-Shma

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

The Information Conveyed in a SPAC′s Offering.

Gil Cohen, Mahmoud Qadan

Entropy, 2021

Expander random walks: a Fourier-analytic approach.

Gil Cohen, Noam Peri, Amnon Ta-Shma

Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 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

Error Reduction for Weighted PRGs Against Read Once Branching Programs.

Gil Cohen, Dean Doron, Oren Renard, Ori Sberlo, Amnon Ta-Shma

Proceedings of the 36th Computational Complexity Conference, 2021

Candidate Tree Codes via Pascal Determinant Cubes.

Inbar Ben Yaacov, Gil Cohen, Anand Kumar Narayanan

Proceedings of the Approximation, 2021

2020

Pseudorandom Pseudo-distributions with Near-Optimal Error for Read-Once Branching Programs.

Mark Braverman, Gil Cohen, Sumegha Garg

SIAM J. Comput., 2020

Forecasting Bitcoin Trends Using Algorithmic Learning Systems.

Gil Cohen

Entropy, 2020

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

Gil Cohen, Tal Yankovitz

Electron. Colloquium Comput. Complex., 2020

Seed Protecting Extractors.

Gil Cohen, Dean Doron, Shahar Samocha

Electron. Colloquium Comput. Complex., 2020

Palette-Alternating Tree Codes.

Gil Cohen, Shahar Samocha

Proceedings of the 35th Computational Complexity Conference, 2020

2019

Capacity-Approaching Deterministic Interactive Coding Schemes Against Adversarial Errors.

Gil Cohen, Shahar Samocha

Electron. Colloquium Comput. Complex., 2019

Two-Source Condensers with Low Error and Small Entropy Gap via Entropy-Resilient Functions.

Avraham Ben-Aroya, Gil Cohen, Dean Doron, Amnon Ta-Shma

Proceedings of the Approximation, 2019

2018

Explicit binary tree codes with polylogarithmic size alphabet.

Gil Cohen, Bernhard Haeupler, Leonard J. Schulman

Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

Hitting sets with near-optimal error for read-once branching programs.

Mark Braverman, Gil Cohen, Sumegha Garg

Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

2017

Towards optimal two-source extractors and Ramsey graphs.

Gil Cohen

Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017

2016

Two-Source Extractors for Quasi-Logarithmic Min-Entropy and Improved Privacy Amplification Protocols.

Gil Cohen

Electron. Colloquium Comput. Complex., 2016

Non-Malleable Extractors with Logarithmic Seeds.

Gil Cohen

Electron. Colloquium Comput. Complex., 2016

Two-source dispersers for polylogarithmic entropy and improved ramsey graphs.

Gil Cohen

Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016

The Complexity of DNF of Parities.

Gil Cohen, Igor Shinkar

Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science, 2016

Extractors for Near Logarithmic Min-Entropy.

Gil Cohen, Leonard J. Schulman

Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016

Making the Most of Advice: New Correlation Breakers and Their Applications.

Gil Cohen

Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016

Non-Malleable Extractors - New Tools and Improved Constructions.

Gil Cohen

Proceedings of the 31st Conference on Computational Complexity, 2016

2015

Zero-Fixing Extractors for Sub-Logarithmic Entropy.

Gil Cohen, Igor Shinkar

Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

Local Correlation Breakers and Applications to Three-Source Extractors and Mergers.

Gil Cohen

Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015

Two Structural Results for Low Degree Polynomials and Applications.

Gil Cohen, Avishay Tal

Proceedings of the Approximation, 2015

2014

Nonmalleable Extractors with Short Seeds and Applications to Privacy Amplification.

Gil Cohen, Ran Raz, Gil Segev

SIAM J. Comput., 2014

Bi-Lipschitz Bijection between the Boolean Cube and the Hamming Ball.

Itai Benjamini, Gil Cohen, Igor Shinkar

Proceedings of the 55th IEEE Annual Symposium on Foundations of Computer Science, 2014

Two Sides of the Coin Problem.

Gil Cohen, Anat Ganor, Ran Raz

Proceedings of the Approximation, 2014

2013

Pseudorandom Generators for Low Degree Polynomials from Algebraic Geometry Codes.

Gil Cohen, Amnon Ta-Shma

Electron. Colloquium Comput. Complex., 2013

Efficient Multiparty Protocols via Log-Depth Threshold Formulae.

Gil Cohen, Ivan Bjerre Damgård, Yuval Ishai, Jonas Kölker, Peter Bro Miltersen, Ran Raz, Ron Rothblum

Electron. Colloquium Comput. Complex., 2013

Efficient Multiparty Protocols via Log-Depth Threshold Formulae - (Extended Abstract).

Gil Cohen, Ivan Bjerre Damgård, Yuval Ishai, Jonas Kölker, Peter Bro Miltersen, Ran Raz, Ron D. Rothblum

Proceedings of the Advances in Cryptology - CRYPTO 2013, 2013

On Rigid Matrices and U-polynomials.

Noga Alon, Gil Cohen

Proceedings of the 28th Conference on Computational Complexity, 2013

2012

Gradual Small-Bias Sample Spaces.

Avraham Ben-Aroya, Gil Cohen

Electron. Colloquium Comput. Complex., 2012

On Rigid Matrices and Subspace Polynomials.

Noga Alon, Gil Cohen

Electron. Colloquium Comput. Complex., 2012

On the degree of univariate polynomials over the integers.

Gil Cohen, Amir Shpilka, Avishay Tal

Proceedings of the Innovations in Theoretical Computer Science 2012, 2012

Non-malleable Extractors with Short Seeds and Applications to Privacy Amplification.

Gil Cohen, Ran Raz, Gil Segev

Proceedings of the 27th Conference on Computational Complexity, 2012

2010

On the degree of symmetric functions on the Boolean cube.

Gil Cohen, Amir Shpilka

Electron. Colloquium Comput. Complex., 2010