Sketching as a tool for numerical linear algebra DP Woodruff Foundations and Trends® in Theoretical Computer Science 10 (1–2), 1-157, 2014 | 420 | 2014 |

Low-rank approximation and regression in input sparsity time KL Clarkson, DP Woodruff Journal of the ACM (JACM) 63 (6), 54, 2017 | 372 | 2017 |

Fast approximation of matrix coherence and statistical leverage P Drineas, M Magdon-Ismail, MW Mahoney, DP Woodruff Journal of Machine Learning Research 13 (Dec), 3475-3506, 2012 | 283 | 2012 |

Numerical linear algebra in the streaming model KL Clarkson, DP Woodruff Proceedings of the forty-first annual ACM symposium on Theory of computing …, 2009 | 247 | 2009 |

An optimal algorithm for the distinct elements problem DM Kane, J Nelson, DP Woodruff Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on …, 2010 | 234 | 2010 |

Optimal approximations of the frequency moments of data streams P Indyk, D Woodruff Proceedings of the thirty-seventh annual ACM symposium on Theory of …, 2005 | 227 | 2005 |

Lower bounds for sparse recovery KD Ba, P Indyk, E Price, DP Woodruff Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete …, 2010 | 164 | 2010 |

Optimal space lower bounds for all frequency moments D Woodruff Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete …, 2004 | 158 | 2004 |

Tight lower bounds for the distinct elements problem P Indyk, D Woodruff 44th Annual IEEE Symposium on Foundations of Computer Science, 2003 …, 2003 | 120 | 2003 |

On the exact space complexity of sketching and streaming small norms DM Kane, J Nelson, DP Woodruff Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete …, 2010 | 111 | 2010 |

Transitive-closure spanners A Bhattacharyya, E Grigorescu, K Jung, S Raskhodnikova, DP Woodruff SIAM Journal on Computing 41 (6), 1380-1425, 2012 | 94 | 2012 |

1-pass relative-error L p-sampling with applications M Monemizadeh, DP Woodruff Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete …, 2010 | 91 | 2010 |

Polylogarithmic private approximations and efficient matching P Indyk, D Woodruff Theory of Cryptography Conference, 245-264, 2006 | 89 | 2006 |

Improved distributed principal component analysis Y Liang, MFF Balcan, V Kanchanapally, D Woodruff Advances in Neural Information Processing Systems, 3113-3121, 2014 | 88 | 2014 |

Tight bounds for distributed functional monitoring DP Woodruff, Q Zhang Proceedings of the forty-fourth annual ACM symposium on Theory of computing …, 2012 | 88 | 2012 |

Optimal CUR matrix decompositions C Boutsidis, DP Woodruff SIAM Journal on Computing 46 (2), 543-589, 2017 | 84 | 2017 |

Sublinear optimization for machine learning KL Clarkson, E Hazan, DP Woodruff Journal of the ACM (JACM) 59 (5), 23, 2012 | 83 | 2012 |

Optimal bounds for Johnson-Lindenstrauss transforms and streaming problems with subconstant error TS Jayram, DP Woodruff ACM Transactions on Algorithms (TALG) 9 (3), 26, 2013 | 82 | 2013 |

A geometric approach to information-theoretic private information retrieval D Woodruff, S Yekhanin 20th Annual IEEE Conference on Computational Complexity (CCC'05), 275-284, 2005 | 80 | 2005 |

Frequent directions: Simple and deterministic matrix sketching M Ghashami, E Liberty, JM Phillips, DP Woodruff SIAM Journal on Computing 45 (5), 1762-1792, 2016 | 74 | 2016 |