| Bootstrapping results for threshold circuits “just beyond” known lower bounds L Chen, R Tell Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019 | 42 | 2019 |
| Cloud-enabled, distributed and high-availability system with virtual machine checkpointing B Hudzia, S Walsh, R Tell, A Shribman, P Izsak US Patent 9,563,452, 2017 | 37 | 2017 |
| Hardness vs. randomness, revised: uniform, non-black-box, and instance-wise L Chen, R Tell SIAM Journal on Computing, FOCS21-323-FOCS21-392, 2024 | 32 | 2024 |
| Quantified derandomization of linear threshold circuits R Tell Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018 | 29 | 2018 |
| Simple and fast derandomization from very hard functions: eliminating randomness at almost no cost L Chen, R Tell Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021 | 24 | 2021 |
| On exponential-time hypotheses, derandomization, and circuit lower bounds L Chen, RD Rothblum, R Tell, E Yogev 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), 13-23, 2020 | 19 | 2020 |
| Improved bounds for quantified derandomization of constant-depth circuits and polynomials R Tell computational complexity 28 (2), 259-343, 2019 | 19 | 2019 |
| Derandomization with minimal memory footprint D Doron, R Tell 38th Computational Complexity Conference (CCC 2023), 11: 1-11: 15, 2023 | 13 | 2023 |
| Fooling constant-depth threshold circuits P Hatami, WM Hoza, A Tal, R Tell 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS …, 2022 | 13 | 2022 |
| Unstructured hardness to average-case randomness L Chen, RD Rothblum, R Tell 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS …, 2022 | 11 | 2022 |
| When arthur has neither random coins nor time to spare: Superfast derandomization of proof systems L Chen, R Tell Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 60-69, 2023 | 10 | 2023 |
| Proving that prBPP= prP is as hard as proving that “almost NP” is not contained in P/poly R Tell Information Processing Letters 152, 105841, 2019 | 9 | 2019 |
| A note on the limitations of two black-box techniques in quantified derandomization R Tell Electronic Colloquium on Computational Complexity (ECCC) 24 (187), 9, 2017 | 8 | 2017 |
| Opening up the distinguisher: A hardness to randomness approach for BPL= L that uses properties of BPL D Doron, E Pyne, R Tell Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2039-2049, 2024 | 7 | 2024 |
| A note on tolerant testing with one-sided error R Tell Computational Complexity and Property Testing: On the Interplay Between …, 2020 | 7 | 2020 |
| Derandomization vs refutation: A unified framework for characterizing derandomization L Chen, R Tell, R Williams 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS …, 2023 | 6 | 2023 |
| Guest column: New ways of studying the BPP= P conjecture L Chen, R Tell ACM SIGACT News 54 (2), 44-69, 2023 | 6 | 2023 |
| Expander-based cryptography meets natural proofs I Oliveira, R Santhanam, R Tell Innovations in Theoretical Computer Science (ITCS) 124, 2018 | 6 | 2018 |
| Depth-𝑑 Threshold Circuits vs. Depth-(𝑑+ 1) AND-OR Trees P Hatami, WM Hoza, A Tal, R Tell Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 895-904, 2023 | 5 | 2023 |
| Quantified derandomization: How to find water in the ocean R Tell Foundations and Trends® in Theoretical Computer Science 15 (1), 1-125, 2022 | 5 | 2022 |
Lijie ChenUC BerkeleyПодтвержден адрес электронной почты в домене berkeley.edu