default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHanlin Ren
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c15]Lijie Chen
, Shuichi Hirahara, Hanlin Ren:
Symmetric Exponential Time Requires Near-Maximum Circuit Size. STOC 2024: 1990-1999- [i19]Zhenjian Lu, Igor C. Oliveira, Hanlin Ren, Rahul Santhanam:
On the Complexity of Avoiding Heavy Elements. Electron. Colloquium Comput. Complex. TR24 (2024) - 2023
- [c14]Shuichi Hirahara, Zhenjian Lu, Hanlin Ren:
Bounded Relativization. CCC 2023: 6:1-6:45 - [c13]Lijie Chen, Zhenjian Lu, Igor C. Oliveira, Hanlin Ren, Rahul Santhanam:
Polynomial-Time Pseudodeterministic Construction of Primes. FOCS 2023: 1261-1270 - [c12]Yeyuan Chen, Yizhi Huang, Jiatu Li, Hanlin Ren:
Range Avoidance, Remote Point, and Hard Partial Truth Table via Satisfying-Pairs Algorithms. STOC 2023: 1058-1066 - [c11]Yizhi Huang, Rahul Ilango, Hanlin Ren:
NP-Hardness of Approximating Meta-Complexity: A Cryptographic Approach. STOC 2023: 1067-1075 - [i18]Lijie Chen, Zhenjian Lu, Igor C. Oliveira, Hanlin Ren, Rahul Santhanam:
Polynomial-Time Pseudodeterministic Construction of Primes. CoRR abs/2305.15140 (2023) - [i17]Lijie Chen, Shuichi Hirahara, Hanlin Ren:
Symmetric Exponential Time Requires Near-Maximum Circuit Size. CoRR abs/2309.12912 (2023) - [i16]Lijie Chen, Shuichi Hirahara, Hanlin Ren:
Symmetric Exponential Time Requires Near-Maximum Circuit Size. Electron. Colloquium Comput. Complex. TR23 (2023) - [i15]Lijie Chen, Zhenjian Lu, Igor Carboni Oliveira, Hanlin Ren, Rahul Santhanam:
Polynomial-Time Pseudodeterministic Construction of Primes. Electron. Colloquium Comput. Complex. TR23 (2023) - [i14]Yeyuan Chen, Yizhi Huang, Jiatu Li, Hanlin Ren:
Range Avoidance, Remote Point, and Hard Partial Truth Tables via Satisfying-Pairs Algorithms. Electron. Colloquium Comput. Complex. TR23 (2023) - [i13]Shuichi Hirahara, Zhenjian Lu, Hanlin Ren:
Bounded Relativization. Electron. Colloquium Comput. Complex. TR23 (2023) - [i12]Yizhi Huang, Rahul Ilango, Hanlin Ren:
NP-Hardness of Approximating Meta-Complexity: A Cryptographic Approach. Electron. Colloquium Comput. Complex. TR23 (2023) - [i11]Yizhi Huang, Rahul Ilango, Hanlin Ren:
NP-Hardness of Approximating Meta-Complexity: A Cryptographic Approach. IACR Cryptol. ePrint Arch. 2023: 528 (2023) - 2022
- [j2]Hanlin Ren:
Improved distance sensitivity oracles with subcubic preprocessing time. J. Comput. Syst. Sci. 123: 159-170 (2022) - [j1]Lijie Chen, Hanlin Ren:
Strong Average-Case Circuit Lower Bounds from Nontrivial Derandomization. SIAM J. Comput. 51(3): 20-115 (2022) - [c10]Hanlin Ren, Rahul Santhanam, Zhikun Wang:
On the Range Avoidance Problem for Circuits. FOCS 2022: 640-650 - [c9]Hanlin Ren, Rahul Santhanam:
A Relativization Perspective on Meta-Complexity. STACS 2022: 54:1-54:13 - [c8]Ran Duan, Hanlin Ren:
Maintaining exact distances under multiple edge failures. STOC 2022: 1093-1101 - [c7]Rahul Ilango, Hanlin Ren, Rahul Santhanam:
Robustness of average-case meta-complexity via pseudorandomness. STOC 2022: 1575-1583 - [i10]Hanlin Ren, Rahul Santhanam, Zhikun Wang:
On the Range Avoidance Problem for Circuits. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [c6]Hanlin Ren, Rahul Santhanam:
Hardness of KT Characterizes Parallel Cryptography. CCC 2021: 35:1-35:58 - [c5]Yong Gu, Hanlin Ren:
Constructing a Distance Sensitivity Oracle in O(n^2.5794 M) Time. ICALP 2021: 76:1-76:20 - [c4]Ran Duan, Yong Gu, Hanlin Ren:
Approximate Distance Oracles Subject to Multiple Vertex Failures. SODA 2021: 2497-2516 - [i9]Yong Gu, Hanlin Ren:
Constructing a Distance Sensitivity Oracle in O(n2.5794M) Time. CoRR abs/2102.08569 (2021) - [i8]Ran Duan, Hanlin Ren:
Maintaining Exact Distances under Multiple Edge Failures. CoRR abs/2111.03360 (2021) - [i7]Rahul Ilango, Hanlin Ren, Rahul Santhanam:
Hardness on any Samplable Distribution Suffices: New Characterizations of One-Way Functions by Meta-Complexity. Electron. Colloquium Comput. Complex. TR21 (2021) - [i6]Hanlin Ren, Rahul Santhanam:
Hardness of KT Characterizes Parallel Cryptography. Electron. Colloquium Comput. Complex. TR21 (2021) - [i5]Hanlin Ren, Rahul Santhanam:
A Relativization Perspective on Meta-Complexity. Electron. Colloquium Comput. Complex. TR21 (2021) - [i4]Hanlin Ren, Rahul Santhanam:
Hardness of KT Characterizes Parallel Cryptography. IACR Cryptol. ePrint Arch. 2021: 1076 (2021) - 2020
- [c3]Hanlin Ren:
Improved Distance Sensitivity Oracles with Subcubic Preprocessing Time. ESA 2020: 79:1-79:13 - [c2]Lijie Chen, Hanlin Ren:
Strong average-case lower bounds from non-trivial derandomization. STOC 2020: 1327-1334 - [i3]Ran Duan, Yong Gu, Hanlin Ren:
Approximate Distance Oracles Subject to Multiple Vertex Failures. CoRR abs/2002.06812 (2020) - [i2]Hanlin Ren:
Improved Distance Sensitivity Oracles with Subcubic Preprocessing Time. CoRR abs/2007.11495 (2020) - [i1]Lijie Chen, Hanlin Ren:
Strong Average-Case Circuit Lower Bounds from Non-trivial Derandomization. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2018
- [c1]Ran Duan, Hanlin Ren:
Approximating All-Pair Bounded-Leg Shortest Path and APSP-AF in Truly-Subcubic Time. ICALP 2018: 42:1-42:12
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
