6 citations · 6 across the 2 of their papers we have counts for
3 papers
cs.DS2016
Faster Online Matrix-Vector Multiplication
Kasper Green Larsen, Ryan Williams
We consider the Online Boolean Matrix-Vector Multiplication (OMV) problem studied by Henzinger et al. [STOC'15]: given an Boolean matrix , we receive Boolean ve…
cs.CC2008
Applying Practice to Theory
Ryan Williams
How can complexity theory and algorithms benefit from practical advances in computing? We give a short overview of some prior work using practical computing to attack problems in c…
cs.DS2006★ 6 cited
Finding heaviest H-subgraphs in real weighted graphs, with applications
Virginia Vassilevska, Ryan Williams, Raphael Yuster
For a graph G with real weights assigned to the vertices (edges), the MAX H-SUBGRAPH problem is to find an H-subgraph of G with maximum total weight, if one exists. The all-pairs M…