Ashish Sabharwal

2009
28	EE	Lukas Kroc, Ashish Sabharwal, Bart Selman: Message-passing and local heuristics as decimation strategies for satisfiability. SAC 2009: 1408-1414
2008
27	EE	Lukas Kroc, Ashish Sabharwal, Bart Selman: Leveraging Belief Propagation, Backtrack Search, and Statistics for Model Counting. CPAIOR 2008: 127-141
26	EE	Carla P. Gomes, Willem Jan van Hoeve, Ashish Sabharwal: Connections in Networks: A Hybrid Approach. CPAIOR 2008: 303-307
25	EE	Willem Jan van Hoeve, Ashish Sabharwal: Filtering Atmost1 on Pairs of Set Variables. CPAIOR 2008: 382-386
24	EE	Lukas Kroc, Ashish Sabharwal, Bart Selman: Counting Solution Clusters in Graph Coloring Problems Using Belief Propagation. NIPS 2008: 873-880
2007
23		Carla P. Gomes, Willem Jan van Hoeve, Ashish Sabharwal, Bart Selman: Counting CSP Solutions Using Generalized XOR Constraints. AAAI 2007: 204-209
22		Bistra N. Dilkina, Carla P. Gomes, Ashish Sabharwal: The Impact of Network Topology on Pure Nash Equilibria in Graphical Games. AAAI 2007: 42-49
21	EE	Bistra N. Dilkina, Carla P. Gomes, Ashish Sabharwal: Tradeoffs in the Complexity of Backdoor Detection. CP 2007: 256-270
20	EE	Jon Conrad, Carla P. Gomes, Willem Jan van Hoeve, Ashish Sabharwal, Jordan Suter: Connections in Networks: Hardness of Feasibility Versus Optimality. CPAIOR 2007: 16-28
19	EE	Matthew Cary, Atri Rudra, Ashish Sabharwal: Paper Retraction: On the Hardness of Embeddings Between Two Finite Metrics. ICALP 2007: 949
18	EE	Carla P. Gomes, Jörg Hoffmann, Ashish Sabharwal, Bart Selman: From Sampling to Model Counting. IJCAI 2007: 2293-2299
17	EE	Carla P. Gomes, Jörg Hoffmann, Ashish Sabharwal, Bart Selman: Sampling and Soundness: Can We Have Both? New Forms of Reasoning for the Semantic Web 2007
16	EE	Carla P. Gomes, Jörg Hoffmann, Ashish Sabharwal, Bart Selman: Short XORs for Model Counting: From Theory to Practice. SAT 2007: 100-106
15	EE	Paul Beame, Russell Impagliazzo, Ashish Sabharwal: The Resolution Complexity of Independent Sets and Vertex Covers in Random Graphs. Computational Complexity 16(3): 245-297 (2007)
2006
14		Carla P. Gomes, Ashish Sabharwal, Bart Selman: Model Counting: A New Strategy for Obtaining Good Bounds. AAAI 2006
13	EE	Willem Jan van Hoeve, Gilles Pesant, Louis-Martin Rousseau, Ashish Sabharwal: Revisiting the Sequence Constraint. CP 2006: 620-634
12		Jörg Hoffmann, Ashish Sabharwal, Carmel Domshlak: Friends or Foes? An AI Planning Perspective on Abstraction and Search. ICAPS 2006: 294-303
11	EE	Carla P. Gomes, Ashish Sabharwal, Bart Selman: Near-Uniform Sampling of Combinatorial Spaces Using XOR Constraints. NIPS 2006: 481-488
10	EE	Ashish Sabharwal, Carlos Ansótegui, Carla P. Gomes, Justin W. Hart, Bart Selman: QBF Modeling: Exploiting Player Symmetry for Simplicity and Efficiency. SAT 2006: 382-395
2005
9		Ashish Sabharwal: SymChaff: A Structure-Aware Satisfiability Solver. AAAI 2005: 467-474
8	EE	Matthew Cary, Atri Rudra, Ashish Sabharwal: On the Hardness of Embeddings Between Two Finite Metrics. ICALP 2005: 1412-1423
2004
7	EE	Paul Beame, Henry A. Kautz, Ashish Sabharwal: Towards Understanding and Harnessing the Potential of Clause Learning. J. Artif. Intell. Res. (JAIR) 22: 319-351 (2004)
6	EE	Joshua Buresh-Oppenheim, Paul Beame, Toniann Pitassi, Ran Raz, Ashish Sabharwal: Bounded-Depth Frege Lower Bounds for Weaker Pigeonhole Principles. SIAM J. Comput. 34(2): 261-276 (2004)
2003
5		Paul Beame, Henry A. Kautz, Ashish Sabharwal: Understanding the Power of Clause Learning. IJCAI 2003: 1194-1201
4	EE	Ashish Sabharwal, Paul Beame, Henry A. Kautz: Using Problem Structure for Efficient Clause Learning. SAT 2003: 242-256
2002
3	EE	Josh Buresh-Oppenheim, Paul Beame, Toniann Pitassi, Ran Raz, Ashish Sabharwal: Bounded-Depth Frege Lower Bounds for Weaker Pigeonhole Principles. FOCS 2002: 583-592
2	EE	Josh Buresh-Oppenheim, Paul Beame, Toniann Pitassi, Ran Raz, Ashish Sabharwal: Bounded-depth Frege lower bounds for weaker pigeonhole principles Electronic Colloquium on Computational Complexity (ECCC)(023): (2002)
2001
1	EE	Paul Beame, Russell Impagliazzo, Ashish Sabharwal: Resolution Complexity of Independent Sets in Random Graphs. IEEE Conference on Computational Complexity 2001: 52-68

Coauthor Index

1	Carlos Ansótegui	[10]
2	Paul Beame	[1] [2] [3] [4] [5] [6] [7] [15]
3	Joshua Buresh-Oppenheim (Josh Buresh-Oppenheim)	[2] [3] [6]
4	Matthew Cary	[8] [19]
5	Jon Conrad	[20]
6	Bistra N. Dilkina	[21] [22]
7	Carmel Domshlak	[12]
8	Carla P. Gomes	[10] [11] [14] [16] [17] [18] [20] [21] [22] [23] [26]
9	Justin W. Hart	[10]
10	Willem Jan van Hoeve	[13] [20] [23] [25] [26]
11	Jörg Hoffmann	[12] [16] [17] [18]
12	Russell Impagliazzo	[1] [15]
13	Henry A. Kautz	[4] [5] [7]
14	Lukas Kroc	[24] [27] [28]
15	Gilles Pesant	[13]
16	Toniann Pitassi	[2] [3] [6]
17	Ran Raz	[2] [3] [6]
18	Louis-Martin Rousseau	[13]
19	Atri Rudra	[8] [19]
20	Bart Selman	[10] [11] [14] [16] [17] [18] [23] [24] [27] [28]
21	Jordan Suter	[20]