Gil Cohen

Orcid: 0000-0003-2409-2192

According to our database1, Gil Cohen authored at least 49 papers between 2010 and 2024.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
A Study of Error Reduction Polynomials.
Electron. Colloquium Comput. Complex., 2024

Tight Bounds for the Zig-Zag Product.
Electron. Colloquium Comput. Complex., 2024

2023
Asymptotically-Good RLCCs with $(\log{n})^{2+o(1)}$ Queries.
Electron. Colloquium Comput. Complex., 2023

Derandomized Squaring: An Analytical Insight into Its True Behavior.
Electron. Colloquium Comput. Complex., 2023

2022
Relaxed Locally Decodable and Correctable Codes: Beyond Tensoring.
Electron. Colloquium Comput. Complex., 2022

Random Walks on Rotating Expanders.
Electron. Colloquium Comput. Complex., 2022

Approximating Iterated Multiplication of Stochastic Matrices in Small Space.
Electron. Colloquium Comput. Complex., 2022

Approximating Large Powers of Stochastic Matrices in Small Space.
Electron. Colloquium Comput. Complex., 2022

Spectral Expanding Expanders.
Electron. Colloquium Comput. Complex., 2022

2021
Two-Source Dispersers for Polylogarithmic Entropy and Improved Ramsey Graphs.
SIAM J. Comput., 2021

The Information Conveyed in a SPAC′s Offering.
Entropy, 2021

Explicit Binary Tree Codes with Sub-Logarithmic Size Alphabet.
Electron. Colloquium Comput. Complex., 2021

LCC and LDC: Tailor-made distance amplification and a refined separation.
Electron. Colloquium Comput. Complex., 2021

Expander Random Walks: The General Case and Limitations.
Electron. Colloquium Comput. Complex., 2021

Error Reduction For Weighted PRGs Against Read Once Branching Programs.
Electron. Colloquium Comput. Complex., 2021

Rate Amplification and Query-Efficient Distance Amplification for Linear LCC and LDC.
Proceedings of the 36th Computational Complexity Conference, 2021

2020
Pseudorandom Pseudo-distributions with Near-Optimal Error for Read-Once Branching Programs.
SIAM J. Comput., 2020

Forecasting Bitcoin Trends Using Algorithmic Learning Systems.
Entropy, 2020

Candidate Tree Codes via Pascal Determinant Cubes.
Electron. Colloquium Comput. Complex., 2020

Rate Amplification and Query-Efficient Distance Amplification for Locally Decodable Codes.
Electron. Colloquium Comput. Complex., 2020

Palette-Alternating Tree Codes.
Electron. Colloquium Comput. Complex., 2020

Expander Random Walks: A Fourier-Analytic Approach.
Electron. Colloquium Comput. Complex., 2020

Seed Protecting Extractors.
Electron. Colloquium Comput. Complex., 2020

2019
Capacity-Approaching Deterministic Interactive Coding Schemes Against Adversarial Errors.
Electron. Colloquium Comput. Complex., 2019

2018
Explicit Binary Tree Codes with Polylogarithmic Size Alphabet.
Electron. Colloquium Comput. Complex., 2018

Two-Source Condensers with Low Error and Small Entropy Gap via Entropy-Resilient Functions.
Electron. Colloquium Comput. Complex., 2018

2017
Hitting Sets with Near-Optimal Error for Read-Once Branching Programs.
Electron. Colloquium Comput. Complex., 2017

Towards optimal two-source extractors and Ramsey graphs.
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017

2016
Local Correlation Breakers and Applications to Three-Source Extractors and Mergers.
SIAM J. Comput., 2016

Extractors for Near Logarithmic Min-Entropy.
Electron. Colloquium Comput. Complex., 2016

Two-Source Extractors for Quasi-Logarithmic Min-Entropy and Improved Privacy Amplification Protocols.
Electron. Colloquium Comput. Complex., 2016

Making the Most of Advice: New Correlation Breakers and Their Applications.
Electron. Colloquium Comput. Complex., 2016

Non-Malleable Extractors with Logarithmic Seeds.
Electron. Colloquium Comput. Complex., 2016

2015
Non-Malleable Extractors - New Tools and Improved Constructions.
Electron. Colloquium Comput. Complex., 2015

On Rigid Matrices and U-Polynomials.
Comput. Complex., 2015

2014
Nonmalleable Extractors with Short Seeds and Applications to Privacy Amplification.
SIAM J. Comput., 2014

Zero-Fixing Extractors for Sub-Logarithmic Entropy.
Electron. Colloquium Comput. Complex., 2014

The Complexity of DNF of Parities.
Electron. Colloquium Comput. Complex., 2014

Two Sides of the Coin Problem.
Electron. Colloquium Comput. Complex., 2014

2013
Pseudorandom Generators for Low Degree Polynomials from Algebraic Geometry Codes.
Electron. Colloquium Comput. Complex., 2013

Two Structural Results for Low Degree Polynomials and Applications.
Electron. Colloquium Comput. Complex., 2013

Efficient Multiparty Protocols via Log-Depth Threshold Formulae.
Electron. Colloquium Comput. Complex., 2013

Bi-Lipschitz Bijection between the Boolean Cube and the Hamming Ball.
Electron. Colloquium Comput. Complex., 2013

Efficient Multiparty Protocols via Log-Depth Threshold Formulae - (Extended Abstract).
Proceedings of the Advances in Cryptology - CRYPTO 2013, 2013

2012
Gradual Small-Bias Sample Spaces.
Electron. Colloquium Comput. Complex., 2012

On Rigid Matrices and Subspace Polynomials.
Electron. Colloquium Comput. Complex., 2012

2011
On the Degree of Univariate Polynomials Over the Integers.
Electron. Colloquium Comput. Complex., 2011

Non-Malleable Extractors with Short Seeds and Applications to Privacy Amplification.
Electron. Colloquium Comput. Complex., 2011

2010
On the degree of symmetric functions on the Boolean cube.
Electron. Colloquium Comput. Complex., 2010


  Loading...