default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGil Cohen
Person information
Other persons with a similar name
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c32]Gil Cohen, Tal Yankovitz:
Asymptotically-Good RLCCs with (log n)^(2+o(1)) Queries. CCC 2024: 8:1-8:16- [c31]Gil Cohen, Itay Cohen, Gal Maor:
Tight Bounds for the Zig-Zag Product. FOCS 2024: 1470-1499 - [i45]Gil Cohen, Itay Cohen, Gal Maor:
Tight Bounds for the Zig-Zag Product. Electron. Colloquium Comput. Complex. TR24 (2024) - [i44]Gil Cohen, Dean Doron, Tomer Manket, Edward Pyne, Yichuan Wang, Tal Yankovitz:
A Study of Error Reduction Polynomials. Electron. Colloquium Comput. Complex. TR24 (2024) - 2023
- [c30]Gil Cohen, Itay Cohen:
Spectral Expanding Expanders. CCC 2023: 8:1-8:19 - [c29]Gil Cohen, Dean Doron
, Ori Sberlo, Amnon Ta-Shma:
Approximating Iterated Multiplication of Stochastic Matrices in Small Space. STOC 2023: 35-45 - [c28]Gil Cohen, Gal Maor:
Random Walks on Rotating Expanders. STOC 2023: 971-984 - [i43]Gil Cohen, Itay Cohen, Gal Maor, Yuval Peled:
Derandomized Squaring: An Analytical Insight into Its True Behavior. Electron. Colloquium Comput. Complex. TR23 (2023) - [i42]Gil Cohen, Tal Yankovitz:
Asymptotically-Good RLCCs with $(\log{n})^{2+o(1)}$ Queries. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- [c27]Gil Cohen, Tal Yankovitz:
Relaxed Locally Decodable and Correctable Codes: Beyond Tensoring. FOCS 2022: 24-35 - [c26]Gil Cohen, Dor Minzer, Shir Peleg, Aaron Potechin, Amnon Ta-Shma:
Expander Random Walks: The General Case and Limitations. ICALP 2022: 43:1-43:18 - [c25]Gil Cohen, Tal Yankovitz:
LCC and LDC: Tailor-Made Distance Amplification and a Refined Separation. ICALP 2022: 44:1-44:20 - [c24]Inbar Ben Yaacov, Gil Cohen, Tal Yankovitz:
Explicit binary tree codes with sub-logarithmic size alphabet. STOC 2022: 595-608 - [i41]Gil Cohen, Itay Cohen:
Spectral Expanding Expanders. Electron. Colloquium Comput. Complex. TR22 (2022) - [i40]Gil Cohen, Dean Doron, Ori Sberlo:
Approximating Large Powers of Stochastic Matrices in Small Space. Electron. Colloquium Comput. Complex. TR22 (2022) - [i39]Gil Cohen, Dean Doron, Ori Sberlo, Amnon Ta-Shma:
Approximating Iterated Multiplication of Stochastic Matrices in Small Space. Electron. Colloquium Comput. Complex. TR22 (2022) - [i38]Gil Cohen, Gal Maor:
Random Walks on Rotating Expanders. Electron. Colloquium Comput. Complex. TR22 (2022) - [i37]Gil Cohen, Tal Yankovitz:
Relaxed Locally Decodable and Correctable Codes: Beyond Tensoring. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [j8]Gil Cohen, Mahmoud Qadan:
The Information Conveyed in a SPAC′s Offering. Entropy 23(9): 1215 (2021) - [j7]Gil Cohen:
Two-Source Dispersers for Polylogarithmic Entropy and Improved Ramsey Graphs. SIAM J. Comput. 50(3) (2021) - [c23]Inbar Ben Yaacov, Gil Cohen, Anand Kumar Narayanan:
Candidate Tree Codes via Pascal Determinant Cubes. APPROX-RANDOM 2021: 54:1-54:22 - [c22]Gil Cohen, Tal Yankovitz:
Rate Amplification and Query-Efficient Distance Amplification for Linear LCC and LDC. CCC 2021: 1:1-1:57 - [c21]Gil Cohen, Dean Doron, Oren Renard, Ori Sberlo, Amnon Ta-Shma:
Error Reduction for Weighted PRGs Against Read Once Branching Programs. CCC 2021: 22:1-22:17 - [c20]Gil Cohen, Noam Peri, Amnon Ta-Shma:
Expander random walks: a Fourier-analytic approach. STOC 2021: 1643-1655 - [i36]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. TR21 (2021) - [i35]Gil Cohen, Dor Minzer, Shir Peleg, Aaron Potechin, Amnon Ta-Shma:
Expander Random Walks: The General Case and Limitations. Electron. Colloquium Comput. Complex. TR21 (2021) - [i34]Gil Cohen, Tal Yankovitz:
LCC and LDC: Tailor-made distance amplification and a refined separation. Electron. Colloquium Comput. Complex. TR21 (2021) - [i33]Inbar Ben Yaacov, Gil Cohen, Tal Yankovitz:
Explicit Binary Tree Codes with Sub-Logarithmic Size Alphabet. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [j6]Gil Cohen:
Forecasting Bitcoin Trends Using Algorithmic Learning Systems. Entropy 22(8): 838 (2020) - [j5]Mark Braverman, Gil Cohen, Sumegha Garg:
Pseudorandom Pseudo-distributions with Near-Optimal Error for Read-Once Branching Programs. SIAM J. Comput. 49(5) (2020) - [c19]Gil Cohen, Shahar Samocha:
Palette-Alternating Tree Codes. CCC 2020: 11:1-11:29 - [i32]Gil Cohen, Dean Doron, Shahar Samocha:
Seed Protecting Extractors. Electron. Colloquium Comput. Complex. TR20 (2020) - [i31]Gil Cohen, Noam Peri, Amnon Ta-Shma:
Expander Random Walks: A Fourier-Analytic Approach. Electron. Colloquium Comput. Complex. TR20 (2020) - [i30]Gil Cohen, Shahar Samocha:
Palette-Alternating Tree Codes. Electron. Colloquium Comput. Complex. TR20 (2020) - [i29]Gil Cohen, Tal Yankovitz:
Rate Amplification and Query-Efficient Distance Amplification for Locally Decodable Codes. Electron. Colloquium Comput. Complex. TR20 (2020) - [i28]Inbar Ben Yaacov, Gil Cohen, Anand Kumar Narayanan:
Candidate Tree Codes via Pascal Determinant Cubes. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [c18]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: 43:1-43:20 - [i27]Gil Cohen, Shahar Samocha:
Capacity-Approaching Deterministic Interactive Coding Schemes Against Adversarial Errors. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [c17]Mark Braverman, Gil Cohen, Sumegha Garg:
Hitting sets with near-optimal error for read-once branching programs. STOC 2018: 353-362 - [c16]Gil Cohen, Bernhard Haeupler, Leonard J. Schulman:
Explicit binary tree codes with polylogarithmic size alphabet. STOC 2018: 535-544 - [i26]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. TR18 (2018) - [i25]Gil Cohen, Bernhard Haeupler, Leonard J. Schulman:
Explicit Binary Tree Codes with Polylogarithmic Size Alphabet. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [j4]Gil Cohen, Amir Shpilka, Avishay Tal:
On the degree of univariate polynomials over the integers. Comb. 37(3): 419-464 (2017) - [c15]Gil Cohen:
Towards optimal two-source extractors and Ramsey graphs. STOC 2017: 1157-1170 - [i24]Mark Braverman, Gil Cohen, Sumegha Garg:
Hitting Sets with Near-Optimal Error for Read-Once Branching Programs. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [j3]Gil Cohen:
Local Correlation Breakers and Applications to Three-Source Extractors and Mergers. SIAM J. Comput. 45(4): 1297-1338 (2016) - [c14]Gil Cohen:
Non-Malleable Extractors - New Tools and Improved Constructions. CCC 2016: 8:1-8:29 - [c13]Gil Cohen, Leonard J. Schulman:
Extractors for Near Logarithmic Min-Entropy. FOCS 2016: 178-187 - [c12]Gil Cohen:
Making the Most of Advice: New Correlation Breakers and Their Applications. FOCS 2016: 188-196 - [c11]Gil Cohen, Igor Shinkar:
The Complexity of DNF of Parities. ITCS 2016: 47-58 - [c10]Gil Cohen:
Two-source dispersers for polylogarithmic entropy and improved ramsey graphs. STOC 2016: 278-284 - [i23]Gil Cohen:
Non-Malleable Extractors with Logarithmic Seeds. Electron. Colloquium Comput. Complex. TR16 (2016) - [i22]Gil Cohen:
Making the Most of Advice: New Correlation Breakers and Their Applications. Electron. Colloquium Comput. Complex. TR16 (2016) - [i21]Gil Cohen:
Two-Source Extractors for Quasi-Logarithmic Min-Entropy and Improved Privacy Amplification Protocols. Electron. Colloquium Comput. Complex. TR16 (2016) - [i20]Gil Cohen, Leonard J. Schulman:
Extractors for Near Logarithmic Min-Entropy. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [j2]Noga Alon, Gil Cohen:
On Rigid Matrices and U-Polynomials. Comput. Complex. 24(4): 851-879 (2015) - [c9]Gil Cohen, Avishay Tal:
Two Structural Results for Low Degree Polynomials and Applications. APPROX-RANDOM 2015: 680-709 - [c8]Gil Cohen:
Local Correlation Breakers and Applications to Three-Source Extractors and Mergers. FOCS 2015: 845-862 - [c7]Gil Cohen, Igor Shinkar:
Zero-Fixing Extractors for Sub-Logarithmic Entropy. ICALP (1) 2015: 343-354 - [i19]Gil Cohen:
Two-Source Dispersers for Polylogarithmic Entropy and Improved Ramsey Graphs. CoRR abs/1506.04428 (2015) - [i18]Gil Cohen:
Local Correlation Breakers and Applications to Three-Source Extractors and Mergers. Electron. Colloquium Comput. Complex. TR15 (2015) - [i17]Gil Cohen:
Two-Source Dispersers for Polylogarithmic Entropy and Improved Ramsey Graphs. Electron. Colloquium Comput. Complex. TR15 (2015) - [i16]Gil Cohen:
Non-Malleable Extractors - New Tools and Improved Constructions. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [j1]Gil Cohen, Ran Raz, Gil Segev:
Nonmalleable Extractors with Short Seeds and Applications to Privacy Amplification. SIAM J. Comput. 43(2): 450-476 (2014) - [c6]Gil Cohen, Anat Ganor, Ran Raz:
Two Sides of the Coin Problem. APPROX-RANDOM 2014: 618-629 - [c5]Itai Benjamini, Gil Cohen, Igor Shinkar:
Bi-Lipschitz Bijection between the Boolean Cube and the Hamming Ball. FOCS 2014: 81-89 - [i15]Gil Cohen, Avishay Tal:
Two Structural Results for Low Degree Polynomials and Applications. CoRR abs/1404.0654 (2014) - [i14]Gil Cohen, Anat Ganor, Ran Raz:
Two Sides of the Coin Problem. Electron. Colloquium Comput. Complex. TR14 (2014) - [i13]Gil Cohen, Igor Shinkar:
The Complexity of DNF of Parities. Electron. Colloquium Comput. Complex. TR14 (2014) - [i12]Gil Cohen, Igor Shinkar:
Zero-Fixing Extractors for Sub-Logarithmic Entropy. Electron. Colloquium Comput. Complex. TR14 (2014) - 2013
- [c4]Noga Alon, Gil Cohen:
On Rigid Matrices and U-polynomials. CCC 2013: 197-206 - [c3]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: 185-202 - [i11]Itai Benjamini, Gil Cohen, Igor Shinkar:
Bi-Lipschitz Bijection between the Boolean Cube and the Hamming Ball. CoRR abs/1310.2017 (2013) - [i10]Itai Benjamini, Gil Cohen, Igor Shinkar:
Bi-Lipschitz Bijection between the Boolean Cube and the Hamming Ball. Electron. Colloquium Comput. Complex. TR13 (2013) - [i9]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. TR13 (2013) - [i8]Gil Cohen, Avishay Tal:
Two Structural Results for Low Degree Polynomials and Applications. Electron. Colloquium Comput. Complex. TR13 (2013) - [i7]Gil Cohen, Amnon Ta-Shma:
Pseudorandom Generators for Low Degree Polynomials from Algebraic Geometry Codes. Electron. Colloquium Comput. Complex. TR13 (2013) - [i6]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: 480 (2013) - 2012
- [c2]Gil Cohen, Ran Raz, Gil Segev:
Non-malleable Extractors with Short Seeds and Applications to Privacy Amplification. CCC 2012: 298-308 - [c1]Gil Cohen, Amir Shpilka, Avishay Tal:
On the degree of univariate polynomials over the integers. ITCS 2012: 409-427 - [i5]Noga Alon, Gil Cohen:
On Rigid Matrices and Subspace Polynomials. Electron. Colloquium Comput. Complex. TR12 (2012) - [i4]Avraham Ben-Aroya, Gil Cohen:
Gradual Small-Bias Sample Spaces. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [i3]Gil Cohen, Ran Raz, Gil Segev:
Non-Malleable Extractors with Short Seeds and Applications to Privacy Amplification. Electron. Colloquium Comput. Complex. TR11 (2011) - [i2]Gil Cohen, Amir Shpilka, Avishay Tal:
On the Degree of Univariate Polynomials Over the Integers. Electron. Colloquium Comput. Complex. TR11 (2011) - 2010
- [i1]Gil Cohen, Amir Shpilka:
On the degree of symmetric functions on the Boolean cube. Electron. Colloquium Comput. Complex. TR10 (2010)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 20:51 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
