default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRoei Tell
Person information
- affiliation: University of Toronto, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[c23]Marshall Ball, Lijie Chen, Roei Tell:
Towards Free Lunch Derandomization from Necessary Assumptions (And OWFs). CCC 2025: 31:1-31:20- [c22]Lijie Chen
, Ron D. Rothblum, Roei Tell:
Fiat-Shamir in the Plain Model from Derandomization (Or: Do Efficient Algorithms Believe that NP = PSPACE?). STOC 2025: 977-985 - [c21]Robert Andrews, Deepanshu Kush, Roei Tell:
Polynomial-Time PIT from (Almost) Necessary Assumptions. STOC 2025: 1087-1095 - [c20]Dean Doron, Edward Pyne, Roei Tell, R. Ryan Williams:
When Connectivity Is Hard, Random Walks Are Easy with Non-determinism. STOC 2025: 1108-1117 - [i34]Robert Andrews, Deepanshu Kush, Roei Tell:
Polynomial-Time PIT from (Almost) Necessary Assumptions. CoRR abs/2504.06044 (2025) - [i33]Oded Goldreich, Roei Tell:
Complexity theoretic implications of pseudodeterministic algorithms for PPT-search problems. Electron. Colloquium Comput. Complex. TR25: Article TR25-011 (2025) - [i32]Robert Andrews, Deepanshu Kush, Roei Tell:
Polynomial-Time PIT from (Almost) Necessary Assumptions. Electron. Colloquium Comput. Complex. TR25: Article TR25-042 (2025) - [i31]Marshall Ball, Lijie Chen, Roei Tell:
Towards Free Lunch Derandomization from Necessary Assumptions (and OWFs). Electron. Colloquium Comput. Complex. TR25: Article TR25-010 (2025) - [i30]Dean Doron, Edward Pyne, Roei Tell, Ryan Williams:
When Connectivity Is Hard, Random Walks Are Easy With Non-Determinism. Electron. Colloquium Comput. Complex. TR25: Article TR25-077 (2025) - [i29]Edward Pyne, Roei Tell:
Composing Low-Space Algorithms. Electron. Colloquium Comput. Complex. TR25: Article TR25-140 (2025) - 2024
- [c19]Jiatu Li, Edward Pyne, Roei Tell:
Distinguishing, Predicting, and Certifying: On the Long Reach of Partial Notions of Pseudorandomness. FOCS 2024: 1-13 - [c18]Dean Doron, Edward Pyne, Roei Tell:
Opening Up the Distinguisher: A Hardness to Randomness Approach for BPL=L That Uses Properties of BPL. STOC 2024: 2039-2049 - [i28]Lijie Chen, Ron D. Rothblum, Roei Tell:
Fiat-Shamir in the Plain Model from Derandomization (Or: Do Efficient Algorithms Believe that NP = PSPACE?). Electron. Colloquium Comput. Complex. TR24: Article TR24-116 (2024) - [i27]Jiatu Li, Edward Pyne, Roei Tell:
Distinguishing, Predicting, and Certifying: On the Long Reach of Partial Notions of Pseudorandomness. Electron. Colloquium Comput. Complex. TR24: Article TR24-139 (2024) - [i26]Roei Tell:
On defining PPT-search problems and PPT-optimization problems. Electron. Colloquium Comput. Complex. TR24: Article TR24-163 (2024) - 2023
- [j8]Lijie Chen, Ron D. Rothblum, Roei Tell, Eylon Yogev:
On Exponential-time Hypotheses, Derandomization, and Circuit Lower Bounds. J. ACM 70(4): 25:1-25:62 (2023) - [j7]Lijie Chen, Roei Tell:
Guest Column: New ways of studying the BPP = P conjecture. SIGACT News 54(2): 44-69 (2023) - [c17]Dean Doron, Roei Tell:
Derandomization with Minimal Memory Footprint. CCC 2023: 11:1-11:15 - [c16]Lijie Chen, Roei Tell, Ryan Williams:
Derandomization vs Refutation: A Unified Framework for Characterizing Derandomization. FOCS 2023: 1008-1047 - [c15]Lijie Chen, Roei Tell:
When Arthur Has Neither Random Coins Nor Time to Spare: Superfast Derandomization of Proof Systems. STOC 2023: 60-69 - [c14]Pooya Hatami, William M. Hoza, Avishay Tal, Roei Tell:
Depth-d Threshold Circuits vs. Depth-(d+1) AND-OR Trees. STOC 2023: 895-904 - [i25]Lijie Chen, Roei Tell, Ryan Williams:
Derandomization vs Refutation: A Unified Framework for Characterizing Derandomization. Electron. Colloquium Comput. Complex. TR23: Article TR23-105 (2023) - [i24]Lijie Chen, Roei Tell:
New ways of studying the BPP = P conjecture. Electron. Colloquium Comput. Complex. TR23: Article TR23-094 (2023) - [i23]Dean Doron, Edward Pyne, Roei Tell:
Opening Up the Distinguisher: A Hardness to Randomness Approach for BPL = L that Uses Properties of BPL. Electron. Colloquium Comput. Complex. TR23: Article TR23-208 (2023) - [i22]Dean Doron, Roei Tell:
Derandomization with Minimal Memory Footprint. Electron. Colloquium Comput. Complex. TR23: Article TR23-036 (2023) - 2022
- [j6]Igor C. Oliveira, Rahul Santhanam, Roei Tell:
Expander-Based Cryptography Meets Natural Proofs. Comput. Complex. 31(1): 4 (2022) - [j5]Dean Doron, Amnon Ta-Shma, Roei Tell:
On Hitting-Set Generators for Polynomials that Vanish Rarely. Comput. Complex. 31(2): 16 (2022) - [j4]Roei Tell:
Quantified Derandomization: How to Find Water in the Ocean. Found. Trends Theor. Comput. Sci. 15(1): 1-125 (2022) - [c13]Lijie Chen, Ron D. Rothblum, Roei Tell:
Unstructured Hardness to Average-Case Randomness. FOCS 2022: 429-437 - [i21]Lijie Chen, Ron D. Rothblum, Roei Tell:
Unstructured Hardness to Average-Case Randomness. Electron. Colloquium Comput. Complex. TR22: Article TR22-097 (2022) - [i20]Lijie Chen, Roei Tell:
When Arthur has Neither Random Coins nor Time to Spare: Superfast Derandomization of Proof Systems. Electron. Colloquium Comput. Complex. TR22: Article TR22-057 (2022) - [i19]Pooya Hatami, William Hoza, Avishay Tal, Roei Tell:
Depth-d Threshold Circuits vs. Depth-(d + 1) AND-OR Trees. Electron. Colloquium Comput. Complex. TR22: Article TR22-087 (2022) - 2021
- [c12]Pooya Hatami, William M. Hoza, Avishay Tal, Roei Tell:
Fooling Constant-Depth Threshold Circuits (Extended Abstract). FOCS 2021: 104-115 - [c11]Lijie Chen, Roei Tell:
Hardness vs Randomness, Revised: Uniform, Non-Black-Box, and Instance-Wise. FOCS 2021: 125-136 - [c10]Lijie Chen, Roei Tell:
Simple and fast derandomization from very hard functions: eliminating randomness at almost no cost. STOC 2021: 283-291 - [i18]Lijie Chen, Roei Tell:
Hardness vs Randomness, Revised: Uniform, Non-Black-Box, and Instance-Wise. Electron. Colloquium Comput. Complex. TR21: Article TR21-080 (2021) - [i17]Pooya Hatami, William Hoza, Avishay Tal, Roei Tell:
Fooling Constant-Depth Threshold Circuits. Electron. Colloquium Comput. Complex. TR21: Article TR21-002 (2021) - [i16]Roei Tell:
How to Find Water in the Ocean: A Survey on Quantified Derandomization. Electron. Colloquium Comput. Complex. TR21: Article TR21-120 (2021) - 2020
- [c9]Dean Doron, Amnon Ta-Shma, Roei Tell:
On Hitting-Set Generators for Polynomials That Vanish Rarely. APPROX-RANDOM 2020: 7:1-7:23 - [c8]Lijie Chen, Ron D. Rothblum, Roei Tell, Eylon Yogev:
On Exponential-Time Hypotheses, Derandomization, and Circuit Lower Bounds: Extended Abstract. FOCS 2020: 13-23 - [p1]Roei Tell:
A Note on Tolerant Testing with One-Sided Error. Computational Complexity and Property Testing 2020: 173-177 - [i15]Lijie Chen, Roei Tell:
Simple and fast derandomization from very hard functions: Eliminating randomness at almost no cost. Electron. Colloquium Comput. Complex. TR20: Article TR20-148 (2020)
2010 – 2019
- 2019
- [j3]Roei Tell:
Improved Bounds for Quantified Derandomization of Constant-Depth Circuits and Polynomials. Comput. Complex. 28(2): 259-343 (2019) - [j2]Roei Tell:
Proving that prBPP = prP is as hard as proving that "almost NP" is not contained in P/poly. Inf. Process. Lett. 152 (2019) - [j1]Roei Tell:
Property Testing Lower Bounds via a Generalization of Randomized Parity Decision Trees. Theory Comput. Syst. 63(3): 418-449 (2019) - [c7]Igor Carboni Oliveira, Rahul Santhanam, Roei Tell:
Expander-Based Cryptography Meets Natural Proofs. ITCS 2019: 18:1-18:14 - [c6]Lijie Chen, Roei Tell:
Bootstrapping results for threshold circuits "just beyond" known lower bounds. STOC 2019: 34-41 - [i14]Lijie Chen, Ron Rothblum, Roei Tell, Eylon Yogev:
On Exponential-Time Hypotheses, Derandomization, and Circuit Lower Bounds. Electron. Colloquium Comput. Complex. TR19: Article TR19-169 (2019) - [i13]Dean Doron, Amnon Ta-Shma, Roei Tell:
On Hitting-Set Generators for Polynomials that Vanish Rarely. Electron. Colloquium Comput. Complex. TR19: Article TR19-119 (2019) - 2018
- [c5]Roei Tell:
Lower Bounds on Black-Box Reductions of Hitting to Density Estimation. STACS 2018: 58:1-58:13 - [c4]Roei Tell:
Quantified derandomization of linear threshold circuits. STOC 2018: 855-865 - [i12]Lijie Chen, Roei Tell:
Bootstrapping Results for Threshold Circuits "Just Beyond" Known Lower Bounds. Electron. Colloquium Comput. Complex. TR18: Article TR18-199 (2018) - [i11]Igor Carboni Oliveira, Rahul Santhanam, Roei Tell:
Expander-Based Cryptography Meets Natural Proofs. Electron. Colloquium Comput. Complex. TR18: Article TR18-159 (2018) - [i10]Roei Tell:
Proving that prBPP=prP is as hard as "almost" proving that P ≠ NP. Electron. Colloquium Comput. Complex. TR18: Article TR18-003 (2018) - 2017
- [c3]Roei Tell:
Improved Bounds for Quantified Derandomization of Constant-Depth Circuits and Polynomials. CCC 2017: 13:1-13:48 - [i9]Roei Tell:
Quantified Derandomization of Linear Threshold Circuits. CoRR abs/1709.07635 (2017) - [i8]Roei Tell:
Quantified derandomization of linear threshold circuits. Electron. Colloquium Comput. Complex. TR17: Article TR17-145 (2017) - [i7]Roei Tell:
A Note on the Limitations of Two Black-Box Techniques in Quantified Derandomization. Electron. Colloquium Comput. Complex. TR17: Article TR17-187 (2017) - 2016
- [c2]Roei Tell:
On Being Far from Far and on Dual Problems in Property Testing: [Extended Abstract]. ITCS 2016: 103-110 - [i6]Roei Tell:
A Note on Tolerant Testing with One-Sided Error. Electron. Colloquium Comput. Complex. TR16: Article TR16-032 (2016) - [i5]Roei Tell:
Lower Bounds on Black-Box Reductions of Hitting to Density Estimation. Electron. Colloquium Comput. Complex. TR16: Article TR16-050 (2016) - [i4]Roei Tell:
Improved Bounds for Quantified Derandomization of Constant-Depth Circuits and Polynomials. Electron. Colloquium Comput. Complex. TR16: Article TR16-191 (2016) - 2015
- [i3]Roei Tell:
On Being Far from Far and on Dual Problems in Property Testing. Electron. Colloquium Comput. Complex. TR15: Article TR15-072 (2015) - 2014
- [i2]Roei Tell:
An Alternative Proof of an Ω(k) Lower Bound for Testing k-linear Boolean Functions. Electron. Colloquium Comput. Complex. TR14: Article TR14-114 (2014) - [i1]Roei Tell:
Deconstructions of Reductions from Communication Complexity to Property Testing using Generalized Parity Decision Trees. Electron. Colloquium Comput. Complex. TR14: Article TR14-115 (2014) - 2013
- [c1]Roei Tell, Peter Izsak, Aidan Shribman, Steve Walsh, Benoit Hudzia:
Leveraging memory mirroring for transparent memory scale-out with zero-downtime failover of remote hosts. ISCC 2013: 384-390
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 2026-01-29 23:39 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:
