Approximating All-Pair Bounded-Leg Shortest Path and APSP-AF in Truly-Subcubic Time. - Ran Duan; Hanlin Ren (ICALP, 2018)

Strong average-case lower bounds from non-trivial derandomization. - Lijie Chen 001; Hanlin Ren (STOC, 2020)

Strong Average-Case Circuit Lower Bounds from Non-trivial Derandomization. - Lijie Chen 001; Hanlin Ren (Electron. Colloquium Comput. Complex., 2020)

Constructing a Distance Sensitivity Oracle in O(n^2.5794 M) Time. - Yong Gu; Hanlin Ren (ICALP, 2021)

Approximate Distance Oracles Subject to Multiple Vertex Failures. - Ran Duan; Yong Gu; Hanlin Ren (SODA, 2021)

Constructing a Distance Sensitivity Oracle in O(n2.5794M) Time. - Yong Gu; Hanlin Ren (CoRR, 2021)

Hardness on any Samplable Distribution Suffices: New Characterizations of One-Way Functions by Meta-Complexity. - Rahul Ilango; Hanlin Ren; Rahul Santhanam (Electron. Colloquium Comput. Complex., 2021)

Hardness of KT Characterizes Parallel Cryptography. - Hanlin Ren; Rahul Santhanam (Electron. Colloquium Comput. Complex., 2021)

A Relativization Perspective on Meta-Complexity. - Hanlin Ren; Rahul Santhanam (Electron. Colloquium Comput. Complex., 2021)

Maintaining exact distances under multiple edge failures. - Ran Duan; Hanlin Ren (STOC, 2022)

Robustness of average-case meta-complexity via pseudorandomness. - Rahul Ilango; Hanlin Ren; Rahul Santhanam (STOC, 2022)

On the Range Avoidance Problem for Circuits. - Hanlin Ren; Rahul Santhanam; Zhikun Wang (Electron. Colloquium Comput. Complex., 2022)

Improved distance sensitivity oracles with subcubic preprocessing time. - Hanlin Ren (J. Comput. Syst. Sci., 2022)

Strong Average-Case Circuit Lower Bounds from Nontrivial Derandomization. - Lijie Chen 001; Hanlin Ren (SIAM J. Comput., 2022)

Range Avoidance, Remote Point, and Hard Partial Truth Table via Satisfying-Pairs Algorithms. - Yeyuan Chen; Yizhi Huang; Jiatu Li; Hanlin Ren (STOC, 2023)

Symmetric Exponential Time Requires Near-Maximum Circuit Size. - Lijie Chen 001; Shuichi Hirahara; Hanlin Ren (Electron. Colloquium Comput. Complex., 2023)

Polynomial-Time Pseudodeterministic Construction of Primes. - Lijie Chen 001; Zhenjian Lu; Igor Carboni Oliveira; Hanlin Ren; Rahul Santhanam (Electron. Colloquium Comput. Complex., 2023)

Range Avoidance, Remote Point, and Hard Partial Truth Tables via Satisfying-Pairs Algorithms. - Yeyuan Chen; Yizhi Huang; Jiatu Li; Hanlin Ren (Electron. Colloquium Comput. Complex., 2023)

Bounded Relativization. - Shuichi Hirahara; Zhenjian Lu; Hanlin Ren (Electron. Colloquium Comput. Complex., 2023)

NP-Hardness of Approximating Meta-Complexity: A Cryptographic Approach. - Yizhi Huang; Rahul Ilango; Hanlin Ren (Electron. Colloquium Comput. Complex., 2023)

Metamathematics of Resolution Lower Bounds: A TFNP Perspective. - Jiawei Li; Yuhao Li; Hanlin Ren (Electron. Colloquium Comput. Complex., 2024)

On the Complexity of Avoiding Heavy Elements. - Zhenjian Lu; Igor C. Oliveira 001; Hanlin Ren; Rahul Santhanam (Electron. Colloquium Comput. Complex., 2024)