Roei Tell

MaRDI QIDQ1999995zbMATH OpenWikidataFDO

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Derandomization with minimal memory footprint	2024-11-19	Paper
When Arthur has neither random coins nor time to spare: superfast derandomization of proof systems	2024-05-08	Paper
Depth-\(d\) threshold circuits vs. depth-\((d+1)\) and-or trees	2024-05-08	Paper
Simple and fast derandomization from very hard functions: eliminating randomness at almost no cost Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing	2023-11-14	Paper
On hitting-set generators for polynomials that vanish rarely	2023-10-31	Paper
Quantified Derandomization: How to Find Water in the Ocean Foundations and Trends® in Theoretical Computer Science	2023-01-11	Paper
On hitting-set generators for polynomials that vanish rarely Computational Complexity	2022-11-24	Paper
A Note on Tolerant Testing with One-Sided Error Lecture Notes in Computer Science	2022-08-30	Paper
Expander-Based Cryptography Meets Natural Proofs	2022-07-18	Paper
Expander-based cryptography meets natural proofs Computational Complexity	2022-04-12	Paper
Lower bounds on black-box reductions of hitting to density estimation	2020-08-05	Paper
Improved bounds for quantified derandomization of constant-depth circuits and polynomials	2020-05-26	Paper
Bootstrapping results for threshold circuits ``just beyond known lower bounds Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing	2020-01-30	Paper
Proving that \(\mathrm{prBPP}=\mathrm{prP}\) is as hard as proving that ``almost NP is not contained in P/poly Information Processing Letters	2019-10-10	Paper
Quantified derandomization of linear threshold circuits Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing	2019-08-22	Paper
Improved bounds for quantified derandomization of constant-depth circuits and polynomials Computational Complexity	2019-07-10	Paper
Property testing lower bounds via a generalization of randomized parity decision trees Theory of Computing Systems	2019-06-27	Paper
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-04-15	Paper

Research outcomes over time

This page was built for person: Roei Tell