Hanlin Ren

According to our database, Hanlin Ren authored at least 20 papers between 2018 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

NP-Hardness of Approximating Meta-Complexity: A Cryptographic Approach.

Yizhi Huang, Rahul Ilango, Hanlin Ren

Electron. Colloquium Comput. Complex., 2023

Bounded Relativization.

Shuichi Hirahara, Zhenjian Lu, Hanlin Ren

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

Polynomial-Time Pseudodeterministic Construction of Primes.

Lijie Chen, Zhenjian Lu, Igor Carboni Oliveira, Hanlin Ren, Rahul Santhanam

Electron. Colloquium Comput. Complex., 2023

Symmetric Exponential Time Requires Near-Maximum Circuit Size.

Lijie Chen, Shuichi Hirahara, Hanlin Ren

Electron. Colloquium Comput. Complex., 2023

Range Avoidance, Remote Point, and Hard Partial Truth Table via Satisfying-Pairs Algorithms.

Yeyuan Chen, Yizhi Huang, Jiatu Li, Hanlin Ren

Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

2022

Strong Average-Case Circuit Lower Bounds from Nontrivial Derandomization.

Lijie Chen, Hanlin Ren

SIAM J. Comput., June, 2022

Improved distance sensitivity oracles with subcubic preprocessing time.

Hanlin Ren

J. Comput. Syst. Sci., 2022

On the Range Avoidance Problem for Circuits.

Hanlin Ren, Rahul Santhanam, Zhikun Wang

Electron. Colloquium Comput. Complex., 2022

Robustness of average-case meta-complexity via pseudorandomness.

Rahul Ilango, Hanlin Ren, Rahul Santhanam

Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

Maintaining exact distances under multiple edge failures.

Ran Duan, Hanlin Ren

Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

2021

A Relativization Perspective on Meta-Complexity.

Hanlin Ren, Rahul Santhanam

Electron. Colloquium Comput. Complex., 2021

Hardness of KT Characterizes Parallel Cryptography.

Hanlin Ren, Rahul Santhanam

Electron. Colloquium Comput. Complex., 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

Constructing a Distance Sensitivity Oracle in O(n^2.5794M) Time.

Yong Gu, Hanlin Ren

CoRR, 2021

Approximate Distance Oracles Subject to Multiple Vertex Failures.

Ran Duan, Yong Gu, Hanlin Ren

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Constructing a Distance Sensitivity Oracle in O(n^2.5794 M) Time.

Yong Gu, Hanlin Ren

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

2020

Strong Average-Case Circuit Lower Bounds from Non-trivial Derandomization.

Lijie Chen, Hanlin Ren

Electron. Colloquium Comput. Complex., 2020

Strong average-case lower bounds from non-trivial derandomization.

Lijie Chen, Hanlin Ren

Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

2018

Approximating All-Pair Bounded-Leg Shortest Path and APSP-AF in Truly-Subcubic Time.

Ran Duan, Hanlin Ren

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018