| Correlation decay up to uniqueness in spin systems L Li, P Lu, Y Yin Discrete Algorithms (SODA), 2013 ACM-SIAM 24th Annual Symposium on, 67-84, 2013 | 145 | 2013 |
| Assigning tasks for efficiency in Hadoop MJ Fischer, X Su, Y Yin Parallelism in algorithms and architectures (SPAA), 2010 ACM 22nd annual …, 2010 | 93 | 2010 |
| Approximate counting via correlation decay in spin systems L Li, P Lu, Y Yin Discrete Algorithms (SODA), 2012 ACM-SIAM 23rd annual symposium on, 922-940, 2012 | 67 | 2012 |
| Fast construction of overlay networks D Angluin, J Aspnes, J Chen, Y Wu, Y Yin Parallelism in algorithms and architectures (SPAA), 2005 ACM 17th annual …, 2005 | 66 | 2005 |
| Rapid mixing from spectral independence beyond the Boolean domain W Feng, H Guo, Y Yin, C Zhang ACM Transactions on Algorithms (TALG) 18 (3), 1-32, 2022 | 65 | 2022 |
| Spatial mixing and the connective constant: Optimal bounds A Sinclair, P Srivastava, D Štefankovič, Y Yin Discrete Algorithms (SODA), 2015 ACM-SIAM 26th annual symposium on, 2015 | 62 | 2015 |
| Improved FPTAS for multi-spin systems P Lu, Y Yin Approximation, Randomization, and Combinatorial Optimization (RANDOM-APPROX …, 2013 | 46 | 2013 |
| Convergence of MCMC and loopy BP in the tree uniqueness region for the hard-core model C Efthymiou, TP Hayes, D Stefankovic, E Vigoda, Y Yin SIAM Journal on Computing 48 (2), 581-643, 2019 | 45 | 2019 |
| Expander graph based overlapped chunked codes B Tang, S Yang, Y Yin, B Ye, S Lu 2012 IEEE International Symposium on Information Theory Proceedings, 2451-2455, 2012 | 40 | 2012 |
| Rapid mixing of Glauber dynamics via spectral independence for all degrees X Chen, W Feng, Y Yin, X Zhang SIAM Journal on Computing, FOCS21-224-FOCS21-298, 2024 | 37 | 2024 |
| Expander chunked codes B Tang, S Yang, B Ye, Y Yin, S Lu EURASIP Journal on Advances in Signal Processing 2015, 1-13, 2015 | 36 | 2015 |
| Spatial mixing and approximation algorithms for graphs with bounded connective constant A Sinclair, P Srivastava, Y Yin 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 300-309, 2013 | 35 | 2013 |
| Fast Sampling and Counting k-SAT Solutions in the Local Lemma Regime W Feng, H Guo, Y Yin, C Zhang Journal of the ACM (JACM) 68 (6), 1-42, 2021 | 31 | 2021 |
| What can be sampled locally? W Feng, Y Sun, Y Yin Proceedings of the ACM Symposium on Principles of Distributed Computing, 121-130, 2017 | 26 | 2017 |
| Optimal mixing for two-state anti-ferromagnetic spin systems X Chen, W Feng, Y Yin, X Zhang 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS …, 2022 | 24 | 2022 |
| Sampling constraint satisfaction solutions in the local lemma regime W Feng, K He, Y Yin Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021 | 20 | 2021 |
| Succinct filters for sets of unknown sizes M Liu, Y Yin, H Yu arXiv preprint arXiv:2004.12465, 2020 | 20 | 2020 |
| On local distributed sampling and counting W Feng, Y Yin Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing …, 2018 | 19 | 2018 |
| Perfect sampling from spatial mixing W Feng, H Guo, Y Yin Random Structures & Algorithms 61 (4), 678-709, 2022 | 17 | 2022 |
| Approximate Counting via Correlation Decay on Planar Graphs Y Yin, C Zhang Discrete Algorithms (SODA), 2013 ACM-SIAM 23rd annual symposium on, 67-84, 2013 | 16 | 2013 |
Chihao ZhangShanghai Jiao Tong UniversityVerified email at sjtu.edu.cn
