David P. Woodruff
David P. Woodruff | |
|---|---|
| Born | 1980 |
| Alma mater | Massachusetts Institute of Technology (BS, MEng, PhD) |
| Scientific career | |
| Institutions | |
| Thesis | Efficient and private distance approximation in the communication and streaming models |
| Doctoral advisor | Piotr Indyk |
| Website | www |
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] One of his research contributions is an asymptotically optimal algorithm for the count-distinct problem.[4]
References
- ^ Woodruff, David Paul. "Efficient and private distance approximation in the communication and streaming models". DSpace@MIT. Retrieved 17 November 2025.
- ^ "David P. Woodruff". Retrieved 17 November 2025.
- ^ "David Woodruff". Simons Institute for the Theory of Computing. Retrieved 17 November 2025.
- ^ 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.