Publications

This is our catalog of publications authored by IBM researchers, in collaboration with the global research community. It’s an ever-growing body of work that shows why IBM is one of the most important contributors to modern computing.

Date

Start

End

Featured collections

Popular topics

12 results for Ryan Williams

On the Number of Quantifiers as a Complexity Measure
- - Ronald Fagin
  - Jonathan Lenchner
  - et al.
- 2022
- MFCS 2022
The Communication Complexity of Distributed Set-Joins with Applications to Matrix Multiplication
- - Dirk Van Gucht
  - Ryan Williams
  - et al.
- 2015
- SIGMOD/PODS 2015
Non-uniform ACC circuit lower bounds
- - Ryan Williams
- 2011
- CCC 2011
Maximizing conjunctive views in deletion propagation
- - Benny Kimelfeld
  - Jan Vondrák
  - et al.
- 2011
- SIGMOD/PODS 2011
Alternation-trading proofs, linear programming, and lower bounds
- - Ryan Williams
- 2010
- STACS 2010
Subcubic equivalences between path, matrix, and triangle problems
- - Virginia Vassilevska Williams
  - Ryan Williams
- 2010
- FOCS 2010
Communication complexity with synchronized clocks
- - Russell Impagliazzo
  - Ryan Williams
- 2010
- CCC 2010
Improving exhaustive search implies superpolynomial lower bounds
- - Ryan Williams
- 2010
- STOC 2010
On the possibility of faster SAT algorithms
- - Mihai Pǎtraşcu
  - Ryan Williams
- 2010
- SODA 2010
Regularity lemmas and combinatorial algorithms
- - Nikhil Bansal
  - Ryan Williams
- 2009
- FOCS 2009