Richard Ryan Williams
Richard Ryan Williams
Bestätigte E-Mail-Adresse bei mit.edu
Titel
Zitiert von
Zitiert von
Jahr
On the complexity of optimal k-anonymity
A Meyerson, R Williams
Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on …, 2004
10862004
A new algorithm for optimal 2-constraint satisfaction and its implications
R Williams
Theoretical Computer Science 348 (2-3), 357-365, 2005
4122005
Backdoors to typical case complexity
R Williams, CP Gomes, B Selman
INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE 18, 1173-1178, 2003
4052003
Subcubic equivalences between path, matrix, and triangle problems
VV Williams, RR Williams
Journal of the ACM (JACM) 65 (5), 1-38, 2018
308*2018
Non-uniform ACC circuit lower bounds
R Williams
IEEE Conference on Computational Complexity, 115-125, 2011
2552011
On the possibility of faster SAT algorithms
M Pătraşcu, R Williams
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete …, 2010
2232010
Faster All-Pairs Shortest Paths via Circuit Complexity
RR Williams
SIAM Journal on Computing 47 (5), 1965-1985, 2018
2142018
Finding paths of length k in time
R Williams
Information Processing Letters 109 (6), 315-318, 2009
1942009
Improving exhaustive search implies superpolynomial lower bounds
R Williams
Proceedings of the 42nd ACM symposium on Theory of computing, 231-240, 2010
1852010
Finding, minimizing, and counting weighted subgraphs
V Vassilevska, R Williams
Proceedings of the 41st annual ACM symposium on Theory of computing, 455-464, 2009
180*2009
Limits and Applications of Group Algebras for Parameterized Problems
I Koutis, R Williams
ACM Transactions on Algorithms (TALG) 12 (3), 31, 2016
145*2016
More Applications of the Polynomial Method to Algorithm Design
A Abboud, R Williams, H Yu
ACM-SIAM Symposium on Discrete Algorithms (SODA), 2015
1242015
Probabilistic polynomials and hamming nearest neighbors
J Alman, R Williams
2015 IEEE 56th Annual Symposium on Foundations of Computer Science, 136-150, 2015
982015
Regularity lemmas and combinatorial algorithms
N Bansal, R Williams
Foundations of Computer Science, 2009. FOCS'09. 50th Annual IEEE Symposium …, 2009
922009
On the connections between backdoors, restarts, and heavy-tailedness in combinatorial search
R Williams, C Gomes, B Selman
SAT 23, 2003
912003
Deterministic APSP, Orthogonal Vectors, and more: Quickly derandomizing Razborov-Smolensky
TM Chan, R Williams
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete …, 2016
902016
Simulating branching programs with edit distance and friends: Or: A polylog shaved is a lower bound made
A Abboud, TD Hansen, VV Williams, R Williams
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing …, 2016
872016
New Algorithms and Lower Bounds for Circuits With Linear Threshold Gates
RR Williams
Theory of Computing 14 (1), 1-25, 2018
80*2018
All pairs bottleneck paths and max-min matrix products in truly subcubic time
V Vassilevska, R Williams, R Yuster
Theory OF Computing 5, 173-189, 2009
79*2009
Polynomial Representations of Threshold Functions and Algorithmic Applications
J Alman, TM Chan, R Williams
Foundations of Computer Science (FOCS), 2016 IEEE 57th Annual Symposium on …, 2016
782016
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20