Yanyi Liu

Orcid: 0000-0002-6123-9328

According to our database1, Yanyi Liu authored at least 25 papers between 2014 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
A Direct PRF Construction from Kolmogorov Complexity.
Electron. Colloquium Comput. Complex., 2024

Kolmogorov Comes to Cryptomania: On Interactive Kolmogorov Complexity and Key-Agreement.
Electron. Colloquium Comput. Complex., 2024

2023
Toward Basing Cryptography on the Hardness of EXP.
Commun. ACM, May, 2023

Resource scheduling in mobile edge computing using improved ant colony algorithm for space information network.
Int. J. Satell. Commun. Netw., 2023

One-way Functions and Hardness of (Probabilistic) Time-Bounded Kolmogorov Complexity w.r.t. Samplable Distributions.
Electron. Colloquium Comput. Complex., 2023

On One-way Functions and the Worst-case Hardness of Time-Bounded Kolmogorov Complexity.
Electron. Colloquium Comput. Complex., 2023

KnowledgeNavigator: Leveraging Large Language Models for Enhanced Reasoning over Knowledge Graph.
CoRR, 2023

On the Computational Hardness of Quantum One-Wayness.
CoRR, 2023

A Cross-Layer Framework for LPWAN Management based on Fuzzy Cognitive Maps with Adaptive Glowworm Swarm Optimization.
Proceedings of the IEEE Wireless Communications and Networking Conference, 2023

On One-Way Functions and Sparse Languages.
Proceedings of the Theory of Cryptography - 21st International Conference, 2023

Leakage-Resilient Hardness vs Randomness.
Proceedings of the 38th Computational Complexity Conference, 2023

2022
Leakage-Resilient Hardness v.s. Randomness.
Electron. Colloquium Comput. Complex., 2022

Characterizing Derandomization Through Hardness of Levin-Kolmogorov Complexity.
Electron. Colloquium Comput. Complex., 2022

RTMDet: An Empirical Study of Designing Real-Time Object Detectors.
CoRR, 2022

MMRotate: A Rotated Object Detection Benchmark using PyTorch.
Proceedings of the MM '22: The 30th ACM International Conference on Multimedia, Lisboa, Portugal, October 10, 2022

2021
A Note on One-way Functions and Sparse Languages.
Electron. Colloquium Comput. Complex., 2021

On One-way Functions from NP-Complete Problems.
Electron. Colloquium Comput. Complex., 2021

On the Possibility of Basing Cryptography on $\EXP \neq \BPP$.
Electron. Colloquium Comput. Complex., 2021

Cryptography from Sublinear-Time Average-Case Hardness of Time-Bounded Kolmogorov Complexity.
Electron. Colloquium Comput. Complex., 2021

On the Possibility of Basing Cryptography on EXP≠ BPP.
Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

2020
Secure Massively Parallel Computation for Dishonest Majority.
IACR Cryptol. ePrint Arch., 2020

On One-way Functions and Kolmogorov Complexity.
Electron. Colloquium Comput. Complex., 2020

2019
Communication-Efficient Unconditional MPC with Guaranteed Output Delivery.
IACR Cryptol. ePrint Arch., 2019

2018
Associative Memory Realized by Reconfigurable Coupled Three-Cell CNNs.
Neural Process. Lett., 2018

2014
A new design for reconfigurable XOR function based on cellular neural networks.
Connect. Sci., 2014


  Loading...