| Strong average-case lower bounds from non-trivial derandomization L Chen, H Ren Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing …, 2020 | 33 | 2020 |
| Robustness of average-case meta-complexity via pseudorandomness R Ilango, H Ren, R Santhanam Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022 | 29* | 2022 |
| Hardness of KT characterizes parallel cryptography H Ren, R Santhanam Cryptology ePrint Archive, 2021 | 29 | 2021 |
| Constructing a Distance Sensitivity Oracle in Time Y Gu, H Ren arXiv preprint arXiv:2102.08569, 2021 | 24 | 2021 |
| Improved distance sensitivity oracles with subcubic preprocessing time H Ren Journal of Computer and System Sciences 123, 159-170, 2022 | 18 | 2022 |
| On the range avoidance problem for circuits H Ren, R Santhanam, Z Wang 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS …, 2022 | 16 | 2022 |
| Maintaining exact distances under multiple edge failures R Duan, H Ren Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022 | 12 | 2022 |
| Approximate distance oracles subject to multiple vertex failures R Duan, Y Gu, H Ren Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021 | 11 | 2021 |
| A relativization perspective on meta-complexity H Ren, R Santhanam 39th International Symposium on Theoretical Aspects of Computer Science …, 2022 | 10 | 2022 |
| Polynomial-time pseudodeterministic construction of primes L Chen, Z Lu, IC Oliveira, H Ren, R Santhanam 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS …, 2023 | 7 | 2023 |
| NP-Hardness of Approximating Meta-Complexity: A Cryptographic Approach Y Huang, R Ilango, H Ren Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 1067-1075, 2023 | 6 | 2023 |
| Range avoidance, remote point, and hard partial truth table via satisfying-pairs algorithms Y Chen, Y Huang, J Li, H Ren Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 1058-1066, 2023 | 5 | 2023 |
| Approximating all-pair bounded-leg shortest path and APSP-AF in truly-subcubic time R Duan, H Ren 45th International Colloquium on Automata, Languages, and Programming (ICALP …, 2018 | 5 | 2018 |
| Symmetric Exponential Time Requires Near-Maximum Circuit Size L Chen, S Hirahara, H Ren Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 1990-1999, 2024 | 2 | 2024 |
| Bounded relativization S Hirahara, Z Lu, H Ren Leibniz international proceedings in informatics, 2023 | 2 | 2023 |
| On the Complexity of Avoiding Heavy Elements Z Lu, IC Oliveira, H Ren, R Santhanam | | 2024 |
Rahul SanthanamUniversity of OxfordVerified email at cs.ox.ac.uk
