default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYanyi Liu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j6]Shuyi Di, Yin Wu
, Yanyi Liu:
Research on a Method for Classifying Bolt Corrosion Based on an Acoustic Emission Sensor System. Sensors 24(15): 5047 (2024)- [j5]Kai Niu, Yanyi Liu, Yuzhou Long, Yan Huang, Liang Wang, Yanning Zhang:
An Overview of Text-Based Person Search: Recent Advances and Future Directions. IEEE Trans. Circuits Syst. Video Technol. 34(9): 7803-7819 (2024) - [c14]Yanyi Liu, Rafael Pass:
A Direct PRF Construction from Kolmogorov Complexity. EUROCRYPT (4) 2024: 375-406 - [i30]Tiezheng Guo, Chen Wang, Yanyi Liu, Jiawei Tang, Pan Li, Sai Xu, Qingwen Yang, Xianlin Gao, Zhi Li, Yingyou Wen:
Leveraging Inter-Chunk Interactions for Enhanced Retrieval in Large Language Model-Based Question Answering. CoRR abs/2408.02907 (2024) - [i29]Marshall Ball, Yanyi Liu, Noam Mazor, Rafael Pass:
Kolmogorov Comes to Cryptomania: On Interactive Kolmogorov Complexity and Key-Agreement. Electron. Colloquium Comput. Complex. TR24 (2024) - [i28]Yanyi Liu, Noam Mazor, Rafael Pass:
A Note on Zero-Knowledge for NP and One-Way Functions. Electron. Colloquium Comput. Complex. TR24 (2024) - [i27]Yanyi Liu, Rafael Pass:
A Direct PRF Construction from Kolmogorov Complexity. Electron. Colloquium Comput. Complex. TR24 (2024) - [i26]Yanyi Liu, Rafael Pass:
A Direct PRF Construction from Kolmogorov Complexity. IACR Cryptol. ePrint Arch. 2024: 399 (2024) - [i25]Marshall Ball, Yanyi Liu, Noam Mazor, Rafael Pass:
Kolmogorov Comes to Cryptomania: On Interactive Kolmogorov Complexity and Key-Agreement. IACR Cryptol. ePrint Arch. 2024: 425 (2024) - [i24]Yanyi Liu, Noam Mazor, Rafael Pass:
A Note on Zero-Knowledge for NP and One-Way Functions. IACR Cryptol. ePrint Arch. 2024: 800 (2024) - 2023
- [j4]Yanyi Liu, Rafael Pass:
Toward Basing Cryptography on the Hardness of EXP. Commun. ACM 66(5): 91-99 (2023) - [j3]Yufei Wang, Jun Liu, Yu Tong, Qingwen Yang, Yanyi Liu, Hanbo Mou:
Resource scheduling in mobile edge computing using improved ant colony algorithm for space information network. Int. J. Satell. Commun. Netw. 41(4): 331-356 (2023) - [c13]Yanyi Liu, Rafael Pass:
Leakage-Resilient Hardness vs Randomness. CCC 2023: 32:1-32:20 - [c12]Yanyi Liu, Rafael Pass:
One-Way Functions and the Hardness of (Probabilistic) Time-Bounded Kolmogorov Complexity w.r.t. Samplable Distributions. CRYPTO (2) 2023: 645-673 - [c11]Marshall Ball, Yanyi Liu, Noam Mazor, Rafael Pass:
Kolmogorov Comes to Cryptomania: On Interactive Kolmogorov Complexity and Key-Agreement. FOCS 2023: 458-483 - [c10]Yanyi Liu, Rafael Pass:
On One-Way Functions and Sparse Languages. TCC (1) 2023: 219-237 - [c9]Hancong Wang, Yin Wu, Yanyi Liu, Wenbo Liu:
A Cross-Layer Framework for LPWAN Management based on Fuzzy Cognitive Maps with Adaptive Glowworm Swarm Optimization. WCNC 2023: 1-6 - [i23]Bruno Cavalar, Eli Goldin, Matthew Gray, Peter Hall, Yanyi Liu, Angelos Pelecanos:
On the Computational Hardness of Quantum One-Wayness. CoRR abs/2312.08363 (2023) - [i22]Tiezheng Guo, Qingwen Yang, Chen Wang, Yanyi Liu, Pan Li, Jiawei Tang, Dapeng Li, Yingyou Wen:
KnowledgeNavigator: Leveraging Large Language Models for Enhanced Reasoning over Knowledge Graph. CoRR abs/2312.15880 (2023) - [i21]Yanyi Liu, Rafael Pass:
On One-way Functions and the Worst-case Hardness of Time-Bounded Kolmogorov Complexity. Electron. Colloquium Comput. Complex. TR23 (2023) - [i20]Yanyi Liu, Rafael Pass:
One-way Functions and Hardness of (Probabilistic) Time-Bounded Kolmogorov Complexity w.r.t. Samplable Distributions. Electron. Colloquium Comput. Complex. TR23 (2023) - [i19]Yanyi Liu, Rafael Pass:
On One-way Functions and the Worst-case Hardness of Time-Bounded Kolmogorov Complexity. IACR Cryptol. ePrint Arch. 2023: 1086 (2023) - [i18]Yanyi Liu, Rafael Pass:
One-way Functions and Hardness of (Probabilistic) Time-Bounded Kolmogorov Complexity w.r.t. Samplable Distributions. IACR Cryptol. ePrint Arch. 2023: 1591 (2023) - 2022
- [c8]Yanyi Liu, Rafael Pass:
Characterizing Derandomization Through Hardness of Levin-Kolmogorov Complexity. CCC 2022: 35:1-35:17 - [c7]Yanyi Liu, Rafael Pass:
On One-Way Functions from NP-Complete Problems. CCC 2022: 36:1-36:24 - [c6]Yue Zhou, Xue Yang, Gefan Zhang, Jiabao Wang, Yanyi Liu, Liping Hou, Xue Jiang, Xingzhao Liu, Junchi Yan, Chengqi Lyu, Wenwei Zhang, Kai Chen:
MMRotate: A Rotated Object Detection Benchmark using PyTorch. ACM Multimedia 2022: 7331-7334 - [i17]Yue Zhou, Xue Yang, Gefan Zhang, Jiabao Wang, Yanyi Liu, Liping Hou, Xue Jiang, Xingzhao Liu, Junchi Yan, Chengqi Lyu, Wenwei Zhang, Kai Chen:
MMRotate: A Rotated Object Detection Benchmark using Pytorch. CoRR abs/2204.13317 (2022) - [i16]Chengqi Lyu, Wenwei Zhang, Haian Huang, Yue Zhou, Yudong Wang, Yanyi Liu, Shilong Zhang, Kai Chen:
RTMDet: An Empirical Study of Designing Real-Time Object Detectors. CoRR abs/2212.07784 (2022) - [i15]Yanyi Liu, Rafael Pass:
Characterizing Derandomization Through Hardness of Levin-Kolmogorov Complexity. Electron. Colloquium Comput. Complex. TR22 (2022) - [i14]Yanyi Liu, Rafael Pass:
Leakage-Resilient Hardness v.s. Randomness. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [c5]Yanyi Liu, Rafael Pass:
On the Possibility of Basing Cryptography on EXP≠ BPP. CRYPTO (1) 2021: 11-40 - [c4]Yanyi Liu, Rafael Pass:
Cryptography from sublinear-time average-case hardness of time-bounded Kolmogorov complexity. STOC 2021: 722-735 - [i13]Yanyi Liu, Rafael Pass:
Cryptography from Sublinear-Time Average-Case Hardness of Time-Bounded Kolmogorov Complexity. Electron. Colloquium Comput. Complex. TR21 (2021) - [i12]Yanyi Liu, Rafael Pass:
On the Possibility of Basing Cryptography on $\EXP \neq \BPP$. Electron. Colloquium Comput. Complex. TR21 (2021) - [i11]Yanyi Liu, Rafael Pass:
On One-way Functions from NP-Complete Problems. Electron. Colloquium Comput. Complex. TR21 (2021) - [i10]Yanyi Liu, Rafael Pass:
A Note on One-way Functions and Sparse Languages. Electron. Colloquium Comput. Complex. TR21 (2021) - [i9]Yanyi Liu, Rafael Pass:
On One-way Functions from NP-Complete Problems. IACR Cryptol. ePrint Arch. 2021: 513 (2021) - [i8]Yanyi Liu, Rafael Pass:
Cryptography from Sublinear-Time Average-Case Hardness of Time-Bounded Kolmogorov Complexity. IACR Cryptol. ePrint Arch. 2021: 517 (2021) - [i7]Yanyi Liu, Rafael Pass:
On the Possibility of Basing Cryptography on $\EXP \neq \BPP$. IACR Cryptol. ePrint Arch. 2021: 535 (2021) - [i6]Yanyi Liu, Rafael Pass:
A Note on One-way Functions and Sparse Languages. IACR Cryptol. ePrint Arch. 2021: 890 (2021) - 2020
- [c3]Yanyi Liu, Rafael Pass:
On One-way Functions and Kolmogorov Complexity. FOCS 2020: 1243-1254 - [c2]Rex Fernando, Ilan Komargodski, Yanyi Liu, Elaine Shi:
Secure Massively Parallel Computation for Dishonest Majority. TCC (2) 2020: 379-409 - [i5]Yanyi Liu, Rafael Pass:
On One-way Functions and Kolmogorov Complexity. CoRR abs/2009.11514 (2020) - [i4]Yanyi Liu, Rafael Pass:
On One-way Functions and Kolmogorov Complexity. Electron. Colloquium Comput. Complex. TR20 (2020) - [i3]Yanyi Liu, Rafael Pass:
On One-way Functions and Kolmogorov Complexity. IACR Cryptol. ePrint Arch. 2020: 423 (2020) - [i2]Rex Fernando, Ilan Komargodski, Yanyi Liu, Elaine Shi:
Secure Massively Parallel Computation for Dishonest Majority. IACR Cryptol. ePrint Arch. 2020: 1157 (2020)
2010 – 2019
- 2019
- [c1]Vipul Goyal, Yanyi Liu, Yifan Song:
Communication-Efficient Unconditional MPC with Guaranteed Output Delivery. CRYPTO (2) 2019: 85-114 - [i1]Vipul Goyal, Yanyi Liu, Yifan Song:
Communication-Efficient Unconditional MPC with Guaranteed Output Delivery. IACR Cryptol. ePrint Arch. 2019: 646 (2019) - 2018
- [j2]Yanyi Liu, Wenbo Liu, Yin Wu:
Associative Memory Realized by Reconfigurable Coupled Three-Cell CNNs. Neural Process. Lett. 48(2): 1123-1134 (2018) - 2014
- [j1]Yanyi Liu, Wenbo Liu:
A new design for reconfigurable XOR function based on cellular neural networks. Connect. Sci. 26(4): 403-413 (2014)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-23 20:35 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
