David P. Woodruff

Last updated
David P. Woodruff
Born1980 (1980)
Alma mater Massachusetts Institute of Technology (BS, MEng, PhD)
Awards Presburger Award (2014)
Simons Investigator (2020)
Scientific career
Institutions
Thesis Efficient and private distance approximation in the communication and streaming models
Doctoral advisor Piotr Indyk
Website www.cs.cmu.edu/~dwoodruf/

David Paul Woodruff (born 1980) [1] is a professor in the Department of Computer Science at Carnegie Mellon University. [2] He completed his PhD at MIT in 2007. [3] His research contributions include an asymptotically optimal streaming algorithm for the count-distinct problem [4] , which received the best paper award at the 2010 Symposium on Principles of Database Systems [5] . He has also co-developed randomized algorithms for linear regression and low-rank approximation, which were recognized with a best paper award at the 2013 Symposium on Theory of Computing [6] .

References

  1. ↑ Woodruff, David Paul. "Efficient and private distance approximation in the communication and streaming models". DSpace@MIT. Retrieved 17 November 2025.
  2. ↑ "David P. Woodruff" . Retrieved 17 November 2025.
  3. ↑ "David Woodruff". Simons Institute for the Theory of Computing. Retrieved 17 November 2025.
  4. ↑ Kane, Daniel M.; Nelson, Jelani; Woodruff, David P. (2010). "An optimal algorithm for the distinct elements problem". Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems. pp. 41–52. doi:10.1145/1807085.1807094. ISBN   978-1-4503-0033-9.
  5. ↑ SIGMOD/PODS '10: International Conference on Management of Data
  6. ↑ STOC Best Paper Award
This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.