Hanlin Ren

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Polynomial-time pseudodeterministic construction of primes Journal of the ACM	2026-06-03	Paper
Constructing a distance sensitivity oracle in \(O(n^{2.5794}M)\) time	2026-05-12	Paper
Symmetric exponential time requires near-maximum circuit size Journal of the ACM	2026-04-09	Paper
NP-hardness of approximating meta-complexity: a cryptographic approach SIAM Journal on Computing	2025-08-21	Paper
Polynomial-time pseudodeterministic construction of primes	2025-08-15	Paper
On the range avoidance problem for circuits	2025-08-15	Paper
Bounded relativization	2024-11-19	Paper
Range avoidance, remote point, and hard partial truth table via satisfying-pairs algorithms	2024-05-08	Paper
NP-hardness of approximating meta-complexity: a cryptographic approach	2024-05-08	Paper
A relativization perspective on meta-complexity	2024-04-23	Paper
scientific article; zbMATH DE number 7788486 (Why is no real title available?) (available as arXiv preprint)	2024-01-15	Paper
Maintaining exact distances under multiple edge failures Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing	2023-12-08	Paper
Robustness of average-case meta-complexity via pseudorandomness Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing	2023-12-08	Paper
Hardness of KT characterizes parallel cryptography	2023-07-12	Paper
Improved Distance Sensitivity Oracles with Subcubic Preprocessing Time.	2023-02-07	Paper
Strong Average-Case Circuit Lower Bounds from Nontrivial Derandomization SIAM Journal on Computing	2022-05-31	Paper
Improved distance sensitivity oracles with subcubic preprocessing time Journal of Computer and System Sciences	2021-10-28	Paper
Improved distance sensitivity oracles with subcubic preprocessing time Journal of Computer and System Sciences	2021-10-28	Paper
Approximating all-pair bounded-leg shortest path and APSP-AF in truly-subcubic time	2021-07-28	Paper
Strong average-case lower bounds from non-trivial derandomization Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing	2021-01-19	Paper

Research outcomes over time

This page was built for person: Hanlin Ren