Sledovat
Roei Tell
Název
Citace
Citace
Rok
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
392019
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
332017
Hardness vs randomness, revised: Uniform, non-black-box, and instance-wise
L Chen, R Tell
2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS …, 2022
252022
Quantified derandomization of linear threshold circuits
R Tell
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018
252018
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
232021
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
152020
Improved bounds for quantified derandomization of constant-depth circuits and polynomials
R Tell
computational complexity 28 (2), 259-343, 2019
152019
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
112022
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
92019
Derandomization with minimal memory footprint
D Doron, R Tell
38th Computational Complexity Conference (CCC 2023), 2023
82023
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
72023
Unstructured hardness to average-case randomness
L Chen, RD Rothblum, R Tell
2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS …, 2022
72022
A note on tolerant testing with one-sided error
R Tell
Computational Complexity and Property Testing: On the Interplay Between …, 2020
72020
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
72017
Expander-based cryptography meets natural proofs
I Oliveira, R Santhanam, R Tell
Innovations in Theoretical Computer Science (ITCS) 124, 2018
52018
On being far from far and on dual problems in property testing
R Tell
Proceedings of the 2016 ACM Conference on Innovations in Theoretical …, 2016
52016
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
42023
Quantified derandomization: how to find water in the ocean
R Tell
Foundations and Trends® in Theoretical Computer Science 15 (1), 1-125, 2022
42022
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
32024
Guest Column: New ways of studying the BPP= P conjecture
L Chen, R Tell
ACM SIGACT News 54 (2), 44-69, 2023
32023
Systém momentálně nemůže danou operaci provést. Zkuste to znovu později.
Články 1–20