Follow
Roei Tell
Title
Cited by
Cited by
Year
Bootstrapping results for threshold circuits “just beyond” known lower bounds
L Chen, R Tell
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019
372019
Cloud-enabled, distributed and high-availability system with virtual machine checkpointing
B Hudzia, S Walsh, R Tell, A Shribman, P Izsak
US Patent 9,563,452, 2017
302017
Quantified derandomization of linear threshold circuits
R Tell
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018
262018
Improved bounds for quantified derandomization of constant-depth circuits and polynomials
R Tell
computational complexity 28 (2), 259-343, 2019
152019
Fooling constant-depth threshold circuits
P Hatami, WM Hoza, A Tal, R Tell
2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS …, 2022
112022
Simple and fast derandomization from very hard functions: Eliminating randomness at almost no cost
L Chen, R Tell
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021
112021
Hardness vs randomness, revised: Uniform, non-black-box, and instance-wise
L Chen, R Tell
2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS …, 2022
92022
On exponential-time hypotheses, derandomization, and circuit lower bounds
L Chen, RD Rothblum, R Tell, E Yogev
2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), 13-23, 2020
82020
A Note on the Limitations of Two Black-Box Techniques in Quantified Derandomization.
R Tell
Electron. Colloquium Comput. Complex. 24, 187, 2017
72017
A note on tolerant testing with one-sided error
R Tell
Computational Complexity and Property Testing: On the Interplay Between …, 2020
62020
Proving that prBPP= prP is as hard as proving that “almost NP” is not contained in P/poly
R Tell
Information Processing Letters 152, 105841, 2019
62019
On being far from far and on dual problems in property testing
R Tell
Proceedings of the 2016 ACM Conference on Innovations in Theoretical …, 2016
52016
Expander-based cryptography meets natural proofs
IC Oliveira, R Santhanam, R Tell
computational complexity 31 (1), 4, 2022
32022
On hitting-set generators for polynomials that vanish rarely
D Doron, A Ta-Shma, R Tell
Leibniz international proceedings in informatics, 2020
32020
Proving that prBPP= prP is as hard as" almost" proving that P≠ NP.
R Tell
Electron. Colloquium Comput. Complex. 25, 3, 2018
32018
A Note on Tolerant Testing with One-Sided Error.
R Tell
Electron. Colloquium Comput. Complex. 23, 32, 2016
32016
Deconstructions of Reductions from Communication Complexity to Property Testing using Generalized Parity Decision Trees.
R Tell
Electron. Colloquium Comput. Complex. 21, 115, 2014
32014
On Hitting-Set Generators for Polynomials that Vanish Rarely
D Doron, A Ta-Shma, R Tell
computational complexity 31 (2), 16, 2022
22022
Depth-d Threshold Circuits vs. Depth-(d+ 1) AND-OR Trees
P Hatami, WM Hoza, A Tal, R Tell
Electronic Colloquium on Computational Complexity (ECCC), 87, 2022
22022
An Alternative Proof of an Ω (k) Lower Bound for Testing k-linear Boolean Functions.
R Tell
Electron. Colloquium Comput. Complex. 21, 114, 2014
22014
The system can't perform the operation now. Try again later.
Articles 1–20