Search the dblp DataBase

Publications of Author

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