Search the dblp DataBase

Publications of Author

1. Ryan Williams
   Better Time-Space Lower Bounds for SAT and Related Problems. [Citation Graph (0, 0)][DBLP]
   IEEE Conference on Computational Complexity, 2005, pp:40-49 [Conf]
   
2. Virginia Vassilevska, Ryan Williams, Raphael Yuster
   Finding the Smallest H-Subgraph in Real Weighted Graphs and Related Problems. [Citation Graph (0, 0)][DBLP]
   ICALP (1), 2006, pp:262-273 [Conf]
   
3. Ryan Williams
   A New Algorithm for Optimal Constraint Satisfaction and Its Implications. [Citation Graph (0, 0)][DBLP]
   ICALP, 2004, pp:1227-1237 [Conf]
   
4. Ryan Williams, Carla P. Gomes, Bart Selman
   Backdoors To Typical Case Complexity. [Citation Graph (0, 0)][DBLP]
   IJCAI, 2003, pp:1173-1178 [Conf]
   
5. Adam Meyerson, Ryan Williams
   On the Complexity of Optimal K-Anonymity. [Citation Graph (0, 0)][DBLP]
   PODS, 2004, pp:223-228 [Conf]
   
6. Ryan Williams
   On Computing k-CNF Formula Properties. [Citation Graph (0, 0)][DBLP]
   SAT, 2003, pp:330-340 [Conf]
   
7. Virginia Vassilevska, Ryan Williams, Shan Leung Maverick Woo
   Confronting hardness using a hybrid approach. [Citation Graph (0, 0)][DBLP]
   SODA, 2006, pp:1-10 [Conf]
   
8. Ryan Williams
   Algorithms for quantified Boolean formulas. [Citation Graph (0, 0)][DBLP]
   SODA, 2002, pp:299-307 [Conf]
   
9. Ryan Williams
   Parallelizing time with polynomial circuits. [Citation Graph (0, 0)][DBLP]
   SPAA, 2005, pp:171-175 [Conf]
   
10. Virginia Vassilevska, Ryan Williams
    Finding a maximum weight triangle in n^3-Delta time, with applications. [Citation Graph (0, 0)][DBLP]
    STOC, 2006, pp:225-231 [Conf]
    
11. Ryan Williams
    A new algorithm for optimal constraint satisfaction and its implications [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:032, pp:- [Journal]
    
12. Ryan Williams
    A new algorithm for optimal 2-constraint satisfaction and its implications. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:348, n:2-3, pp:357-365 [Journal]
    
13. Ryan Williams
    Time-Space Tradeoffs for Counting NP Solutions Modulo Integers. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2007, pp:70-82 [Conf]
    
14. Ryan Williams
    Matrix-vector multiplication in sub-quadratic time: (some preprocessing required). [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:995-1001 [Conf]
    
15. Virginia Vassilevska, Ryan Williams, Raphael Yuster
    All-pairs bottleneck paths for general graphs in truly sub-cubic time. [Citation Graph (0, 0)][DBLP]
    STOC, 2007, pp:585-589 [Conf]
    
16. Ryan Williams
    Inductive Time-Space Lower Bounds for Sat and Related Problems. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2006, v:15, n:4, pp:433-470 [Journal]
    
17. Virginia Vassilevska, Ryan Williams, Raphael Yuster
    Finding heaviest H-subgraphs in real weighted graphs, with applications [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
    
18. 
    Fixed-Polynomial Size Circuit Bounds. [Citation Graph (, )][DBLP]
    
    
19. 
    Communication Complexity with Synchronized Clocks. [Citation Graph (, )][DBLP]
    
    
20. 
    An Improved Time-Space Lower Bound for Tautologies. [Citation Graph (, )][DBLP]
    
    
21. 
    Regularity Lemmas and Combinatorial Algorithms. [Citation Graph (, )][DBLP]
    
    
22. 
    Limits and Applications of Group Algebras for Parameterized Problems. [Citation Graph (, )][DBLP]
    
    
23. 
    A New Combinatorial Approach for Sparse Graph Problems. [Citation Graph (, )][DBLP]
    
    
24. 
    Resolving the Complexity of Some Data Privacy Problems. [Citation Graph (, )][DBLP]
    
    
25. 
    On the Possibility of Faster SAT Algorithms. [Citation Graph (, )][DBLP]
    
    
26. 
    Alternation-Trading Proofs, Linear Programming, and Lower Bounds. [Citation Graph (, )][DBLP]
    
    
27. 
    Finding, minimizing, and counting weighted subgraphs. [Citation Graph (, )][DBLP]
    
    
28. 
    Improving exhaustive search implies superpolynomial lower bounds. [Citation Graph (, )][DBLP]
    
    
29. 
    Finding paths of length k in O*(2^k) time [Citation Graph (, )][DBLP]
    
    
30. 
    Applying Practice to Theory [Citation Graph (, )][DBLP]
    
    
31. 
    Alternation-Trading Proofs, Linear Programming, and Lower Bounds [Citation Graph (, )][DBLP]
    
    
32. 
    Resolving the Complexity of Some Data Privacy Problems [Citation Graph (, )][DBLP]
    
    
33. 
    Improved Parameterized Algorithms for Constraint Satisfaction [Citation Graph (, )][DBLP]
    
    
34. 
    Non-Linear Time Lower Bound for (Succinct) Quantified Boolean Formulas. [Citation Graph (, )][DBLP]
    
    
35. 
    Time-Space Tradeoffs for Counting NP Solutions Modulo Integers. [Citation Graph (, )][DBLP]