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 (ISCC, 2013)

An Alternative Proof of an Ω(k) Lower Bound for Testing k-linear Boolean Functions. - Roei Tell (Electron. Colloquium Comput. Complex., 2014)

Deconstructions of Reductions from Communication Complexity to Property Testing using Generalized Parity Decision Trees. - Roei Tell (Electron. Colloquium Comput. Complex., 2014)

On Being Far from Far and on Dual Problems in Property Testing. - Roei Tell (Electron. Colloquium Comput. Complex., 2015)

On Being Far from Far and on Dual Problems in Property Testing: [Extended Abstract]. - Roei Tell (ITCS, 2016)

A Note on Tolerant Testing with One-Sided Error. - Roei Tell (Electron. Colloquium Comput. Complex., 2016)

Lower Bounds on Black-Box Reductions of Hitting to Density Estimation. - Roei Tell (Electron. Colloquium Comput. Complex., 2016)

Quantified derandomization of linear threshold circuits. - Roei Tell (Electron. Colloquium Comput. Complex., 2017)

A Note on the Limitations of Two Black-Box Techniques in Quantified Derandomization. - Roei Tell (Electron. Colloquium Comput. Complex., 2017)

Bootstrapping Results for Threshold Circuits "Just Beyond" Known Lower Bounds. - Lijie Chen 001; Roei Tell (Electron. Colloquium Comput. Complex., 2018)

Proving that prBPP=prP is as hard as "almost" proving that P ≠ NP. - Roei Tell (Electron. Colloquium Comput. Complex., 2018)

Improved Bounds for Quantified Derandomization of Constant-Depth Circuits and Polynomials. - Roei Tell (Comput. Complex., 2019)

On Exponential-Time Hypotheses, Derandomization, and Circuit Lower Bounds. - Lijie Chen 001; Ron Rothblum; Roei Tell; Eylon Yogev (Electron. Colloquium Comput. Complex., 2019)

Proving that prBPP = prP is as hard as proving that "almost NP" is not contained in P/poly. - Roei Tell (Inf. Process. Lett., 2019)

Property Testing Lower Bounds via a Generalization of Randomized Parity Decision Trees. - Roei Tell (Theory Comput. Syst., 2019)

On Exponential-Time Hypotheses, Derandomization, and Circuit Lower Bounds: Extended Abstract. - Lijie Chen 001; Ron D. Rothblum; Roei Tell; Eylon Yogev (FOCS, 2020)

Simple and fast derandomization from very hard functions: Eliminating randomness at almost no cost. - Lijie Chen 001; Roei Tell (Electron. Colloquium Comput. Complex., 2020)

A Note on Tolerant Testing with One-Sided Error. - Roei Tell (Computational Complexity and Property Testing, 2020)

Fooling Constant-Depth Threshold Circuits (Extended Abstract). - Pooya Hatami; William M. Hoza; Avishay Tal; Roei Tell (FOCS, 2021)

Hardness vs Randomness, Revised: Uniform, Non-Black-Box, and Instance-Wise. - Lijie Chen 001; Roei Tell (Electron. Colloquium Comput. Complex., 2021)

Fooling Constant-Depth Threshold Circuits. - Pooya Hatami; William Hoza; Avishay Tal; Roei Tell (Electron. Colloquium Comput. Complex., 2021)

How to Find Water in the Ocean: A Survey on Quantified Derandomization. - Roei Tell (Electron. Colloquium Comput. Complex., 2021)

On Hitting-Set Generators for Polynomials that Vanish Rarely. - Dean Doron; Amnon Ta-Shma; Roei Tell (Comput. Complex., 2022)

Expander-Based Cryptography Meets Natural Proofs. - Igor C. Oliveira 001; Rahul Santhanam; Roei Tell (Comput. Complex., 2022)

Unstructured Hardness to Average-Case Randomness. - Lijie Chen 001; Ron D. Rothblum; Roei Tell (Electron. Colloquium Comput. Complex., 2022)

When Arthur has Neither Random Coins nor Time to Spare: Superfast Derandomization of Proof Systems. - Lijie Chen 001; Roei Tell (Electron. Colloquium Comput. Complex., 2022)

Depth-d Threshold Circuits vs. Depth-(d + 1) AND-OR Trees. - Pooya Hatami; William Hoza; Avishay Tal; Roei Tell (Electron. Colloquium Comput. Complex., 2022)

Quantified Derandomization: How to Find Water in the Ocean. - Roei Tell (Found. Trends Theor. Comput. Sci., 2022)

Derandomization vs Refutation: A Unified Framework for Characterizing Derandomization. - Lijie Chen 001; Roei Tell; Ryan Williams 001 (Electron. Colloquium Comput. Complex., 2023)

New ways of studying the BPP = P conjecture. - Lijie Chen 001; Roei Tell (Electron. Colloquium Comput. Complex., 2023)

Opening Up the Distinguisher: A Hardness to Randomness Approach for BPL = L that Uses Properties of BPL. - Dean Doron; Edward Pyne; Roei Tell (Electron. Colloquium Comput. Complex., 2023)

Derandomization with Minimal Memory Footprint. - Dean Doron; Roei Tell (Electron. Colloquium Comput. Complex., 2023)

Guest Column: New ways of studying the BPP = P conjecture. - Lijie Chen 001; Roei Tell (SIGACT News, 2023)

Fiat-Shamir in the Plain Model from Derandomization (Or: Do Efficient Algorithms Believe that NP = PSPACE?). - Lijie Chen 001; Ron D. Rothblum; Roei Tell (Electron. Colloquium Comput. Complex., 2024)

Distinguishing, Predicting, and Certifying: On the Long Reach of Partial Notions of Pseudorandomness. - Jiatu Li; Edward Pyne; Roei Tell (Electron. Colloquium Comput. Complex., 2024)

On defining PPT-search problems and PPT-optimization problems. - Roei Tell (Electron. Colloquium Comput. Complex., 2024)

Complexity theoretic implications of pseudodeterministic algorithms for PPT-search problems. - Oded Goldreich 001; Roei Tell (Electron. Colloquium Comput. Complex., 2025)

Polynomial-Time PIT from (Almost) Necessary Assumptions. - Robert Andrews 003; Deepanshu Kush; Roei Tell (Electron. Colloquium Comput. Complex., 2025)

Towards Free Lunch Derandomization from Necessary Assumptions (and OWFs). - Marshall Ball; Lijie Chen 001; Roei Tell (Electron. Colloquium Comput. Complex., 2025)

When Connectivity Is Hard, Random Walks Are Easy With Non-Determinism. - Dean Doron; Edward Pyne; Roei Tell; Ryan Williams 001 (Electron. Colloquium Comput. Complex., 2025)