| On the complexity of optimal k-anonymity A Meyerson, R Williams Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on …, 2004 | 1259 | 2004 |
| A new algorithm for optimal 2-constraint satisfaction and its implications R Williams Theoretical Computer Science 348 (2-3), 357-365, 2005 | 569 | 2005 |
| Backdoors to typical case complexity R Williams, CP Gomes, B Selman INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE 18, 1173-1178, 2003 | 485 | 2003 |
| Subcubic equivalences between path, matrix, and triangle problems VV Williams, RR Williams Journal of the ACM (JACM) 65 (5), 1-38, 2018 | 477* | 2018 |
| Non-uniform ACC circuit lower bounds R Williams IEEE Conference on Computational Complexity, 115-125, 2011 | 332 | 2011 |
| Faster All-Pairs Shortest Paths via Circuit Complexity RR Williams SIAM Journal on Computing 47 (5), 1965-1985, 2018 | 326* | 2018 |
| 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 | 261 | 2010 |
| Improving exhaustive search implies superpolynomial lower bounds R Williams Proceedings of the 42nd ACM symposium on Theory of computing, 231-240, 2010 | 246 | 2010 |
| Finding paths of length k in time R Williams Information Processing Letters 109 (6), 315-318, 2009 | 235 | 2009 |
| Finding, minimizing, and counting weighted subgraphs V Vassilevska, R Williams Proceedings of the 41st annual ACM symposium on Theory of computing, 455-464, 2009 | 233 | 2009 |
| More Applications of the Polynomial Method to Algorithm Design A Abboud, R Williams, H Yu ACM-SIAM Symposium on Discrete Algorithms (SODA), 2015 | 165 | 2015 |
| Limits and Applications of Group Algebras for Parameterized Problems I Koutis, R Williams ACM Transactions on Algorithms (TALG) 12 (3), 31, 2016 | 157* | 2016 |
| 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 | 151* | 2016 |
| Probabilistic polynomials and hamming nearest neighbors J Alman, R Williams 2015 IEEE 56th Annual Symposium on Foundations of Computer Science, 136-150, 2015 | 134 | 2015 |
| 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 | 132 | 2016 |
| Tight Hardness for Shortest Cycles and Paths in Sparse Graphs A Lincoln, VV Williams, R Williams Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018 | 119 | 2018 |
| Regularity lemmas and combinatorial algorithms N Bansal, R Williams Foundations of Computer Science, 2009. FOCS'09. 50th Annual IEEE Symposium …, 2009 | 117 | 2009 |
| New Algorithms and Lower Bounds for Circuits With Linear Threshold Gates RR Williams Theory of Computing 14 (1), 1-25, 2018 | 105* | 2018 |
| Distributed PCP theorems for hardness of approximation in P A Abboud, A Rubinstein, R Williams Foundations of Computer Science (FOCS), 2017 IEEE 58th Annual Symposium on …, 2017 | 102 | 2017 |
| 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 | 102 | 2016 |
Virginia Vassilevska WilliamsMITmit.edu의 이메일 확인됨
