Ashish Sabharwal, Ph.D.
Affiliations: | 2005 | University of Washington, Seattle, Seattle, WA |
Area:
Computer ScienceGoogle:
"Ashish Sabharwal"Parents
Sign in to add mentor| Paul W. Beame | grad student | 2005 | University of Washington | |
| (Algorithmic applications of propositional proof complexity.) | ||||
BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| Sedghi H, Sabharwal A. (2018) Knowledge Completion for Generics Using Guided Tensor Factorization Transactions of the Association For Computational Linguistics. 6: 197-210 |
| Koncel-Kedziorski R, Hajishirzi H, Sabharwal A, et al. (2015) Parsing Algebraic Word Problems into Equations Transactions of the Association For Computational Linguistics. 3: 585-597 |
| Dilkina B, Gomes CP, Sabharwal A. (2014) Tradeoffs in the complexity of backdoors to satisfiability: Dynamic sub-solvers and learning during search Annals of Mathematics and Artificial Intelligence. 70: 399-431 |
| Conrad JM, Gomes CP, van Hoeve WJ, et al. (2012) Wildlife corridors as a connected subgraph problem Journal of Environmental Economics and Management. 63: 1-18 |
| Cary M, Rudra A, Sabharwal A, et al. (2010) Floodlight illumination of infinite wedges Computational Geometry: Theory and Applications. 43: 23-34 |
| Gomes CP, Sabharwal A, Selman B. (2009) Model counting Frontiers in Artificial Intelligence and Applications. 185: 633-654 |
| van Hoeve W, Pesant G, Rousseau L, et al. (2009) New filtering algorithms for combinations of among constraints Constraints. 14: 273-292 |
| Sabharwal A. (2009) SymChaff: Exploiting symmetry in a structure-aware satisfiability solver Constraints. 14: 478-505 |
| Kroc L, Sabharwal A, Selman B. (2008) Leveraging belief propagation, backtrack search, and statistics for model counting Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5015: 127-141 |
| Beame P, Impagliazzo R, Sabharwal A. (2007) The resolution complexity of independent sets and vertex covers in random graphs Computational Complexity. 16: 245-297 |