Richard Ryan Williams

Citada per

	Totes	Des de 2020
Citacions	9046	3530
Índex h	47	33
Índex i10	94	72

820

410

205

615

200420052006200720082009201020112012201320142015201620172018201920202021202220232024202544 65 138 157 214 209 216 279 258 367 400 385 528 534 787 808 725 644 675 648 684 152

Accés públic

Mostra-ho tot

52 articles

0 articles

disponibles

no disponibles

Es basa en els requisits de les agències que proporcionen el finançament

Coautors

Virginia Vassilevska WilliamsMITCorreu electrònic verificat a mit.edu
Lijie ChenUC BerkeleyCorreu electrònic verificat a berkeley.edu
Amir AbboudWeizmann Institute of ScienceCorreu electrònic verificat a weizmann.ac.il
Adam MeyersonGoogle, Inc.Correu electrònic verificat a google.com
Huacheng YuComputer Science, Princeton UniversityCorreu electrònic verificat a cs.princeton.edu
Bart SelmanProfessor of Computer Science, Cornell UniversityCorreu electrònic verificat a cs.cornell.edu
Josh AlmanColumbia UniversityCorreu electrònic verificat a mit.edu
Ce JinMITCorreu electrònic verificat a mit.edu
Timothy M. ChanProfessor of Computer Science, University of Illinois at Urbana-ChampaignCorreu electrònic verificat a illinois.edu
Rahul SanthanamUniversity of OxfordCorreu electrònic verificat a cs.ox.ac.uk
Raphael YusterUniversity of HaifaCorreu electrònic verificat a math.haifa.ac.il
Ioannis KoutisNew Jersey Institute of TechnologyCorreu electrònic verificat a njit.edu
Nikhil VyasOpenAICorreu electrònic verificat a openai.com
Andreas BjörklundCorreu electrònic verificat a itu.dk
Dylan McKayPhD Student, Massachusetts Institute of TechnologyCorreu electrònic verificat a mit.edu
Joshua R. WangGoogleCorreu electrònic verificat a cs.stanford.edu
Petteri KaskiAssistant Professor of Computer Science, Aalto UniversityCorreu electrònic verificat a aalto.fi
Lane A. Hemaspaandra (premarriage...Professor of Computer Science, University of RochesterCorreu electrònic verificat a cs.rochester.edu
Andrea LincolnBoston UniversityCorreu electrònic verificat a bu.edu
Mihai PatrascuAT&T LabsCorreu electrònic verificat a alum.mit.edu

Segueix

Richard Ryan Williams

MIT

Correu electrònic verificat a mit.edu

Algorithms Computational Complexity Theory Satisfiability Fine-Grained Complexity


Títol Ordena per cites Ordena per any Ordena per títol	Citada per Citada per	Any
On the complexity of optimal k-anonymity A Meyerson, R Williams Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on …, 2004	1266	2004
A new algorithm for optimal 2-constraint satisfaction and its implications R Williams Theoretical Computer Science 348 (2-3), 357-365, 2005	593	2005
Subcubic equivalences between path, matrix, and triangle problems VV Williams, RR Williams Journal of the ACM (JACM) 65 (5), 1-38, 2018	522*	2018
Backdoors to typical case complexity R Williams, CP Gomes, B Selman INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE 18, 1173-1178, 2003	497	2003
Faster All-Pairs Shortest Paths via Circuit Complexity RR Williams SIAM Journal on Computing 47 (5), 1965-1985, 2018	343*	2018
Non-uniform ACC circuit lower bounds R Williams IEEE Conference on Computational Complexity, 115-125, 2011	339	2011
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	280	2010
Improving exhaustive search implies superpolynomial lower bounds R Williams Proceedings of the 42nd ACM symposium on Theory of computing, 231-240, 2010	253	2010
Finding paths of length k in time R Williams Information Processing Letters 109 (6), 315-318, 2009	244	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	242	2009
More Applications of the Polynomial Method to Algorithm Design A Abboud, R Williams, H Yu ACM-SIAM Symposium on Discrete Algorithms (SODA), 2015	175	2015
Limits and Applications of Group Algebras for Parameterized Problems I Koutis, R Williams ACM Transactions on Algorithms (TALG) 12 (3), 31, 2016	164*	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	164*	2016
Probabilistic polynomials and hamming nearest neighbors J Alman, R Williams 2015 IEEE 56th Annual Symposium on Foundations of Computer Science, 136-150, 2015	142	2015
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	133	2018
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	133	2016
Regularity lemmas and combinatorial algorithms N Bansal, R Williams Foundations of Computer Science, 2009. FOCS'09. 50th Annual IEEE Symposium …, 2009	121	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	109	2016
New Algorithms and Lower Bounds for Circuits With Linear Threshold Gates RR Williams Theory of Computing 14 (1), 1-25, 2018	107*	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	104	2017

En aquests moments el sistema no pot dur a terme l'operació. Torneu-ho a provar més tard.

Articles 1–20

Cites per any

Cites duplicades

Cites combinades

Addició de coautorsCoautors

Segueix

Citada per

Coautors