☰

Ryan Williams - Publications

Affiliations: 
Massachusetts Institute of Technology, Cambridge, MA, United States 
Tree Info Similar researchers PubMed Report error

10 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2016 Koutis I, Williams R. LIMITS and Applications of Group Algebras for Parameterized Problems Acm Transactions On Algorithms. 12: 31. DOI: 10.1145/2885499  0.334
2016 Koutis I, Williams R. Algebraic fingerprints for faster algorithms Communications of the Acm. 59: 98-105. DOI: 10.1145/2742544  0.324
2014 Williams R. Nonuniform ACC Circuit Lower Bounds Journal of the Acm. 61: 2. DOI: 10.1145/2559903  0.333
2013 Williams R. Alternation-Trading Proofs, Linear Programming, and Lower Bounds Acm Transactions On Computation Theory. 5: 6. DOI: 10.1145/2493246.2493249  0.328
2013 Williams VV, Williams R. Finding, minimizing, and counting weighted subgraphs Siam Journal On Computing. 42: 831-854. DOI: 10.1137/09076619X  0.301
2013 Lipton RJ, Williams R. Amplifying circuit lower bounds against polynomial time, with applications Computational Complexity. 22: 311-343. DOI: 10.1007/S00037-013-0069-5  0.3
2012 Hemaspaandra LA, Williams R. SIGACT News Complexity Theory Column 76: an atypical survey of typical-case heuristic algorithms Sigact News. 43: 70-89. DOI: 10.1145/2421119.2421135  0.322
2012 Kimelfeld B, Vondrák J, Williams R. Maximizing conjunctive views in deletion propagation Acm Transactions On Database Systems. 37. DOI: 10.1145/2389241.2389243  0.32
2010 Vassilevska V, Williams R, Yuster R. Finding heaviest H-subgraphs in real weighted graphs, with applications Acm Transactions On Algorithms. 6. DOI: 10.1145/1798596.1798597  0.328
2006 Williams R. Inductive Time-Space Lower Bounds for Sat and Related Problems Computational Complexity. 15: 433-470. DOI: 10.1007/S00037-007-0221-1  0.325
Show low-probability matches.