| 2025 | STOC | Fiat-Shamir in the Plain Model from Derandomization (Or: Do Efficient Algorithms Believe that NP = PSPACE?). | Lijie Chen, Ron D. Rothblum, Roei Tell |
| 2025 | STOC | Polynomial-Time PIT from (Almost) Necessary Assumptions. | Robert Andrews, Deepanshu Kush, Roei Tell |
| 2025 | STOC | When Connectivity Is Hard, Random Walks Are Easy with Non-determinism. | Dean Doron, Edward Pyne, Roei Tell, R. Ryan Williams |
| 2024 | FOCS | Distinguishing, Predicting, and Certifying: On the Long Reach of Partial Notions of Pseudorandomness. | Jiatu Li, Edward Pyne, Roei Tell |
| 2024 | STOC | Opening Up the Distinguisher: A Hardness to Randomness Approach for BPL=L That Uses Properties of BPL. | Dean Doron, Edward Pyne, Roei Tell |
| 2023 | FOCS | Derandomization vs Refutation: A Unified Framework for Characterizing Derandomization. | Lijie Chen, Roei Tell, Ryan Williams |
| 2023 | STOC | When Arthur Has Neither Random Coins Nor Time to Spare: Superfast Derandomization of Proof Systems. | Lijie Chen, Roei Tell |
| 2023 | STOC | Depth-d Threshold Circuits vs. Depth-(d+1) AND-OR Trees. | Pooya Hatami, William M. Hoza, Avishay Tal, Roei Tell |
| 2022 | FOCS | Unstructured Hardness to Average-Case Randomness. | Lijie Chen, Ron D. Rothblum, Roei Tell |
| 2021 | FOCS | Hardness vs Randomness, Revised: Uniform, Non-Black-Box, and Instance-Wise. | Lijie Chen, Roei Tell |
| 2021 | FOCS | Fooling Constant-Depth Threshold Circuits (Extended Abstract). | Pooya Hatami, William M. Hoza, Avishay Tal, Roei Tell |
| 2021 | STOC | Simple and fast derandomization from very hard functions: eliminating randomness at almost no cost. | Lijie Chen, Roei Tell |
| 2020 | FOCS | On Exponential-Time Hypotheses, Derandomization, and Circuit Lower Bounds: Extended Abstract. | Lijie Chen, Ron D. Rothblum, Roei Tell, Eylon Yogev |
| 2019 | STOC | Bootstrapping results for threshold circuits "just beyond" known lower bounds. | Lijie Chen, Roei Tell |
| 2018 | STOC | Quantified derandomization of linear threshold circuits. | Roei Tell |
| 2018 | STACS | Lower Bounds on Black-Box Reductions of Hitting to Density Estimation. | Roei Tell |
| 2013 | ISCC | Leveraging memory mirroring for transparent memory scale-out with zero-downtime failover of remote hosts. | Roei Tell, Peter Izsak, Aidan Shribman, Steve Walsh, Benoit Hudzia |