Hanlin Ren

51 papers A* 12A 7Journal 32
YearRankTypeTitle / Venue / Authors
2026 A conf
Hardness of Range Avoidance and Proof Complexity Generators from Demi-Bits.
ITCS
Hanlin Ren, Yichuan Wang, Yan Zhong
2026 A conf
New Algebrization Barriers to Circuit Lower Bounds via Communication Complexity of Missing-String.
ITCS
Lijie Chen, Yang Hu, Hanlin Ren
2026 J jnl
Symmetric Exponential Time Requires Near-Maximum Circuit Size.
J. ACM
Lijie Chen, Shuichi Hirahara, Zeyong Li, Hanlin Ren
2026 A conf
Total Search Problems in ZPP.
ITCS
Noah Fleming, Stefan Grosser, Siddhartha Jain, Jiawei Li, Hanlin Ren, Morgan Shirley, Weiqiang Yuan
2025 J jnl
Hardness of Range Avoidance and Proof Complexity Generators from Demi-Bits.
CoRR
Hanlin Ren, Yichuan Wang, Yan Zhong
2025 J jnl
Hardness of Range Avoidance and Proof Complexity Generators from Demi-Bits.
Electron. Colloquium Comput. Complex.
Hanlin Ren, Yichuan Wang, Yan Zhong
2025 J jnl
Hardness of Range Avoidance and Proof Complexity Generators from Demi-Bits.
IACR Cryptol. ePrint Arch.
Hanlin Ren, Yichuan Wang, Yan Zhong
2025 J jnl
NP-Hardness of Approximating Meta-Complexity: A Cryptographic Approach.
SIAM J. Comput.
Yizhi Huang, Rahul Ilango, Hanlin Ren
2025 J jnl
New Algebrization Barriers to Circuit Lower Bounds via Communication Complexity of Missing-String.
CoRR
Lijie Chen, Yang Hu, Hanlin Ren
2025 J jnl
New Algebrization Barriers to Circuit Lower Bounds via Communication Complexity of Missing-String.
Electron. Colloquium Comput. Complex.
Lijie Chen, Yang Hu, Hanlin Ren
2025 J jnl
Total Search Problems in ZPP.
CoRR
Noah Fleming, Stefan Grosser, Siddhartha Jain, Jiawei Li, Hanlin Ren, Morgan Shirley, Weiqiang Yuan
2025 J jnl
Total Search Problems in ZPP.
Electron. Colloquium Comput. Complex.
Noah Fleming, Stefan Grosser, Siddhartha Jain, Jiawei Li, Hanlin Ren, Morgan Shirley, Weiqiang Yuan
2024 J jnl
Metamathematics of Resolution Lower Bounds: A TFNP Perspective.
CoRR
Jiawei Li, Yuhao Li, Hanlin Ren
2024 J jnl
Metamathematics of Resolution Lower Bounds: A TFNP Perspective.
Electron. Colloquium Comput. Complex.
Jiawei Li, Yuhao Li, Hanlin Ren
2024 A* conf
On the Complexity of Avoiding Heavy Elements.
FOCS
Zhenjian Lu, Igor C. Oliveira, Hanlin Ren, Rahul Santhanam
2024 J jnl
On the Complexity of Avoiding Heavy Elements.
Electron. Colloquium Comput. Complex.
Zhenjian Lu, Igor C. Oliveira, Hanlin Ren, Rahul Santhanam
2024 A* conf
Symmetric Exponential Time Requires Near-Maximum Circuit Size.
STOC
Lijie Chen, Shuichi Hirahara, Hanlin Ren
2023 A conf
Bounded Relativization.
CCC
Shuichi Hirahara, Zhenjian Lu, Hanlin Ren
2023 J jnl
Bounded Relativization.
Electron. Colloquium Comput. Complex.
Shuichi Hirahara, Zhenjian Lu, Hanlin Ren
2023 A* conf
NP-Hardness of Approximating Meta-Complexity: A Cryptographic Approach.
STOC
Yizhi Huang, Rahul Ilango, Hanlin Ren
2023 J jnl
NP-Hardness of Approximating Meta-Complexity: A Cryptographic Approach.
Electron. Colloquium Comput. Complex.
Yizhi Huang, Rahul Ilango, Hanlin Ren
2023 J jnl
NP-Hardness of Approximating Meta-Complexity: A Cryptographic Approach.
IACR Cryptol. ePrint Arch.
Yizhi Huang, Rahul Ilango, Hanlin Ren
2023 A* conf
Polynomial-Time Pseudodeterministic Construction of Primes.
FOCS
Lijie Chen, Zhenjian Lu, Igor C. Oliveira, Hanlin Ren, Rahul Santhanam
2023 J jnl
Polynomial-Time Pseudodeterministic Construction of Primes.
CoRR
Lijie Chen, Zhenjian Lu, Igor C. Oliveira, Hanlin Ren, Rahul Santhanam
2023 J jnl
Polynomial-Time Pseudodeterministic Construction of Primes.
Electron. Colloquium Comput. Complex.
Lijie Chen, Zhenjian Lu, Igor Carboni Oliveira, Hanlin Ren, Rahul Santhanam
2023 A* conf
Range Avoidance, Remote Point, and Hard Partial Truth Table via Satisfying-Pairs Algorithms.
STOC
Yeyuan Chen, Yizhi Huang, Jiatu Li, Hanlin Ren
2023 J jnl
Range Avoidance, Remote Point, and Hard Partial Truth Tables via Satisfying-Pairs Algorithms.
Electron. Colloquium Comput. Complex.
Yeyuan Chen, Yizhi Huang, Jiatu Li, Hanlin Ren
2023 J jnl
Symmetric Exponential Time Requires Near-Maximum Circuit Size.
CoRR
Lijie Chen, Shuichi Hirahara, Hanlin Ren
2023 J jnl
Symmetric Exponential Time Requires Near-Maximum Circuit Size.
Electron. Colloquium Comput. Complex.
Lijie Chen, Shuichi Hirahara, Hanlin Ren
2022 A conf
A Relativization Perspective on Meta-Complexity.
STACS
Hanlin Ren, Rahul Santhanam
2022 J jnl
Improved distance sensitivity oracles with subcubic preprocessing time.
J. Comput. Syst. Sci.
Hanlin Ren
2022 A* conf
Maintaining exact distances under multiple edge failures.
STOC
Ran Duan, Hanlin Ren
2022 A* conf
On the Range Avoidance Problem for Circuits.
FOCS
Hanlin Ren, Rahul Santhanam, Zhikun Wang
2022 J jnl
On the Range Avoidance Problem for Circuits.
Electron. Colloquium Comput. Complex.
Hanlin Ren, Rahul Santhanam, Zhikun Wang
2022 A* conf
Robustness of average-case meta-complexity via pseudorandomness.
STOC
Rahul Ilango, Hanlin Ren, Rahul Santhanam
2022 J jnl
Strong Average-Case Circuit Lower Bounds from Nontrivial Derandomization.
SIAM J. Comput.
Lijie Chen, Hanlin Ren
2021 J jnl
A Relativization Perspective on Meta-Complexity.
Electron. Colloquium Comput. Complex.
Hanlin Ren, Rahul Santhanam
2021 A* conf
Approximate Distance Oracles Subject to Multiple Vertex Failures.
SODA
Ran Duan, Yong Gu, Hanlin Ren
2021 J jnl
Constructing a Distance Sensitivity Oracle in O(n
CoRR
Yong Gu, Hanlin Ren
2021 A* conf
Constructing a Distance Sensitivity Oracle in O(n^2.5794 M) Time.
ICALP
Yong Gu, Hanlin Ren
2021 A conf
Hardness of KT Characterizes Parallel Cryptography.
CCC
Hanlin Ren, Rahul Santhanam
2021 J jnl
Hardness of KT Characterizes Parallel Cryptography.
Electron. Colloquium Comput. Complex.
Hanlin Ren, Rahul Santhanam
2021 J jnl
Hardness of KT Characterizes Parallel Cryptography.
IACR Cryptol. ePrint Arch.
Hanlin Ren, Rahul Santhanam
2021 J jnl
Hardness on any Samplable Distribution Suffices: New Characterizations of One-Way Functions by Meta-Complexity.
Electron. Colloquium Comput. Complex.
Rahul Ilango, Hanlin Ren, Rahul Santhanam
2021 J jnl
Maintaining Exact Distances under Multiple Edge Failures.
CoRR
Ran Duan, Hanlin Ren
2020 J jnl
Approximate Distance Oracles Subject to Multiple Vertex Failures.
CoRR
Ran Duan, Yong Gu, Hanlin Ren
2020 A conf
Improved Distance Sensitivity Oracles with Subcubic Preprocessing Time.
ESA
Hanlin Ren
2020 J jnl
Improved Distance Sensitivity Oracles with Subcubic Preprocessing Time.
CoRR
Hanlin Ren
2020 J jnl
Strong Average-Case Circuit Lower Bounds from Non-trivial Derandomization.
Electron. Colloquium Comput. Complex.
Lijie Chen, Hanlin Ren
2020 A* conf
Strong average-case lower bounds from non-trivial derandomization.
STOC
Lijie Chen, Hanlin Ren
2018 A* conf
Approximating All-Pair Bounded-Leg Shortest Path and APSP-AF in Truly-Subcubic Time.
ICALP
Ran Duan, Hanlin Ren