Roei Tell - RankMe

66 papers A* 15A 6C 1Journal 42Unranked 1

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Complexity theoretic implications of pseudodeterministic algorithms for PPT-search problems. Electron. Colloquium Comput. Complex. Oded Goldreich, Roei Tell
2025	J	`jnl`	Composing Low-Space Algorithms. Electron. Colloquium Comput. Complex. Edward Pyne, Roei Tell
2025	A*	`conf`	Fiat-Shamir in the Plain Model from Derandomization (Or: Do Efficient Algorithms Believe that NP = PSPACE?). STOC Lijie Chen, Ron D. Rothblum, Roei Tell
2025	A*	`conf`	Polynomial-Time PIT from (Almost) Necessary Assumptions. STOC Robert Andrews, Deepanshu Kush, Roei Tell
2025	J	`jnl`	Polynomial-Time PIT from (Almost) Necessary Assumptions. CoRR Robert Andrews, Deepanshu Kush, Roei Tell
2025	J	`jnl`	Polynomial-Time PIT from (Almost) Necessary Assumptions. Electron. Colloquium Comput. Complex. Robert Andrews, Deepanshu Kush, Roei Tell
2025	A	`conf`	Towards Free Lunch Derandomization from Necessary Assumptions (And OWFs). CCC Marshall Ball, Lijie Chen, Roei Tell
2025	J	`jnl`	Towards Free Lunch Derandomization from Necessary Assumptions (and OWFs). Electron. Colloquium Comput. Complex. Marshall Ball, Lijie Chen, Roei Tell
2025	J	`jnl`	When Connectivity Is Hard, Random Walks Are Easy With Non-Determinism. Electron. Colloquium Comput. Complex. Dean Doron, Edward Pyne, Roei Tell, Ryan Williams
2025	A*	`conf`	When Connectivity Is Hard, Random Walks Are Easy with Non-determinism. STOC Dean Doron, Edward Pyne, Roei Tell, R. Ryan Williams
2024	A*	`conf`	Distinguishing, Predicting, and Certifying: On the Long Reach of Partial Notions of Pseudorandomness. FOCS Jiatu Li, Edward Pyne, Roei Tell
2024	J	`jnl`	Distinguishing, Predicting, and Certifying: On the Long Reach of Partial Notions of Pseudorandomness. Electron. Colloquium Comput. Complex. Jiatu Li, Edward Pyne, Roei Tell
2024	J	`jnl`	Fiat-Shamir in the Plain Model from Derandomization (Or: Do Efficient Algorithms Believe that NP = PSPACE?). Electron. Colloquium Comput. Complex. Lijie Chen, Ron D. Rothblum, Roei Tell
2024	J	`jnl`	On defining PPT-search problems and PPT-optimization problems. Electron. Colloquium Comput. Complex. Roei Tell
2024	A*	`conf`	Opening Up the Distinguisher: A Hardness to Randomness Approach for BPL=L That Uses Properties of BPL. STOC Dean Doron, Edward Pyne, Roei Tell
2023	A*	`conf`	Depth-d Threshold Circuits vs. Depth-(d+1) AND-OR Trees. STOC Pooya Hatami, William M. Hoza, Avishay Tal, Roei Tell
2023	A*	`conf`	Derandomization vs Refutation: A Unified Framework for Characterizing Derandomization. FOCS Lijie Chen, Roei Tell, Ryan Williams
2023	J	`jnl`	Derandomization vs Refutation: A Unified Framework for Characterizing Derandomization. Electron. Colloquium Comput. Complex. Lijie Chen, Roei Tell, Ryan Williams
2023	A	`conf`	Derandomization with Minimal Memory Footprint. CCC Dean Doron, Roei Tell
2023	J	`jnl`	Derandomization with Minimal Memory Footprint. Electron. Colloquium Comput. Complex. Dean Doron, Roei Tell
2023	J	`jnl`	Guest Column: New ways of studying the BPP = P conjecture. SIGACT News Lijie Chen, Roei Tell
2023	J	`jnl`	New ways of studying the BPP = P conjecture. Electron. Colloquium Comput. Complex. Lijie Chen, Roei Tell
2023	J	`jnl`	On Exponential-time Hypotheses, Derandomization, and Circuit Lower Bounds. J. ACM Lijie Chen, Ron D. Rothblum, Roei Tell, Eylon Yogev
2023	J	`jnl`	Opening Up the Distinguisher: A Hardness to Randomness Approach for BPL = L that Uses Properties of BPL. Electron. Colloquium Comput. Complex. Dean Doron, Edward Pyne, Roei Tell
2023	A*	`conf`	When Arthur Has Neither Random Coins Nor Time to Spare: Superfast Derandomization of Proof Systems. STOC Lijie Chen, Roei Tell
2022	J	`jnl`	Depth-d Threshold Circuits vs. Depth-(d + 1) AND-OR Trees. Electron. Colloquium Comput. Complex. Pooya Hatami, William Hoza, Avishay Tal, Roei Tell
2022	J	`jnl`	Expander-Based Cryptography Meets Natural Proofs. Comput. Complex. Igor C. Oliveira, Rahul Santhanam, Roei Tell
2022	J	`jnl`	On Hitting-Set Generators for Polynomials that Vanish Rarely. Comput. Complex. Dean Doron, Amnon Ta-Shma, Roei Tell
2022	J	`jnl`	Quantified Derandomization: How to Find Water in the Ocean. Found. Trends Theor. Comput. Sci. Roei Tell
2022	A*	`conf`	Unstructured Hardness to Average-Case Randomness. FOCS Lijie Chen, Ron D. Rothblum, Roei Tell
2022	J	`jnl`	Unstructured Hardness to Average-Case Randomness. Electron. Colloquium Comput. Complex. Lijie Chen, Ron D. Rothblum, Roei Tell
2022	J	`jnl`	When Arthur has Neither Random Coins nor Time to Spare: Superfast Derandomization of Proof Systems. Electron. Colloquium Comput. Complex. Lijie Chen, Roei Tell
2021	A*	`conf`	Fooling Constant-Depth Threshold Circuits (Extended Abstract). FOCS Pooya Hatami, William M. Hoza, Avishay Tal, Roei Tell
2021	J	`jnl`	Fooling Constant-Depth Threshold Circuits. Electron. Colloquium Comput. Complex. Pooya Hatami, William Hoza, Avishay Tal, Roei Tell
2021	A*	`conf`	Hardness vs Randomness, Revised: Uniform, Non-Black-Box, and Instance-Wise. FOCS Lijie Chen, Roei Tell
2021	J	`jnl`	Hardness vs Randomness, Revised: Uniform, Non-Black-Box, and Instance-Wise. Electron. Colloquium Comput. Complex. Lijie Chen, Roei Tell
2021	J	`jnl`	How to Find Water in the Ocean: A Survey on Quantified Derandomization. Electron. Colloquium Comput. Complex. Roei Tell
2021	A*	`conf`	Simple and fast derandomization from very hard functions: eliminating randomness at almost no cost. STOC Lijie Chen, Roei Tell
2020	—	`ch.`	A Note on Tolerant Testing with One-Sided Error. Computational Complexity and Property Testing Roei Tell
2020	A*	`conf`	On Exponential-Time Hypotheses, Derandomization, and Circuit Lower Bounds: Extended Abstract. FOCS Lijie Chen, Ron D. Rothblum, Roei Tell, Eylon Yogev
2020	—	`conf`	On Hitting-Set Generators for Polynomials That Vanish Rarely. APPROX-RANDOM Dean Doron, Amnon Ta-Shma, Roei Tell
2020	J	`jnl`	Simple and fast derandomization from very hard functions: Eliminating randomness at almost no cost. Electron. Colloquium Comput. Complex. Lijie Chen, Roei Tell
2019	A*	`conf`	Bootstrapping results for threshold circuits "just beyond" known lower bounds. STOC Lijie Chen, Roei Tell
2019	A	`conf`	Expander-Based Cryptography Meets Natural Proofs. ITCS Igor Carboni Oliveira, Rahul Santhanam, Roei Tell
2019	J	`jnl`	Improved Bounds for Quantified Derandomization of Constant-Depth Circuits and Polynomials. Comput. Complex. Roei Tell
2019	J	`jnl`	On Exponential-Time Hypotheses, Derandomization, and Circuit Lower Bounds. Electron. Colloquium Comput. Complex. Lijie Chen, Ron Rothblum, Roei Tell, Eylon Yogev
2019	J	`jnl`	On Hitting-Set Generators for Polynomials that Vanish Rarely. Electron. Colloquium Comput. Complex. Dean Doron, Amnon Ta-Shma, Roei Tell
2019	J	`jnl`	Property Testing Lower Bounds via a Generalization of Randomized Parity Decision Trees. Theory Comput. Syst. Roei Tell
2019	J	`jnl`	Proving that Inf. Process. Lett. Roei Tell
2018	J	`jnl`	Bootstrapping Results for Threshold Circuits "Just Beyond" Known Lower Bounds. Electron. Colloquium Comput. Complex. Lijie Chen, Roei Tell
2018	J	`jnl`	Expander-Based Cryptography Meets Natural Proofs. Electron. Colloquium Comput. Complex. Igor Carboni Oliveira, Rahul Santhanam, Roei Tell
2018	A	`conf`	Lower Bounds on Black-Box Reductions of Hitting to Density Estimation. STACS Roei Tell
2018	J	`jnl`	Proving that prBPP=prP is as hard as "almost" proving that P ≠ NP. Electron. Colloquium Comput. Complex. Roei Tell
2018	A*	`conf`	Quantified derandomization of linear threshold circuits. STOC Roei Tell
2017	J	`jnl`	A Note on the Limitations of Two Black-Box Techniques in Quantified Derandomization. Electron. Colloquium Comput. Complex. Roei Tell
2017	A	`conf`	Improved Bounds for Quantified Derandomization of Constant-Depth Circuits and Polynomials. CCC Roei Tell
2017	J	`jnl`	Quantified Derandomization of Linear Threshold Circuits. CoRR Roei Tell
2017	J	`jnl`	Quantified derandomization of linear threshold circuits. Electron. Colloquium Comput. Complex. Roei Tell
2016	J	`jnl`	A Note on Tolerant Testing with One-Sided Error. Electron. Colloquium Comput. Complex. Roei Tell
2016	J	`jnl`	Improved Bounds for Quantified Derandomization of Constant-Depth Circuits and Polynomials. Electron. Colloquium Comput. Complex. Roei Tell
2016	J	`jnl`	Lower Bounds on Black-Box Reductions of Hitting to Density Estimation. Electron. Colloquium Comput. Complex. Roei Tell
2016	A	`conf`	On Being Far from Far and on Dual Problems in Property Testing: [Extended Abstract]. ITCS Roei Tell
2015	J	`jnl`	On Being Far from Far and on Dual Problems in Property Testing. Electron. Colloquium Comput. Complex. Roei Tell
2014	J	`jnl`	An Alternative Proof of an Ω(k) Lower Bound for Testing k-linear Boolean Functions. Electron. Colloquium Comput. Complex. Roei Tell
2014	J	`jnl`	Deconstructions of Reductions from Communication Complexity to Property Testing using Generalized Parity Decision Trees. Electron. Colloquium Comput. Complex. Roei Tell
2013	C	`conf`	Leveraging memory mirroring for transparent memory scale-out with zero-downtime failover of remote hosts. ISCC Roei Tell, Peter Izsak, Aidan Shribman, Steve Walsh, Benoit Hudzia