Research focus
About the research
How can algorithms be designed for communication complexity and data streams, and what lower bounds apply?
Read the full research overview
The current research interests of David Woodruff are communication complexity, data stream algorithms and lower bounds, graph algorithms, machine learning, numerical linear algebra, sketching, and sparse recovery. His page lists Theory as his research area, with algorithms and complexity and machine learning as research interests. Recent preprints listed on the page include A Near-Optimal Lower Bound for Prefix-Matrix Factorizations and A Proof of the Most Informative Boolean Function Conjecture. Further listed preprints include Active Learning with Low-Rank Structure for Data Selection and Adversarial Robustness for Small Frequency Moments and a Weak Equivalence Theorem for Turnstile Streams.
Selected publications
3 listedPeople & alumni
Team details haven’t been added. See the lab’s website for its current members.
Alumni details haven’t been added. Check the lab’s official website.
Sources & listing information
Find Research Labs maintains this page using public sources. The faculty member, lab, and university have not claimed or approved this listing. Listing a lab does not indicate endorsement, partnership, or a recruiting opportunity.
Request a correction or removal ↗ · About directory listings