☰

Virginia Vassilevska, Ph.D. - Publications

Affiliations: 
2008 Carnegie Mellon University, Pittsburgh, PA 
Area:
Computer Science
Tree Info Similar researchers PubMed Report error

9 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
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.414
2009 Vassilevska V, Williams RR, Yuster R. All-pairs bottleneck paths and max-min matrix products in truly subcubic time † Theory of Computing. 5: 173-189. DOI: 10.4086/Toc.2009.V005A009  0.416
2009 Vassilevska V. Efficient algorithms for clique problems Information Processing Letters. 109: 254-257. DOI: 10.1016/J.Ipl.2008.10.014  0.357
2008 Blelloch GE, Vassilevska V, Williams R. A new combinatorial approach for sparse graph problems Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5125: 108-120. DOI: 10.1007/978-3-540-70575-8_10  0.535
2008 Blelloch GE, Golovin D, Vassilevska V. Uniquely represented data structures for computational geometry Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5124: 17-28. DOI: 10.1007/978-3-540-69903-3_4  0.357
2007 Vassilevska V, Williams R, Yuster R. All-pairs bottleneck paths for general graphs in truly sub-cubic time Proceedings of the Annual Acm Symposium On Theory of Computing. 585-589. DOI: 10.1145/1250790.1250876  0.379
2006 Vassilevska V, Williams R, Yuster R. Finding the smallest H-subgraph in real weighted graphs and related problems Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4051: 262-273. DOI: 10.1007/11786986_24  0.353
2006 Vassilevska V, Williams R. Finding a maximum weight triangle in n 3-δtime, with applications Proceedings of the Annual Acm Symposium On Theory of Computing. 2006: 225-231.  0.338
2005 Pinar A, Vassilevska V. Finding nonoverlapping substructures of a sparse matrix Electronic Transactions On Numerical Analysis. 21: 107-124.  0.314
Show low-probability matches.