Roei Tell
Orcid: 0000-0002-9693-9244
According to our database1,
Roei Tell
authored at least 36 papers
between 2013 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
2014
2016
2018
2020
2022
2024
0
1
2
3
4
5
6
7
1
3
5
6
3
1
4
2
2
2
1
2
1
1
1
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
Electron. Colloquium Comput. Complex., 2024
Distinguishing, Predicting, and Certifying: On the Long Reach of Partial Notions of Pseudorandomness.
Electron. Colloquium Comput. Complex., 2024
Fiat-Shamir in the Plain Model from Derandomization (Or: Do Efficient Algorithms Believe that NP = PSPACE?).
Electron. Colloquium Comput. Complex., 2024
2023
Electron. Colloquium Comput. Complex., 2023
Opening Up the Distinguisher: A Hardness to Randomness Approach for BPL = L that Uses Properties of BPL.
Electron. Colloquium Comput. Complex., 2023
Electron. Colloquium Comput. Complex., 2023
Derandomization vs Refutation: A Unified Framework for Characterizing Derandomization.
Electron. Colloquium Comput. Complex., 2023
2022
Found. Trends Theor. Comput. Sci., 2022
Electron. Colloquium Comput. Complex., 2022
When Arthur has Neither Random Coins nor Time to Spare: Superfast Derandomization of Proof Systems.
Electron. Colloquium Comput. Complex., 2022
Electron. Colloquium Comput. Complex., 2022
2021
Electron. Colloquium Comput. Complex., 2021
Electron. Colloquium Comput. Complex., 2021
Electron. Colloquium Comput. Complex., 2021
Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021
2020
Proceedings of the Computational Complexity and Property Testing, 2020
Simple and fast derandomization from very hard functions: Eliminating randomness at almost no cost.
Electron. Colloquium Comput. Complex., 2020
On Exponential-Time Hypotheses, Derandomization, and Circuit Lower Bounds: Extended Abstract.
Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020
2019
Property Testing Lower Bounds via a Generalization of Randomized Parity Decision Trees.
Theory Comput. Syst., 2019
Proving that <i>prBPP</i> = <i>prP</i> is as hard as proving that "almost <i>NP</i>" is not contained in <i>P</i>/poly.
Inf. Process. Lett., 2019
Electron. Colloquium Comput. Complex., 2019
Improved Bounds for Quantified Derandomization of Constant-Depth Circuits and Polynomials.
Comput. Complex., 2019
2018
Electron. Colloquium Comput. Complex., 2018
Electron. Colloquium Comput. Complex., 2018
2017
Electron. Colloquium Comput. Complex., 2017
Electron. Colloquium Comput. Complex., 2017
2016
Electron. Colloquium Comput. Complex., 2016
Electron. Colloquium Comput. Complex., 2016
Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science, 2016
2015
Electron. Colloquium Comput. Complex., 2015
2014
Deconstructions of Reductions from Communication Complexity to Property Testing using Generalized Parity Decision Trees.
Electron. Colloquium Comput. Complex., 2014
Electron. Colloquium Comput. Complex., 2014
2013
Leveraging memory mirroring for transparent memory scale-out with zero-downtime failover of remote hosts.
Proceedings of the 2013 IEEE Symposium on Computers and Communications, 2013