default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAshwin Sah
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j11]Janardhan Kulkarni, Yang P. Liu
, Ashwin Sah, Mehtaab S. Sawhney, Jakub Tarnawski:
Online Edge Coloring via Tree Recurrences and Correlation Decay. SIAM J. Comput. 53(1): 87-110 (2024)- 2023
- [j10]Asaf Ferber, Ashwin Sah, Mehtaab Sawhney, Yizhe Zhu:
Sparse recovery properties of discrete random matrices. Comb. Probab. Comput. 32(2): 316-325 (2023) - [j9]Vishesh Jain, Ashwin Sah, Mehtaab Sawhney:
Optimal Minimization of the Covariance Loss. IEEE Trans. Inf. Theory 69(2): 813-818 (2023) - [c6]Ashwin Sah, Mehtaab Sawhney:
Distribution of the threshold for the symmetric perceptron. FOCS 2023: 2369-2382 - [c5]Vishesh Jain, Ashwin Sah, Mehtaab Sawhney:
Spencer's theorem in nearly input-sparsity time. SODA 2023: 3946-3958 - 2022
- [j8]Vishesh Jain, Ashwin Sah, Mehtaab Sawhney:
On the smallest singular value of symmetric random matrices. Comb. Probab. Comput. 31(4): 662-683 (2022) - [c4]Yang P. Liu, Ashwin Sah, Mehtaab Sawhney:
A Gaussian Fixed Point Random Walk. ITCS 2022: 101:1-101:10 - [c3]Janardhan Kulkarni, Yang P. Liu, Ashwin Sah, Mehtaab Sawhney, Jakub Tarnawski:
Online edge coloring via tree recurrences and correlation decay. STOC 2022: 104-116 - [c2]Vishesh Jain, Will Perkins, Ashwin Sah, Mehtaab Sawhney:
Approximate counting and sampling via local central limit theorems. STOC 2022: 1473-1486 - [i9]Vishesh Jain, Ashwin Sah, Mehtaab Sawhney:
Optimal minimization of the covariance loss. CoRR abs/2205.01773 (2022) - [i8]Vishesh Jain, Ashwin Sah, Mehtaab Sawhney:
Spencer's theorem in nearly input-sparsity time. CoRR abs/2206.04549 (2022) - 2021
- [j7]Ashwin Sah:
Improving the $\frac{1}{3} - \frac{2}{3}$ Conjecture for Width Two Posets. Comb. 41(1): 99-126 (2021) - [j6]Ashwin Sah, Mehtaab Sawhney, Jonathan Tidor, Yufei Zhao:
A counterexample to the Bollobás-Riordan conjectures on sparse graph limits. Comb. Probab. Comput. 30(5): 796-799 (2021) - [j5]Noah Kravitz, Ashwin Sah:
Linear Extension Numbers of n-Element Posets. Order 38(1): 49-66 (2021) - [c1]Vishesh Jain, Ashwin Sah, Mehtaab Sawhney:
Perfectly sampling k ≥ (8/3 + o(1))Δ-colorings in graphs. STOC 2021: 1589-1600 - [i7]Vishesh Jain, Ashwin Sah, Mehtaab Sawhney:
Anticoncentration versus the number of subset sums. CoRR abs/2101.07726 (2021) - [i6]Yang P. Liu, Ashwin Sah, Mehtaab Sawhney:
A Gaussian fixed point random walk. CoRR abs/2104.07009 (2021) - [i5]Vishesh Jain, Will Perkins, Ashwin Sah, Mehtaab Sawhney:
Approximate counting and sampling via local central limit theorems. CoRR abs/2108.01161 (2021) - [i4]Janardhan Kulkarni, Yang P. Liu, Ashwin Sah, Mehtaab Sawhney, Jakub Tarnawski:
Online Edge Coloring via Tree Recurrences and Correlation Decay. CoRR abs/2111.00721 (2021) - 2020
- [j4]Colin Defant, Noah Kravitz, Ashwin Sah:
Supertrees. Electron. J. Comb. 27(2): 2 (2020) - [i3]Vishesh Jain, Ashwin Sah, Mehtaab Sawhney:
On the real Davies' conjecture. CoRR abs/2005.08908 (2020) - [i2]Vishesh Jain, Ashwin Sah, Mehtaab Sawhney:
Perfectly Sampling k≥ (8/3 +o(1))Δ-Colorings in Graphs. CoRR abs/2007.06360 (2020) - [i1]Vishesh Jain, Ashwin Sah, Mehtaab Sawhney:
On the smoothed analysis of the smallest singular value with discrete noise. CoRR abs/2009.01699 (2020)
2010 – 2019
- 2019
- [j3]Mitchell Lee, Ashwin Sah:
Constraining strong c-Wilf equivalence using cluster poset asymptotics. Adv. Appl. Math. 103: 43-57 (2019) - [j2]Ashwin Sah, Mehtaab Sawhney, David Stoner, Yufei Zhao:
The number of independent sets in an irregular graph. J. Comb. Theory B 138: 172-195 (2019) - 2018
- [j1]Ashwin Sah, Mehtaab Sawhney:
On the discrepancy between two Zagreb indices. Discret. Math. 341(9): 2575-2589 (2018)
Coauthor Index
aka: Mehtaab S. Sawhney
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-06-10 21:22 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:
