Virginia Vassilevska Williams

Navedeno

	Vse	Od leta 2018
Navedbe	6458	4412
indeks h	36	31
indeks i10	72	66

1100

550

275

825

2007200820092010201120122013201420152016201720182019202020212022202317 26 46 31 54 118 190 277 312 434 470 695 754 806 876 1051 221

Javni dostop

Prikaži vse

37 člankov

1 članek

na voljo

ni na voljo

Na podlagi zahtev v povezavi s financiranjem

Soavtorji

Richard Ryan WilliamsMITPreverjeni e-poštni naslov na mit.edu
Amir AbboudWeizmann Institute of SciencePreverjeni e-poštni naslov na weizmann.ac.il
Liam RodittyBar Ilan UniversityPreverjeni e-poštni naslov na biu.ac.il
Andrea LincolnUC BerkeleyPreverjeni e-poštni naslov na berkeley.edu
Fabrizio GrandoniProfessor, IDSIA, USI-SUPSI, SwitzerlandPreverjeni e-poštni naslov na idsia.ch
Raphael YusterUniversity of HaifaPreverjeni e-poštni naslov na math.haifa.ac.il
Greg BodwinUniversity of MichiganPreverjeni e-poštni naslov na umich.edu
Isabelle StantonSoftware Engineer at GooglePreverjeni e-poštni naslov na eecs.berkeley.edu
Huacheng YuComputer Science, Princeton UniversityPreverjeni e-poštni naslov na cs.princeton.edu
Thomas Dueholm HansenFormer Associate professor, University of CopenhagenPreverjeni e-poštni naslov na di.ku.dk
Uri ZwickTel Aviv UniversityPreverjeni e-poštni naslov na tau.ac.il
Monika HenzingerProfessor of Computer Science, University of ViennaPreverjeni e-poštni naslov na univie.ac.at
Guy BlellochProfessor of Computer Science, Carnegie Mellon UniversityPreverjeni e-poštni naslov na cs.cmu.edu
Oren WeimannUniversity of HaifaPreverjeni e-poštni naslov na cs.haifa.ac.il
Daniel H. LarkinPrinceton UniversityPreverjeni e-poštni naslov na cs.princeton.edu
Grant SchoenebeckUniversity of MichiganPreverjeni e-poštni naslov na umich.edu
Robert TarjanProfessor of Computer Science, Princeton UniversityPreverjeni e-poštni naslov na cs.princeton.edu
Shiri ChechikProfessor of Computer Science, Tel-Aviv UniversityPreverjeni e-poštni naslov na post.tau.ac.il
Matthias MnichTU HamburgPreverjeni e-poštni naslov na tuhh.de
Aaron SidfordStanford UniversityPreverjeni e-poštni naslov na stanford.edu

Spremljaj

Virginia Vassilevska Williams

MIT

Preverjeni e-poštni naslov na mit.edu

Theoretical computer science Fine-grained complexity Algorithms and data structures Graph algorithms Complexity Theory


Naslov Razvrsti po navedbah Razvrsti po letniku Razvrsti po naslovu	Navedeno Navedeno	Leto
Multiplying matrices faster than Coppersmith-Winograd VV Williams Proceedings of the forty-fourth annual ACM symposium on Theory of computing …, 2012	1259*	2012
Popular conjectures imply strong lower bounds for dynamic problems A Abboud, VV Williams 2014 IEEE 55th Annual Symposium on Foundations of Computer Science, 434-443, 2014	379	2014
A refined laser method and faster matrix multiplication J Alman, VV Williams Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021	359	2021
Subcubic equivalences between path, matrix and triangle problems VV Williams, R Williams Foundations of Computer Science (FOCS), 2010 51st Annual IEEE Symposium on …, 2010	293	2010
Tight hardness results for LCS and other sequence similarity measures A Abboud, A Backurs, VV Williams 2015 IEEE 56th Annual Symposium on Foundations of Computer Science, 59-78, 2015	265*	2015
Fast approximation algorithms for the diameter and radius of sparse graphs L Roditty, V Vassilevska Williams Proceedings of the forty-fifth annual ACM symposium on Theory of computing …, 2013	262	2013
Finding, minimizing, and counting weighted subgraphs V Vassilevska, R Williams Proceedings of the forty-first annual ACM symposium on Theory of computing …, 2009	213	2009
On some fine-grained questions in algorithms and complexity VV Williams Proceedings of the international congress of mathematicians: Rio de janeiro …, 2018	178	2018
Approximation and fixed parameter subquadratic algorithms for radius and diameter in sparse graphs A Abboud, VV Williams, J Wang Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete …, 2016	178	2016
Subcubic equivalences between graph centrality problems, APSP and diameter A Abboud, F Grandoni, VV Williams ACM Transactions on Algorithms (TALG), 2022	152	2022
Hardness of easy problems: Basing hardness on popular conjectures such as the strong exponential time hypothesis (invited talk) V Vassilevska Williams 10th International Symposium on Parameterized and Exact Computation (IPEC 2015), 2015	151	2015
Consequences of faster alignment of sequences A Abboud, VV Williams, O Weimann Automata, Languages, and Programming: 41st International Colloquium, ICALP …, 2014	148	2014
Matching triangles and basing hardness on an extremely popular conjecture A Abboud, V Vassilevska Williams, H Yu Proceedings of the forty-seventh annual ACM symposium on Theory of computing …, 2015	127	2015
Subcubic equivalences between path, matrix, and triangle problems VV Williams, RR Williams Journal of the ACM (JACM) 65 (5), 1-38, 2018	125	2018
Better approximation algorithms for the graph diameter S Chechik, DH Larkin, L Roditty, G Schoenebeck, RE Tarjan, VV Williams Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete …, 2014	121	2014
If the current clique algorithms are optimal, so is Valiant's parser A Abboud, A Backurs, VV Williams SIAM Journal on Computing 47 (6), 2527-2555, 2018	117	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	115	2016
Efficient algorithms for clique problems V Vassilevska Information Processing Letters 109 (4), 254-257, 2009	98	2009
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	93	2018
Listing triangles A Björklund, R Pagh, VV Williams, U Zwick Automata, Languages, and Programming: 41st International Colloquium, ICALP …, 2014	78	2014

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