معرفی
David Woodruff is a Professor in the Computer Science Department at Carnegie Mellon University's School of Computer Science. His research focuses on algorithms, complexity theory, machine learning, and theoretical computer science. He is particularly known for contributions to communication complexity, data stream algorithms, graph algorithms, and numerical linear algebra. His work bridges foundational theory with practical applications in privacy, security, and efficient computation.
Research Interests:
- Algorithms and Complexity
- Machine Learning
- Data Stream Algorithms
- Communication Complexity
- Sketching and Randomized Numerical Linear Algebra
Recent publications emphasize adversarial robustness in sketching, space-efficient streaming algorithms for graph problems, and eigenvalue approximation techniques. His work on privacy-preserving GWAS and transformer optimizations showcases interdisciplinary impact. He advises three PhD students and teaches courses in algorithms (15451, 15651, 15851).
Advising and Grants: Active mentor to Honghao Lin, Hoai-An Nguyen, and Madhusudhan Pittu. His research has been supported by grants focusing on streaming algorithms, communication complexity, and machine learning foundations.
