default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVishesh Jain
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c15]Vishesh Jain, Clayton Mizgerd:
Rapid Mixing of the Down-Up Walk on Matchings of a Fixed Size. APPROX/RANDOM 2024: 63:1-63:13- [c14]Vishesh Jain, Huy Tuan Pham:
Optimal thresholds for Latin squares, Steiner Triple Systems, and edge colorings. SODA 2024: 1425-1436 - [c13]Nima Anari, Vishesh Jain, Frederic Koehler, Huy Tuan Pham, Thuy-Duong Vuong:
Universality of Spectral Independence with Applications to Fast Mixing in Spin Glasses. SODA 2024: 5029-5056 - [i27]Vishesh Jain, Clayton Mizgerd:
Rapid mixing of the down-up walk on matchings of a fixed size. CoRR abs/2408.03466 (2024) - 2023
- [j8]Vishesh Jain
, Ashwin Sah, Mehtaab Sawhney:
Optimal Minimization of the Covariance Loss. IEEE Trans. Inf. Theory 69(2): 813-818 (2023) - [c12]Vishesh Jain, Marcus Michelen, Huy Tuan Pham, Thuy-Duong Vuong:
Optimal mixing of the down-up walk on independent sets of a given size. FOCS 2023: 1665-1681 - [c11]Vishesh Jain, Ashwin Sah, Mehtaab Sawhney:
Spencer's theorem in nearly input-sparsity time. SODA 2023: 3946-3958 - [i26]Vishesh Jain, Marcus Michelen, Huy Tuan Pham, Thuy-Duong Vuong:
Optimal mixing of the down-up walk on independent sets of a given size. CoRR abs/2305.06198 (2023) - [i25]Nima Anari, Vishesh Jain, Frederic Koehler, Huy Tuan Pham, Thuy-Duong Vuong:
Universality of Spectral Independence with Applications to Fast Mixing in Spin Glasses. CoRR abs/2307.10466 (2023) - 2022
- [j7]Asaf Ferber, Vishesh Jain, Yufei Zhao:
On the number of Hadamard matrices via anti-concentration. Comb. Probab. Comput. 31(3): 455-477 (2022) - [j6]Vishesh Jain, Ashwin Sah, Mehtaab Sawhney:
On the smallest singular value of symmetric random matrices. Comb. Probab. Comput. 31(4): 662-683 (2022) - [j5]Vishesh Jain, Huy Tuan Pham, Thuy-Duong Vuong:
Spectral independence, coupling, and the spectral gap of the Glauber dynamics. Inf. Process. Lett. 177: 106268 (2022) - [c10]Nima Anari, Vishesh Jain, Frederic Koehler, Huy Tuan Pham, Thuy-Duong Vuong:
Entropic independence: optimal mixing of down-up random walks. STOC 2022: 1418-1430 - [c9]Vishesh Jain, Will Perkins, Ashwin Sah, Mehtaab Sawhney:
Approximate counting and sampling via local central limit theorems. STOC 2022: 1473-1486 - [i24]Vishesh Jain, Huy Tuan Pham, Thuy-Duong Vuong:
Dimension reduction for maximum matchings and the Fastest Mixing Markov Chain. CoRR abs/2203.03858 (2022) - [i23]Vishesh Jain, Ashwin Sah, Mehtaab Sawhney:
Optimal minimization of the covariance loss. CoRR abs/2205.01773 (2022) - [i22]Vishesh Jain, Ashwin Sah, Mehtaab Sawhney:
Spencer's theorem in nearly input-sparsity time. CoRR abs/2206.04549 (2022) - [i21]Vishesh Jain, Huy Tuan Pham:
Optimal thresholds for Latin squares, Steiner Triple Systems, and edge colorings. CoRR abs/2212.06109 (2022) - 2021
- [c8]Vishesh Jain, Huy Tuan Pham, Thuy-Duong Vuong:
Towards the sampling Lovász Local Lemma. FOCS 2021: 173-183 - [c7]P. Pranav Anand, Pradyumna Parshi, Vishesh Jain, Swastik Bhattacharya, Arnab Mukhopadhyay, Sayan Kanungo:
A First Principle Based Investigation on the Effects of Stacking Configuration and Biaxial Strain on the Electronic Properties of Bilayer MoS2. ISDCS 2021: 1-5 - [c6]Vishesh Jain, Ashwin Sah, Mehtaab Sawhney:
Perfectly sampling k ≥ (8/3 + o(1))Δ-colorings in graphs. STOC 2021: 1589-1600 - [i20]Vishesh Jain, Ashwin Sah, Mehtaab Sawhney:
Anticoncentration versus the number of subset sums. CoRR abs/2101.07726 (2021) - [i19]Vishesh Jain, Huy Tuan Pham, Thuy-Duong Vuong:
On the sampling Lovász Local Lemma for atomic constraint satisfaction problems. CoRR abs/2102.08342 (2021) - [i18]Vishesh Jain, Huy Tuan Pham, Thuy-Duong Vuong:
Spectral independence, coupling with the stationary distribution, and the spectral gap of the Glauber dynamics. CoRR abs/2105.01201 (2021) - [i17]Nima Anari, Vishesh Jain, Frederic Koehler, Huy Tuan Pham, Thuy-Duong Vuong:
Entropic Independence in High-Dimensional Expanders: Modified Log-Sobolev Inequalities for Fractionally Log-Concave Polynomials and the Ising Model. CoRR abs/2106.04105 (2021) - [i16]Vishesh Jain, Will Perkins, Ashwin Sah, Mehtaab Sawhney:
Approximate counting and sampling via local central limit theorems. CoRR abs/2108.01161 (2021) - [i15]Nima Anari, Vishesh Jain, Frederic Koehler, Huy Tuan Pham, Thuy-Duong Vuong:
Entropic Independence II: Optimal Sampling and Concentration via Restricted Modified Log-Sobolev Inequalities. CoRR abs/2111.03247 (2021) - 2020
- [j4]Asaf Ferber, Vishesh Jain, Benny Sudakov:
Number of 1-Factorizations of Regular High-Degree Graphs. Comb. 40(3): 315-344 (2020) - [j3]Asaf Ferber, Jacob Fox, Vishesh Jain:
Towards the linear arboricity conjecture. J. Comb. Theory B 142: 56-79 (2020) - [j2]Asaf Ferber, Vishesh Jain:
1-Factorizations of pseudorandom graphs. Random Struct. Algorithms 57(2): 259-278 (2020) - [i14]Vishesh Jain, Natesh S. Pillai, Aaron Smith:
Kac meets Johnson and Lindenstrauss: a memory-optimal, fast Johnson-Lindenstrauss transform. CoRR abs/2003.10069 (2020) - [i13]Vishesh Jain, Ashwin Sah, Mehtaab Sawhney:
On the real Davies' conjecture. CoRR abs/2005.08908 (2020) - [i12]Vishesh Jain, Ashwin Sah, Mehtaab Sawhney:
Perfectly Sampling k≥ (8/3 +o(1))Δ-Colorings in Graphs. CoRR abs/2007.06360 (2020) - [i11]Vishesh Jain, Ashwin Sah, Mehtaab Sawhney:
On the smoothed analysis of the smallest singular value with discrete noise. CoRR abs/2009.01699 (2020) - [i10]Vishesh Jain, Huy Tuan Pham, Thuy-Duong Vuong:
Towards the sampling Lovász Local Lemma. CoRR abs/2011.12196 (2020)
2010 – 2019
- 2019
- [j1]John Asplund, Thao Do, Arran Hamm, Vishesh Jain:
On the k-planar local crossing number. Discret. Math. 342(4): 927-933 (2019) - [c5]Vishesh Jain, Frederic Koehler, Jingbo Liu, Elchanan Mossel:
Accuracy-Memory Tradeoffs and Phase Transitions in Belief Propagation. COLT 2019: 1756-1771 - [c4]Vishesh Jain, Frederic Koehler, Andrej Risteski:
Mean-field approximation, convex hierarchies, and the optimality of correlation rounding: a unified perspective. STOC 2019: 1226-1236 - [i9]Vishesh Jain, Frederic Koehler, Jingbo Liu, Elchanan Mossel:
Accuracy-Memory Tradeoffs and Phase Transitions in Belief Propagation. CoRR abs/1905.10031 (2019) - [i8]Vishesh Jain:
Smoothed analysis of the least singular value without inverse Littlewood-Offord theory. CoRR abs/1908.11255 (2019) - 2018
- [c3]Vishesh Jain, Frederic Koehler, Elchanan Mossel:
The Mean-Field Approximation: Information Inequalities, Algorithms, and Complexity. COLT 2018: 1326-1347 - [c2]Vishesh Jain, Frederic Koehler, Elchanan Mossel:
The Vertex Sample Complexity of Free Energy is Polynomial. COLT 2018: 1395-1419 - [c1]Asaf Ferber, Vishesh Jain:
1-Factorizations of Pseudorandom Graphs. FOCS 2018: 698-708 - [i7]Vishesh Jain, Frederic Koehler, Elchanan Mossel:
The Mean-Field Approximation: Information Inequalities, Algorithms, and Complexity. CoRR abs/1802.06126 (2018) - [i6]Vishesh Jain, Frederic Koehler, Elchanan Mossel:
The Vertex Sample Complexity of Free Energy is Polynomial. CoRR abs/1802.06129 (2018) - [i5]Asaf Ferber, Vishesh Jain:
1-factorizations of pseudorandom graphs. CoRR abs/1803.10361 (2018) - [i4]Vishesh Jain, Frederic Koehler, Andrej Risteski:
Mean-field approximation, convex hierarchies, and the optimality of correlation rounding: a unified perspective. CoRR abs/1808.07226 (2018) - [i3]Asaf Ferber, Jacob Fox, Vishesh Jain:
Towards the linear arboricity conjecture. CoRR abs/1809.04716 (2018) - 2017
- [i2]Vishesh Jain:
A Counterexample to the "Majority is Least Stable" Conjecture. CoRR abs/1703.07657 (2017) - [i1]Vishesh Jain, Frederic Koehler, Elchanan Mossel:
Approximating Partition Functions in Constant Time. CoRR abs/1711.01655 (2017)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-18 01:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
