| Entropic independence: optimal mixing of down-up random walks N Anari, V Jain, F Koehler, HT Pham, TD Vuong Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022 | 47* | 2022 |
| Mean-field approximation, convex hierarchies, and the optimality of correlation rounding: a unified perspective V Jain, F Koehler, A Risteski Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019 | 41 | 2019 |
| On the counting problem in inverse Littlewood–Offord theory A Ferber, V Jain, K Luh, W Samotij Journal of the London Mathematical Society 103 (4), 1333-1362, 2021 | 37 | 2021 |
| The mean-field approximation: Information inequalities, algorithms, and complexity V Jain, F Koehler, E Mossel Conference On Learning Theory, 1326-1347, 2018 | 32 | 2018 |
| Singularity of random symmetric matrices—a combinatorial approach to improved bounds A Ferber, V Jain Forum of Mathematics, Sigma 7, e22, 2019 | 31 | 2019 |
| Entropic independence: optimal mixing of down-up random walks N Anari, V Jain, F Koehler, HT Pham, TD Vuong Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022 | 30 | 2022 |
| Spectral independence, coupling, and the spectral gap of the Glauber dynamics V Jain, HT Pham, TD Vuong Information Processing Letters 177, 106268, 2022 | 24* | 2022 |
| Singularity of discrete random matrices V Jain, A Sah, M Sawhney Geometric and Functional Analysis, 2021 | 23 | 2021 |
| Entropic independence ii: optimal sampling and concentration via restricted modified log-Sobolev inequalities N Anari, V Jain, F Koehler, HT Pham, TD Vuong arXiv preprint arXiv:2111.03247, 2021 | 21 | 2021 |
| Approximate Spielman-Teng theorems for the least singular value of random combinatorial matrices V Jain Israel Journal of Mathematics 242 (1), 461-500, 2021 | 21 | 2021 |
| Towards the linear arboricity conjecture A Ferber, J Fox, V Jain Journal of Combinatorial Theory, Series B 142, 56-79, 2020 | 21 | 2020 |
| Towards the sampling Lovász local lemma V Jain, HT Pham, TD Vuong 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS …, 2022 | 20 | 2022 |
| On the real Davies’ conjecture V Jain, A Sah, M Sawhney The Annals of Probability 49 (6), 3011-3031, 2021 | 15 | 2021 |
| On the sampling Lov\'asz Local Lemma for atomic constraint satisfaction problems V Jain, HT Pham, TD Vuong arXiv preprint arXiv:2102.08342, 2021 | 15 | 2021 |
| Approximate counting and sampling via local central limit theorems V Jain, W Perkins, A Sah, M Sawhney Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022 | 14 | 2022 |
| Optimal thresholds for Latin squares, Steiner triple systems, and edge colorings V Jain, HT Pham Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2024 | 12 | 2024 |
| The strong circular law: a combinatorial view Jain, Vishesh arXiv preprint https://arxiv.org/abs/1904.11108, 2020 | 12* | 2020 |
| Perfectly sampling k ≥ (8/3 + o(1))Δ-colorings in graphs V Jain, A Sah, M Sawhney Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021 | 10 | 2021 |
| 1-factorizations of pseudorandom graphs A Ferber, V Jain 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS …, 2018 | 10 | 2018 |
| Universality of spectral independence with applications to fast mixing in spin glasses N Anari, V Jain, F Koehler, HT Pham, TD Vuong Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2024 | 9 | 2024 |
Huy Tuan PhamStanford University在 stanford.edu 的电子邮件经过验证
