Hanlin Ren

From MaRDI portal
Person:2237897

Available identifiers

zbMath Open ren.hanlinMaRDI QIDQ2237897

List of research outcomes





PublicationDate of PublicationType
Bounded relativization2024-11-19Paper
Range avoidance, remote point, and hard partial truth table via satisfying-pairs algorithms2024-05-08Paper
NP-hardness of approximating meta-complexity: a cryptographic approach2024-05-08Paper
A relativization perspective on meta-complexity2024-04-23Paper
https://portal.mardi4nfdi.de/entity/Q61474042024-01-15Paper
Maintaining exact distances under multiple edge failures2023-12-08Paper
Robustness of average-case meta-complexity via pseudorandomness2023-12-08Paper
Hardness of KT characterizes parallel cryptography2023-07-12Paper
Improved Distance Sensitivity Oracles with Subcubic Preprocessing Time.2023-02-07Paper
Strong Average-Case Circuit Lower Bounds from Nontrivial Derandomization2022-05-31Paper
Improved distance sensitivity oracles with subcubic preprocessing time2021-10-28Paper
Approximating All-Pair Bounded-Leg Shortest Path and APSP-AF in Truly-Subcubic Time2021-07-28Paper
Strong average-case lower bounds from non-trivial derandomization2021-01-19Paper

Research outcomes over time

This page was built for person: Hanlin Ren

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Person:2237897&oldid=7409417"
Powered by MediaWiki