6. Hardness of Range Avoidance and Proof Complexity Generators from Demi-Bits [arXiv] [ECCC] [eprint]

Hanlin Ren, Yichuan Wang, Yan Zhong 

In Proceedings of the 17th Innovations in Theoretical Computer Science Conference (ITCS 2026)

5. Range Avoidance and Remote Point: New Algorithms and Hardness [ECCC]

Shengtang Huang, Xin Li, Yan Zhong 

In Proceedings of the 17th Innovations in Theoretical Computer Science Conference (ITCS 2026)

• Preliminary version:
  Range Avoidance and Remote Point for Low-Depth Circuits: New Algorithms and Hardness [ECCC]

  Xin Li, Yan Zhong 

4. Quantum Networks with Coherent Routing of Information through Multiple Nodes [npj QI] 

Hlér Kristjánsson, Yan Zhong, Anthony Munson, Giulio Chiribella 

npj Quantum Information 10, 131 (2024)

2. Two-Source and Affine Non-Malleable Extractors for Small Entropy [arXiv]

Xin Li, Yan Zhong 

In Proceedings of the 51st International Colloquium on Automata, Languages, and Programming (ICALP 2024, Track A)

1. Improved Online Correlated Selection [arXiv]

Ruiquan Gao, Zhongtian He, Zhiyi Huang, Zipei Nie, Bijun Yuan, Yan Zhong

In Proceedings of the 62nd IEEE Symposium on Foundations of Computer Science (FOCS 2021)

• Explicit Directional Affine Extractors and Improved Hardness for Linear Branching Programs 

          39th IEEE Conference on Computational Complexity, July 2024

• Two-Source and Affine Non-Malleable Extractors for Small Entropy

         Johns Hopkins University, Theory Seminar, April 2024

         51st International Colloquium on Automata, Languages, and Programming, July 2024