Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Ren, Hanlin
290  Ergebnisse:
Personensuche X
?
1

Characteristics of psychological time in patients with depr..:

Ren, Hanlin ; Zhang, Qing ; Ren, Yanzhen...
Frontiers in Psychiatry.  14 (2023)  - p. , 2023
Link: https://doi.org/10.3389/..
 
?
2

Range Avoidance, Remote Point, and Hard Partial Truth Table..:

, In: Proceedings of the 55th Annual ACM Symposium on Theory of Computing,
Chen, Yeyuan ; Huang, Yizhi ; Li, Jiatu. - p. 1058-1066 , 2023
Link: https://dl.acm.org/doi/1..
 
?
3

Preschoolers Can Match the Facial and Bodily Emotional Expr..:

Ren, Hanlin ; Huang, Liang ; Du, Fangyuan...
SAGE Open.  13 (2023)  4 - p. , 2023
Link: https://doi.org/10.1177/..
 
?
4

Visible-Light Paternò–Büchi Reaction for Lipidomic Profilin..:

Shi, Hengxue ; Tan, Zhenshu ; Guo, Xiangyu...
Analytical Chemistry.  , 2023
Link: https://doi.org/10.1021/..
 
?
5

NP-Hardness of Approximating Meta-Complexity: A Cryptograph..:

, In: Proceedings of the 55th Annual ACM Symposium on Theory of Computing,
Huang, Yizhi ; Ilango, Rahul ; Ren, Hanlin - p. 1067-1075 , 2023
Link: https://dl.acm.org/doi/1..
 
?
6

Polynomial-Time Pseudodeterministic Construction of Primes:

, In: 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS),
Chen, Lijie ; Lu, Zhenjian ; Oliveira, Igor C... - p. 1261-1270 , 2023
Link: https://doi.org/10.1109/..
 
?
7

Strong Average-Case Circuit Lower Bounds from Nontrivial De..:

Chen, Lijie ; Ren, Hanlin
SIAM Journal on Computing.  51 (2022)  3 - p. STOC20-115-STOC20-173 , 2022
Link: https://doi.org/10.1137/..
 
?
8

Robustness of average-case meta-complexity via pseudorandom..:

, In: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing,
Ilango, Rahul ; Ren, Hanlin ; Santhanam, Rahul - p. 1575-1583 , 2022
Link: https://dl.acm.org/doi/1..
 
?
9

Maintaining exact distances under multiple edge failures:

, In: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing,
Duan, Ran ; Ren, Hanlin - p. 1093-1101 , 2022
Link: https://dl.acm.org/doi/1..
 
?
10

On the Range Avoidance Problem for Circuits:

, In: 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS),
Ren, Hanlin ; Santhanam, Rahul ; Wang, Zhikun - p. 640-650 , 2022
Link: https://doi.org/10.1109/..
 
?
11

Improved distance sensitivity oracles with subcubic preproc..:

Ren, Hanlin
Journal of Computer and System Sciences.  123 (2022)  - p. 159-170 , 2022
Link: https://doi.org/10.1016/..
 
?
12

Hardness of KT characterizes parallel cryptography:

, In: Proceedings of the 36th Computational Complexity Conference,
Ren, Hanlin ; Santhanam, Rahul - p. 1 ff. , 2021
Link: https://dl.acm.org/doi/1..
 
?
13

Approximate distance oracles subject to multiple vertex fai..:

, In: Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms,
Duan, Ran ; Gu, Yong ; Ren, Hanlin - p. 2497-2516 , 2021
Link: https://dl.acm.org/doi/1..
 
?
14

Mapping the distribution of double bond location isomers in..:

Ren, Hanlin ; Triebl, Alexander ; Muralidharan, Sneha...
The Analyst.  146 (2021)  12 - p. 3899-3907 , 2021
Link: https://doi.org/10.1039/..
 
?
15

Lipidome-wide characterization of phosphatidylinositols and..:

Xia, Tian ; Ren, Hanlin ; Zhang, Wenpeng.
Analytica Chimica Acta.  1128 (2020)  - p. 107-115 , 2020
Link: https://doi.org/10.1016/..
 
1-15