Get started
Author

Roei Tell

Hardness vs Randomness, Revised: Uniform, Non-Black-Box, and Instance-Wise
2022 · Lijie Chen, Roei Tell · Annual Symposium on Foundations of Computer Science · 30
Bootstrapping results for threshold circuits “just beyond” known lower bounds
2019 · Lijie Chen, Roei Tell · ACM Symposium on Theory of Computing (STOC) · 27
Simple and fast derandomization from very hard functions: eliminating randomness at almost no cost
2021 · Lijie Chen, Roei Tell · ACM Symposium on Theory of Computing (STOC) · 25
PDF
Quantified derandomization of linear threshold circuits
2018 · Roei Tell · ACM Symposium on Theory of Computing (STOC) · 19
PDF
Distinguishing, Predicting, and Certifying: On the Long Reach of Partial Notions of Pseudorandomness
2024 · Jiatu Li, Edward Pyne, et al. · Annual Symposium on Foundations of Computer Science · 13
Derandomization vs Refutation: A Unified Framework for Characterizing Derandomization
2023 · Lijie Chen, Roei Tell, et al. · Annual Symposium on Foundations of Computer Science · 12
When Arthur Has Neither Random Coins Nor Time to Spare: Superfast Derandomization of Proof Systems
2023 · Lijie Chen, Roei Tell · ACM Symposium on Theory of Computing (STOC) · 11
PDF
Opening Up the Distinguisher: A Hardness to Randomness Approach for BPL=L That Uses Properties of BPL
2024 · Dean Doron, Edward Pyne, et al. · ACM Symposium on Theory of Computing (STOC) · 10
PDF
Unstructured Hardness to Average-Case Randomness
2022 · Lijie Chen, Ron D. Rothblum, et al. · Annual Symposium on Foundations of Computer Science · 10
Guest Column: New ways of studying the BPP = P conjecture
2023 · Lijie Chen, Roei Tell · ACM SIGACT News · 9
PDF
On Exponential-time Hypotheses, Derandomization, and Circuit Lower Bounds
2023 · Lijie Chen, Ron D. Rothblum, et al. · Journal of the ACM · 8
PDF
On Exponential-Time Hypotheses, Derandomization, and Circuit Lower Bounds: Extended Abstract
2020 · Lijie Chen, Ron D. Rothblum, et al. · Annual Symposium on Foundations of Computer Science · 8
Fiat-Shamir in the Plain Model from Derandomization (Or: Do Efficient Algorithms Believe that NP = PSPACE?)
2025 · Lijie Chen, Ron D. Rothblum, et al. · ACM Symposium on Theory of Computing (STOC) · 7
PDF
Fooling Constant-Depth Threshold Circuits (Extended Abstract)
2022 · Pooya Hatami, William M. Hoza, et al. · Annual Symposium on Foundations of Computer Science · 7
Proving that prBPP = prP is as hard as proving that “almost NP” is not contained in P/poly
2019 · Roei Tell · Information Processing Letters · 7
Improved Bounds for Quantified Derandomization of Constant-Depth Circuits and Polynomials
2019 · Roei Tell · Computational Complexity · 7
Depth-𝑑 Threshold Circuits vs. Depth-(𝑑+1) AND-OR Trees
2023 · Pooya Hatami, William M. Hoza, et al. · ACM Symposium on Theory of Computing (STOC) · 4
PDF
Expander-Based Cryptography Meets Natural Proofs
2022 · Igor C. Oliveira, Rahul Santhanam, et al. · Computational Complexity · 4
Quantified Derandomization: How to Find Water in the Ocean
2022 · Roei Tell · Foundations and Trends® in Theoretical Computer Science · 3
Fooling Constant-Depth Threshold Circuits.
2021 · Pooya Hatami, William M. Hoza, et al. · Electronic colloquium on computational complexity · 3
A Note on Tolerant Testing with One-Sided Error
2020 · Roei Tell · Lecture notes in computer science · 3
Expander-Based Cryptography Meets Natural Proofs
2019 · Carboni Oliveira, Igor, Santhanam, Rahul, et al. · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 3
PDF
On Being Far from Far and on Dual Problems in Property Testing.
2015 · Roei Tell · Electronic colloquium on computational complexity · 3
Deconstructions of Reductions from Communication Complexity to Property Testing using Generalized Parity Decision Trees.
2014 · Roei Tell · Electronic colloquium on computational complexity · 3
When Connectivity Is Hard, Random Walks Are Easy with Non-determinism
2025 · Dean Doron, Edward Pyne, et al. · ACM Symposium on Theory of Computing (STOC) · 2
Works count: 43
Citation count: 250
H-index: 9
I10-index: 9
Year
Topic
Type