Hanlin Ren

I am a fifth-year undergraduate at Institute for Interdisciplinary Information Sciences, Tsinghua University.

I am interested in Theoretical Computer Science, in particular Algorithm Design and Computational Complexity.

[Google Scholar], [DBLP], [Twitter], ORCID iD icon


  • rhl16 at mails dot tsinghua dot edu dot cn.

  • h4n1in dot r3n at gmail dot com.

Note: click paper titles to view paper summaries!


(In Theoretical Computer Science, the list of authors are usually sorted in alphabetical order.)

Approximate Distance Oracles Subject to Multiple Vertex Failures

Improved Distance Sensitivity Oracles with Subcubic Preprocessing Time

  • Hanlin Ren

  • In 28th Annual European Symposium on Algorithms (ESA 2020)

  • arXiv version

    • For the difference between these two versions, see “Related Version” section of arXiv version.

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

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

Manuscripts / In Submission

Constructing a Distance Sensitivity Oracle in \(O(n^{2.5794}M)\) Time

A Relativization Perspective on Meta-Complexity

Hardness of \({\rm KT}\) Characterizes Parallel Cryptography