Roei Tell

Orcid: 0000-0002-9693-9244

According to our database1, Roei Tell authored at least 33 papers between 2013 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
On Exponential-time Hypotheses, Derandomization, and Circuit Lower Bounds.
J. ACM, August, 2023

Guest Column: New ways of studying the BPP = P conjecture.
SIGACT News, 2023

Derandomization with Minimal Memory Footprint.
Electron. Colloquium Comput. Complex., 2023

Opening Up the Distinguisher: A Hardness to Randomness Approach for BPL = L that Uses Properties of BPL.
Electron. Colloquium Comput. Complex., 2023

New ways of studying the BPP = P conjecture.
Electron. Colloquium Comput. Complex., 2023

Derandomization vs Refutation: A Unified Framework for Characterizing Derandomization.
Electron. Colloquium Comput. Complex., 2023

2022
Quantified Derandomization: How to Find Water in the Ocean.
Found. Trends Theor. Comput. Sci., 2022

Depth-d Threshold Circuits vs. Depth-(d + 1) AND-OR Trees.
Electron. Colloquium Comput. Complex., 2022

When Arthur has Neither Random Coins nor Time to Spare: Superfast Derandomization of Proof Systems.
Electron. Colloquium Comput. Complex., 2022

Unstructured Hardness to Average-Case Randomness.
Electron. Colloquium Comput. Complex., 2022

Expander-Based Cryptography Meets Natural Proofs.
Comput. Complex., 2022

On Hitting-Set Generators for Polynomials that Vanish Rarely.
Comput. Complex., 2022

2021
How to Find Water in the Ocean: A Survey on Quantified Derandomization.
Electron. Colloquium Comput. Complex., 2021

Fooling Constant-Depth Threshold Circuits.
Electron. Colloquium Comput. Complex., 2021

Hardness vs Randomness, Revised: Uniform, Non-Black-Box, and Instance-Wise.
Electron. Colloquium Comput. Complex., 2021

Fooling Constant-Depth Threshold Circuits (Extended Abstract).
Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

2020
A Note on Tolerant Testing with One-Sided Error.
Proceedings of the Computational Complexity and Property Testing, 2020

Simple and fast derandomization from very hard functions: Eliminating randomness at almost no cost.
Electron. Colloquium Comput. Complex., 2020

On Exponential-Time Hypotheses, Derandomization, and Circuit Lower Bounds: Extended Abstract.
Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

2019
Property Testing Lower Bounds via a Generalization of Randomized Parity Decision Trees.
Theory Comput. Syst., 2019

Proving that <i>prBPP</i> = <i>prP</i> is as hard as proving that "almost <i>NP</i>" is not contained in <i>P</i>/poly.
Inf. Process. Lett., 2019

Improved Bounds for Quantified Derandomization of Constant-Depth Circuits and Polynomials.
Comput. Complex., 2019

2018
Proving that prBPP=prP is as hard as "almost" proving that P ≠ NP.
Electron. Colloquium Comput. Complex., 2018

Bootstrapping Results for Threshold Circuits "Just Beyond" Known Lower Bounds.
Electron. Colloquium Comput. Complex., 2018

2017
A Note on the Limitations of Two Black-Box Techniques in Quantified Derandomization.
Electron. Colloquium Comput. Complex., 2017

Quantified derandomization of linear threshold circuits.
Electron. Colloquium Comput. Complex., 2017

2016
Lower Bounds on Black-Box Reductions of Hitting to Density Estimation.
Electron. Colloquium Comput. Complex., 2016

A Note on Tolerant Testing with One-Sided Error.
Electron. Colloquium Comput. Complex., 2016

On Being Far from Far and on Dual Problems in Property Testing: [Extended Abstract].
Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science, 2016

2015
On Being Far from Far and on Dual Problems in Property Testing.
Electron. Colloquium Comput. Complex., 2015

2014
Deconstructions of Reductions from Communication Complexity to Property Testing using Generalized Parity Decision Trees.
Electron. Colloquium Comput. Complex., 2014

An Alternative Proof of an Ω(k) Lower Bound for Testing k-linear Boolean Functions.
Electron. Colloquium Comput. Complex., 2014

2013
Leveraging memory mirroring for transparent memory scale-out with zero-downtime failover of remote hosts.
Proceedings of the 2013 IEEE Symposium on Computers and Communications, 2013


  Loading...