Haimin Chen, Yonghang Jiang, Chaodong Zheng.

Tight Trade-off in Contention Resolution without Collision Detection.

Proceedings of the 40th ACM Symposium on Principles of Distributed Computing (PODC), 2021.

Weiming Feng, Kun He, Yitong Yin.

Sampling Constraint Satisfaction Solutions in the Local Lemma Regime.

Proceedings of the 53rd ACM Symposium on Theory of Computing (STOC), 2021.

Bingkai Lin.

Constant Approximating k-Clique is W[1]-hard.

Proceedings of the 53rd ACM Symposium on Theory of Computing (STOC), 2021.

Arnab Bhattacharyya, Édouard Bonnet, László Egri, Suprovat Ghoshal, Karthik C. S., Bingkai Lin, Pasin Manurangsi, Dániel Marx.

Parameterized Intractability of Even Set and Shortest Vector Problem.

Journal of the ACM (JACM) 68(3): 34:1-34:23 (2021).

Weiming Feng, Nisheeth Vishnoi, Yitong Yin.

Dynamic Sampling from Graphical Models.

SIAM Journal on Computing (SICOMP) 50(2): 350-381 (2021). (Conference version in STOC 2019.)

Weiming Feng, Kun He, Xiaoming Sun, Yitong Yin.

Dynamic inference in probabilistic graphical models.

Proceedings of the 12th Innovations in Theoretical Computer Science (ITCS), 2021.

Weiming Feng, Heng Guo, Yitong Yin, Chihao Zhang.

Rapid mixing from spectral independence beyond the Boolean domain.

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), 2021.

Weiming Feng, Thomas P. Hayes, Yitong Yin.

Distributed Metropolis sampler with optimal parallelism.

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), 2021.

Mingmou Liu, Yitong Yin, Huacheng Yu.

Succinct Filters for Sets of Unknown Sizes.

Proceedings of the 47th International Colloquium on Automata, Languages and Programming (ICALP), 2020.

Weiming Feng, Heng Guo, Yitong Yin, Chihao Zhang.

Fast Sampling and Counting k-SAT Solutions in the Local Lemma Regime.

Proceedings of the 52nd ACM Symposium on Theory of Computing (STOC), 2020.

Mingmou Liu, Huacheng Yu.

Lower Bound for Succinct Range Minimum Query.

Proceedings of the 52nd ACM Symposium on Theory of Computing (STOC), 2020.

Penghui Yao.

A Doubly Exponential Upper Bound on Noisy EPR States for Binary Games.

The 23rd Annual Conference on Quantum Information Processing (QIP), 2020.

Anurag Anshu, Penghui Yao.

On the Compression of Messages in the Multi-Party Setting.

IEEE Transaction on Information Theory (TIT) 66(4): 2091-2114 (2020).

Ken-ichi Kawarabayashi, Bingkai Lin.

A nearly 5/3-approximation FPT Algorithm for Min-k-Cut.

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms (SODA), 2020.

Haimin Chen, Chaodong Zheng.

Fast and Resource Competitive Broadcast in Multi-channel Radio Networks.

Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2019.

Bingkai Lin.

A Simple Gap-producing Reduction for the Parameterized Set Cover Problem.

Proceedings of the 46th International Colloquium on Automata, Languages and Programming (ICALP), 2019. Best paper.

Yijia Chen, Bingkai Lin.

The Constant Inapproximability of the Parameterized Dominating Set Problem.

SIAM Journal on Computing (SICOMP) 48(2): 513-533 (2019). (FOCS 2016 special issue.)

Charilaos Efthymiou, Thomas P. Hayes, Daniel Štefankovič, Eric Vigoda, Yitong Yin.

Convergence of MCMC and Loopy BP in the Tree Uniqueness Region for the Hard-Core Model.

SIAM Journal on Computing (SICOMP) 48(2): 581-643 (2019). (FOCS 2016 special issue.)

Renjie Song, Yitong Yin, Jinman Zhao.

Counting Hypergraph Matchings up to Uniqueness Threshold.

Information and Computation (IANDC) 266: 75-96 (2019). (Conference version in RANDOM 2016.)

Debbie Leung, Ashwin Nayak, Ala Shayeghi, Dave Touchette, Penghui Yao, Nengkun Yu.

Capacity Approaching Codes for Low Noise Interactive Quantum Communication.

Proceedings of the 50th ACM Symposium on Theory of Computing (STOC), 2018. QIP 2018.

Weiming Feng, Yitong Yin.

On Local Distributed Sampling and Counting.

Proceedings of the 37th ACM Symposium on Principles of Distributed Computing (PODC), 2018.

Bingkai Lin.

The Parameterized Complexity of the k-Biclique Problem.

Journal of the ACM (JACM) 65(5): 34:1-34:23 (2018). (Winner of best paper and best student paper of SODA 2015.)

Anurag Anshu, Ankit Garg, Aram Harrow, Penghui Yao.

Expected communication cost of distributed quantum tasks.

IEEE Transactions on Information Theory (TIT) 64(11): 7395-7423 (2018).

Mingmou Liu, Xiaoyin Pan, Yitong Yin.

Randomized Approximate Nearest Neighbor Search with Limited Adaptivity.

ACM Transactions on Parallel Computing (TOPC) 5(1): 3:1-3:26 (2018). (SPAA 2016 special issue. Best paper finalist.)

Anurag Anshu, Dave Touchette, Penghui Yao, Nengkun Yu.

Exponential Separation of Quantum Communication and Classical Information.

Proceedings of the 49th ACM Symposium on Theory of Computing (STOC), 2017. Plenary talk in QIP 2017.

Weiming Feng, Yuxin Sun, Yitong Yin.

What Can be Sampled Locally?

Proceedings of the 36th ACM Symposium on Principles of Distributed Computing (PODC), 2017.

Seth Gilbert, Fabian Kuhn, Chaodong Zheng.

Communication Primitives in Cognitive Radio Networks.

Proceedings of the 36th ACM Symposium on Principles of Distributed Computing (PODC), 2017.

Yijia Chen, Martin Grohe, Bingkai Lin.

The Hardness of Embedding Grids and Walls.

Proceedings of the 43rd International Workshop on Graph-Theoretic Concepts in Computer Science (WG), 2017. Best paper.

Bingkai Lin, Yijia Chen.

The Parameterized Complexity of k-Edge Induced Subgraphs.

Information and Computation (IANDC) 252: 138-160 (2017). (Conference version in ICALP 2012.)

Rahul Jain, Zhaohui Wei, Penghui Yao, Shengyu Zhang.

Multipartite Quantum Correlation and Communication Complexities.

Computational Complexity 26(1): 199-228 (2017).

Alistair Sinclair, Piyush Srivastava, Daniel Štefankovič, Yitong Yin. Spatial Mixing and the Connective Constant: Optimal Bounds.

Probability Theory and Related Fields (PTRF) 168: 153 (2017). (Conference version in SODA 2015.)

Seth Gilbert, Calvin Newport, Chaodong Zheng.

Who Are You? Secure Identities in Ad Hoc Networks.

Distributed Computing (DC) 30(2): 103-125 (2017). (Conference version in DISC 2014.)

Yitong Yin.

Simple Average-case Lower Bounds for Approximate Near-neighbor from Isoperimetric Inequalities.

Proceedings of the 43rd International Colloquium on Automata, Languages and Programming (ICALP), 2016.

Anurag Anshu, Ankit Garg, Aram Wettroth Harrow, Penghui Yao.

Lower Bound on Expected Communication Cost of Quantum Huffman Coding.

Proceedings of the 11th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC), 2016.

Anurag Anshu, Rahul Jain, Priyanka Mukhopadhyay, Ala Shayeghi, Penghui Yao.

New one shot quantum protocols with application to communication complexity.

IEEE Transactions on Information Theory (TIT) 62(12): 7566-7577 (2016).

Rahul Jain, Attila Pereszlényi, Penghui Yao.

A Direct Product Theorem for Bounded-round Public-coin Randomized Communication Complexity.

Algorithmica 76(3): 720-748 (2016). (FOCS 2012 special issue.)

Seth Gilbert, Fabian Kuhn, Calvin Newport, Chaodong Zheng.

Efficient Communication in Cognitive Radio Networks.

Proceedings of the 34th ACM Symposium on Principles of Distributed Computing (PODC), 2015.

Seth Gilbert, Chaodong Zheng.

SybilCast: Broadcast on the Open Airwaves.

ACM Transactions on Parallel Computing (TOPC) 2(3): 16:1-16:20 (2015). (SPAA 2013 special issue.)

Rahul Jain, Attila Pereszlenyi, Penghui Yao.

A Parallel Repetition Theorem for Entangled Two-Player One-Round Games under Product Distributions.

Proceedings of the 29th IEEE Conference on Computational Complexity (CCC), 2014.

Yaoyu Wang, Yitong Yin.

Certificates in Data Structures.

Proceedings of the 41st International Colloquium on Automata, Languages and Programming (ICALP), 2014.

Yitong Yin.

Spatial Mixing of Coloring Random Graphs.

Proceedings of the 41st International Colloquium on Automata, Languages and Programming (ICALP), 2014.

Liang Li, Pinyan Lu, Yitong Yin.

Correlation Decay up to Uniqueness in Spin Systems.

Proceedings of the 24th ACM-SIAM Symposium on Discrete Algorithms (SODA), 2013.

Yitong Yin, Chihao Zhang.

Approximate Counting via Correlation Decay on Planar Graphs.

Proceedings of the 24th ACM-SIAM Symposium on Discrete Algorithms (SODA), 2013.

Liang Li, Pinyan Lu, Yitong Yin.

Approximate Counting via Correlation Decay in Spin Systems.

Proceedings of the 23rd ACM-SIAM Symposium on Discrete Algorithms (SODA), 2012.

James Aspnes, David Eisenstat, Yitong Yin.

Low-Contention Data Structures.

Journal of Parallel and Distributed Computing (JPDC) 72(5): 705-715 (2012). (Conference version in SPAA 2010.)

Rahul Jain, Penghui Yao.

A Parallel Approximation Algorithm for Positive Semidefinite Programming.

Proceedings of the 52nd IEEE Symposium on Foundations of Computer Science (FOCS), 2011.

Michael J. Fischer, Xueyuan Su, Yitong Yin.

Assigning Tasks for Efficiency in Hadoop.

Proceedings of the 22nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2010.

Pascal Koiran, Jürgen Landes, Natacha Portier, Penghui Yao.

Adversary lower bounds for nonadaptive quantum algorithms.

Journal of Computer and System Sciences (JCSS) 76(5): 347-355 (2010).

Yitong Yin.

Cell-Probe Proofs.

ACM Transactions on Computation Theory (TOCT) 2(1): 1:1-1:17 (2010).