| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Scott Diehl, Dieter van Melkebeek, Ryan Williams |
An improved time-space lower bound for tautologies.  |
J. Comb. Optim.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Sam Buss, Ryan Williams |
Limits on Alternation-Trading Proofs for Time-Space Lower Bounds. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Ryan Williams |
A Casual Tour Around a Circuit Complexity Bound |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Ryan Williams |
Parallelizing Time with Polynomial Circuits. |
Theory Comput. Syst. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Ryan Williams |
Guest column: a casual tour around a circuit complexity bound. |
SIGACT News |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Ryan Williams |
Connecting SAT Algorithms and Complexity Lower Bounds. |
SAT |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Eun Jung Kim, Ryan Williams |
Improved Parameterized Algorithms for above Average Constraint Satisfaction. |
IPEC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Ryan Williams |
Diagonalization Strikes Back: Some Recent Lower Bounds in Complexity Theory. |
COCOON |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Benny Kimelfeld, Jan Vondrák, Ryan Williams |
Maximizing conjunctive views in deletion propagation. |
PODS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Ryan Williams |
Non-uniform ACC Circuit Lower Bounds. |
IEEE Conference on Computational Complexity |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Virginia Vassilevska, Ryan Williams, Raphael Yuster |
Finding heaviest H-subgraphs in real weighted graphs, with applications. |
ACM Transactions on Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Eun Jung Kim, Ryan Williams |
Improved Parameterized Algorithms for Constraint Satisfaction |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Jeremiah Blocki, Ryan Williams |
Resolving the Complexity of Some Data Privacy Problems |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Ryan Williams |
Alternation-Trading Proofs, Linear Programming, and Lower Bounds |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Mihai Patrascu, Ryan Williams |
On the Possibility of Faster SAT Algorithms. |
SODA |
2010 |
DBLP BibTeX RDF |
|
| 1 | Jeremiah Blocki, Ryan Williams |
Resolving the Complexity of Some Data Privacy Problems. |
ICALP |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Ryan Williams |
Alternation-Trading Proofs, Linear Programming, and Lower Bounds. |
STACS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Virginia Vassilevska Williams, Ryan Williams |
Subcubic Equivalences between Path, Matrix and Triangle Problems. |
FOCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Russell Impagliazzo, Ryan Williams |
Communication Complexity with Synchronized Clocks. |
IEEE Conference on Computational Complexity |
2010 |
DBLP DOI BibTeX RDF |
time-communication tradeoffs, lower bounds, communication complexity |
| 1 | Ryan Williams |
Improving exhaustive search implies superpolynomial lower bounds. |
STOC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Ryan Williams |
Finding paths of length k in O*(2k) time. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Virginia Vassilevska, Ryan Williams, Raphael Yuster |
All Pairs Bottleneck Paths and Max-Min Matrix Products in Truly Subcubic Time. |
Theory of Computing |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Ioannis Koutis, Ryan Williams |
Limits and Applications of Group Algebras for Parameterized Problems. |
ICALP |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Scott Diehl, Dieter van Melkebeek, Ryan Williams |
An Improved Time-Space Lower Bound for Tautologies. |
COCOON |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Nikhil Bansal, Ryan Williams |
Regularity Lemmas and Combinatorial Algorithms. |
FOCS |
2009 |
DBLP DOI BibTeX RDF |
Weak Regularity, Independent Set Query, Combinatorial Algorithms, Boolean Matrix Multiplication |
| 1 | Lance Fortnow, Rahul Santhanam, Ryan Williams |
Fixed-Polynomial Size Circuit Bounds. |
IEEE Conference on Computational Complexity |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Virginia Vassilevska, Ryan Williams |
Finding, minimizing, and counting weighted subgraphs. |
STOC |
2009 |
DBLP DOI BibTeX RDF |
3sum, cliques, paths, subgraph isomorphism, weighted graph |
| 1 | R. Ryan Williams |
Time-Space Tradeoffs for Counting NP Solutions Modulo Integers. |
Computational Complexity |
2008 |
DBLP DOI BibTeX RDF |
68Q17, Subject classification. 68Q15 |
| 1 | Ryan Williams |
Non-Linear Time Lower Bound for (Succinct) Quantified Boolean Formulas. |
Electronic Colloquium on Computational Complexity (ECCC) |
2008 |
DBLP BibTeX RDF |
|
| 1 | Ryan Williams |
Finding paths of length k in O*(2^k) time |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Ryan Williams |
Applying Practice to Theory |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Ryan Williams |
Applying practice to theory. |
SIGACT News |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Ryan Williams |
Maximum Two-Satisfiability. |
Encyclopedia of Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Guy E. Blelloch, Virginia Vassilevska, Ryan Williams |
A New Combinatorial Approach for Sparse Graph Problems. |
ICALP |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Ryan Williams |
Time-Space Tradeoffs for Counting NP Solutions Modulo Integers. |
Electronic Colloquium on Computational Complexity (ECCC) |
2007 |
DBLP BibTeX RDF |
|
| 1 | Ryan Williams |
Matrix-vector multiplication in sub-quadratic time: (some preprocessing required). |
SODA |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Ryan Williams |
Time-Space Tradeoffs for Counting NP Solutions Modulo Integers. |
IEEE Conference on Computational Complexity |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Virginia Vassilevska, Ryan Williams, Raphael Yuster |
All-pairs bottleneck paths for general graphs in truly sub-cubic time. |
STOC |
2007 |
DBLP DOI BibTeX RDF |
bottleneck path, maximum capacity path, matrix multiplication, subcubic |
| 1 | Ryan Williams |
Inductive Time-Space Lower Bounds for Sat and Related Problems. |
Computational Complexity |
2006 |
DBLP DOI BibTeX RDF |
68Q17, Subject classification |
| 1 | Virginia Vassilevska, Ryan Williams, Raphael Yuster |
Finding heaviest H-subgraphs in real weighted graphs, with applications |
CoRR |
2006 |
DBLP BibTeX RDF |
|
| 1 | Virginia Vassilevska, Ryan Williams, Shan Leung Maverick Woo |
Confronting hardness using a hybrid approach. |
SODA |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Virginia Vassilevska, Ryan Williams, Raphael Yuster |
Finding the Smallest H-Subgraph in Real Weighted Graphs and Related Problems. |
ICALP |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Yannet Interian, Gabriel Corvera, Bart Selman, Ryan Williams |
Finding Small Unsatisfiable Cores to Prove Unsatisfiability of QBFs. |
ISAIM |
2006 |
DBLP BibTeX RDF |
|
| 1 | Virginia Vassilevska, Ryan Williams |
Finding a maximum weight triangle in n3-Delta time, with applications. |
STOC |
2006 |
DBLP DOI BibTeX RDF |
dominating pairs, sub-cubic algorithm, matrix multiplication, independent set, clique, triangle |
| 1 | Ryan Williams |
A new algorithm for optimal 2-constraint satisfaction and its implications. |
Theor. Comput. Sci. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Ryan Williams |
Parallelizing time with polynomial circuits. |
SPAA |
2005 |
DBLP DOI BibTeX RDF |
parallel speedup, circuit complexity, alternation |
| 1 | Ryan Williams |
Better Time-Space Lower Bounds for SAT and Related Problems. |
IEEE Conference on Computational Complexity |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Ryan Williams |
A new algorithm for optimal constraint satisfaction and its implications |
Electronic Colloquium on Computational Complexity (ECCC) |
2004 |
DBLP BibTeX RDF |
|
| 1 | Ryan Williams |
A New Algorithm for Optimal Constraint Satisfaction and Its Implications. |
ICALP |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Adam Meyerson, Ryan Williams |
On the Complexity of Optimal K-Anonymity. (PDF / PS) |
PODS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Ryan Williams, Carla P. Gomes, Bart Selman |
Backdoors To Typical Case Complexity. |
IJCAI |
2003 |
DBLP BibTeX RDF |
|
| 1 | Ryan Williams |
On Computing k-CNF Formula Properties. |
SAT |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Ryan Williams |
Algorithms for quantified Boolean formulas. |
SODA |
2002 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")