关注
Hanlin Ren
Hanlin Ren
在 cs.ox.ac.uk 的电子邮件经过验证 - 首页
标题
引用次数
引用次数
年份
Strong average-case circuit lower bounds from nontrivial derandomization
L Chen, H Ren
SIAM Journal on Computing 51 (3), STOC20-115-STOC20-173, 2021
33*2021
Robustness of average-case meta-complexity via pseudorandomness
R Ilango, H Ren, R Santhanam
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022
24*2022
Constructing a Distance Sensitivity Oracle in Time
Y Gu, H Ren
arXiv preprint arXiv:2102.08569, 2021
232021
Hardness of KT characterizes parallel cryptography
H Ren, R Santhanam
Cryptology ePrint Archive, 2021
222021
Improved distance sensitivity oracles with subcubic preprocessing time
H Ren
Journal of Computer and System Sciences 123, 159-170, 2022
162022
On the range avoidance problem for circuits
H Ren, R Santhanam, Z Wang
2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS …, 2022
142022
Maintaining exact distances under multiple edge failures
R Duan, H Ren
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022
92022
A relativization perspective on meta-complexity
H Ren, R Santhanam
39th International Symposium on Theoretical Aspects of Computer Science …, 2022
92022
Approximate distance oracles subject to multiple vertex failures
R Duan, Y Gu, H Ren
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021
92021
Approximating all-pair bounded-leg shortest path and APSP-AF in truly-subcubic time
R Duan, H Ren
45th International Colloquium on Automata, Languages, and Programming (ICALP …, 2018
52018
Polynomial-Time Pseudodeterministic Construction of Primes
L Chen, Z Lu, IC Oliveira, H Ren, R Santhanam
2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS …, 2023
42023
NP-Hardness of Approximating Meta-Complexity: A Cryptographic Approach
Y Huang, R Ilango, H Ren
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 1067-1075, 2023
42023
Range avoidance, remote point, and hard partial truth table via satisfying-pairs algorithms
Y Chen, Y Huang, J Li, H Ren
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 1058-1066, 2023
22023
Bounded relativization
S Hirahara, Z Lu, H Ren
Leibniz international proceedings in informatics, 2023
12023
Symmetric Exponential Time Requires Near-Maximum Circuit Size
L Chen, S Hirahara, H Ren
arXiv preprint arXiv:2309.12912, 2023
2023
系统目前无法执行此操作,请稍后再试。
文章 1–15