| Optimal error pseudodistributions for read-once branching programs E Chattopadhyay, JJ Liao arXiv preprint arXiv:2002.07208, 2020 | 21 | 2020 |
| Affine extractors for almost logarithmic entropy E Chattopadhyay, J Goodman, JJ Liao 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS …, 2022 | 18 | 2022 |
| On the complexity of simulating auxiliary input YH Chen, KM Chung, JJ Liao Annual International Conference on the Theory and Applications of …, 2018 | 15 | 2018 |
| Extractors for sum of two sources E Chattopadhyay, JJ Liao Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022 | 12 | 2022 |
| Non-malleability against polynomial tampering M Ball, E Chattopadhyay, JJ Liao, T Malkin, LY Tan Advances in Cryptology–CRYPTO 2020: 40th Annual International Cryptology …, 2020 | 8 | 2020 |
| Hardness against linear branching programs and more E Chattopadhyay, JJ Liao Leibniz International Proceedings in Informatics (LIPIcs): 38th …, 2023 | 5 | 2023 |
| Recursive error reduction for regular branching programs E Chattopadhyay, JJ Liao arXiv preprint arXiv:2309.04551, 2023 | 3 | 2023 |
| Hide-and-Seek and the Non-Resignability of the BUFF Transform J Don, S Fehr, YH Huang, JJ Liao, P Struck Cryptology ePrint Archive, 2024 | 1 | 2024 |
| Improved Exponent for Marton's Conjecture in JJ Liao arXiv preprint arXiv:2404.09639, 2024 | | 2024 |
| Extractors for Additive Structures and Space-bounded Computation JJ Liao Cornell University, 2024 | | 2024 |
| Toward Derandomizing RL via Graph Connectivity JJ Liao, WK Lin | | 2018 |
