Roei Tell

From MaRDI portal
Person:1999995

Available identifiers

zbMath Open tell.roeiWikidataQ107785692 ScholiaQ107785692MaRDI QIDQ1999995

List of research outcomes





PublicationDate of PublicationType
Derandomization with minimal memory footprint2024-11-19Paper
When Arthur has neither random coins nor time to spare: superfast derandomization of proof systems2024-05-08Paper
Depth-\(d\) threshold circuits vs. depth-\((d+1)\) and-or trees2024-05-08Paper
Simple and fast derandomization from very hard functions: eliminating randomness at almost no cost2023-11-14Paper
On hitting-set generators for polynomials that vanish rarely2023-10-31Paper
Quantified Derandomization: How to Find Water in the Ocean2023-01-11Paper
On hitting-set generators for polynomials that vanish rarely2022-11-24Paper
A Note on Tolerant Testing with One-Sided Error2022-08-30Paper
Expander-Based Cryptography Meets Natural Proofs2022-07-18Paper
Expander-based cryptography meets natural proofs2022-04-12Paper
Lower bounds on black-box reductions of hitting to density estimation2020-08-05Paper
Improved bounds for quantified derandomization of constant-depth circuits and polynomials2020-05-26Paper
Bootstrapping results for threshold circuits ``just beyond known lower bounds2020-01-30Paper
Proving that \(\mathrm{prBPP}=\mathrm{prP}\) is as hard as proving that ``almost NP is not contained in P/poly2019-10-10Paper
Quantified derandomization of linear threshold circuits2019-08-22Paper
Improved bounds for quantified derandomization of constant-depth circuits and polynomials2019-07-10Paper
Property testing lower bounds via a generalization of randomized parity decision trees2019-06-27Paper
On being far from far and on dual problems in property testing (extended abstract)2016-04-15Paper

Research outcomes over time

This page was built for person: Roei Tell