Richard Ryan Williams

Navedeno

	Vse	Od leta 2020
Navedbe	9084	3551
indeks h	47	33
indeks i10	94	72

820

410

205

615

200420052006200720082009201020112012201320142015201620172018201920202021202220232024202544 65 138 157 214 209 219 281 259 368 400 387 528 535 787 809 728 643 677 647 697 155

Javni dostop

Prikaži vse

52 člankov

0 člankov

na voljo

ni na voljo

Na podlagi zahtev v povezavi s financiranjem

Soavtorji

Virginia Vassilevska WilliamsMITPreverjeni e-poštni naslov na mit.edu
Lijie ChenUC BerkeleyPreverjeni e-poštni naslov na berkeley.edu
Amir AbboudWeizmann Institute of SciencePreverjeni e-poštni naslov na weizmann.ac.il
Adam MeyersonGoogle, Inc.Preverjeni e-poštni naslov na google.com
Josh AlmanColumbia UniversityPreverjeni e-poštni naslov na mit.edu
Huacheng YuComputer Science, Princeton UniversityPreverjeni e-poštni naslov na cs.princeton.edu
Bart SelmanProfessor of Computer Science, Cornell UniversityPreverjeni e-poštni naslov na cs.cornell.edu
Ce JinMITPreverjeni e-poštni naslov na mit.edu
Timothy M. ChanProfessor of Computer Science, University of Illinois at Urbana-ChampaignPreverjeni e-poštni naslov na illinois.edu
Rahul SanthanamUniversity of OxfordPreverjeni e-poštni naslov na cs.ox.ac.uk
Raphael YusterUniversity of HaifaPreverjeni e-poštni naslov na math.haifa.ac.il
Ioannis KoutisNew Jersey Institute of TechnologyPreverjeni e-poštni naslov na njit.edu
Nikhil VyasOpenAIPreverjeni e-poštni naslov na openai.com
Andreas BjörklundPreverjeni e-poštni naslov na itu.dk
Dylan McKayPhD Student, Massachusetts Institute of TechnologyPreverjeni e-poštni naslov na mit.edu
Petteri KaskiAssistant Professor of Computer Science, Aalto UniversityPreverjeni e-poštni naslov na aalto.fi
Joshua R. WangGooglePreverjeni e-poštni naslov na cs.stanford.edu
Lane A. Hemaspaandra (premarriage...Professor of Computer Science, University of RochesterPreverjeni e-poštni naslov na cs.rochester.edu
Andrea LincolnBoston UniversityPreverjeni e-poštni naslov na bu.edu
Mihai PatrascuAT&T LabsPreverjeni e-poštni naslov na alum.mit.edu

Spremljaj

Richard Ryan Williams

MIT

Preverjeni e-poštni naslov na mit.edu

Algorithms Computational Complexity Theory Satisfiability Fine-Grained Complexity


Naslov Razvrsti po navedbah Razvrsti po letniku Razvrsti po naslovu	Navedeno Navedeno	Leto
On the complexity of optimal k-anonymity A Meyerson, R Williams Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on …, 2004	1267	2004
A new algorithm for optimal 2-constraint satisfaction and its implications R Williams Theoretical Computer Science 348 (2-3), 357-365, 2005	595	2005
Subcubic equivalences between path, matrix, and triangle problems VV Williams, RR Williams Journal of the ACM (JACM) 65 (5), 1-38, 2018	525*	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	281	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	245	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	176	2015
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	165*	2016
Limits and Applications of Group Algebras for Parameterized Problems I Koutis, R Williams ACM Transactions on Algorithms (TALG) 12 (3), 31, 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	144	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	134	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	110	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

Sistem trenutno ne more izvesti postopka. Poskusite znova pozneje.

Članki 1–20

Št. navedb na leto

Podvojene navedbe

Združene navedbe

Dodajanje soavtorjevSoavtorji

Spremljaj

Navedeno

Soavtorji