H-Index & Metrics Top Publications

H-Index & Metrics

Discipline name H-index Citations Publications World Ranking National Ranking
Computer Science H-index 48 Citations 8,778 227 World Ranking 3137 National Ranking 1645

Overview

What is he best known for?

The fields of study he is best known for:

  • Statistics
  • Algorithm
  • Combinatorics

David P. Woodruff mostly deals with Combinatorics, Discrete mathematics, Matrix, Upper and lower bounds and Algorithm. David P. Woodruff is interested in Binary logarithm, which is a branch of Combinatorics. The study incorporates disciplines such as Function, Subspace topology, Arbitrarily large and Bounded function in addition to Discrete mathematics.

David P. Woodruff does research in Matrix, focusing on Low-rank approximation specifically. His Low-rank approximation study integrates concerns from other disciplines, such as Embedding and Numerical linear algebra. His research integrates issues of Singular value, Norm and Communication complexity in his study of Upper and lower bounds.

His most cited work include:

  • Sketching as a Tool for Numerical Linear Algebra (511 citations)
  • Low rank approximation and regression in input sparsity time (350 citations)
  • Fast approximation of matrix coherence and statistical leverage (302 citations)

What are the main themes of his work throughout his whole career to date?

David P. Woodruff mainly investigates Combinatorics, Upper and lower bounds, Discrete mathematics, Matrix and Algorithm. In general Combinatorics, his work in Binary logarithm is often linked to Omega linking many areas of study. His work deals with themes such as Dimension, Norm, Streaming algorithm, Bounded function and Communication complexity, which intersect with Upper and lower bounds.

David P. Woodruff interconnects Sampling, Polynomial and Matching in the investigation of issues within Discrete mathematics. His research in Matrix intersects with topics in Function, Subspace topology and Singular value decomposition. His work is dedicated to discovering how Algorithm, Data stream mining are connected with Data stream and other disciplines.

He most often published in these fields:

  • Combinatorics (51.80%)
  • Upper and lower bounds (30.46%)
  • Discrete mathematics (28.30%)

What were the highlights of his more recent work (between 2017-2021)?

  • Combinatorics (51.80%)
  • Upper and lower bounds (30.46%)
  • Matrix (26.86%)

In recent papers he was focusing on the following fields of study:

His scientific interests lie mostly in Combinatorics, Upper and lower bounds, Matrix, Low-rank approximation and Algorithm. His work on Binary logarithm is typically connected to Omega as part of general Combinatorics study, connecting several disciplines of science. David P. Woodruff has included themes like Discrete mathematics, Communication complexity, Dimension, Matching and Bounded function in his Upper and lower bounds study.

The various areas that he examines in his Matrix study include Distribution, Singular value decomposition and Rank. The concepts of his Low-rank approximation study are interwoven with issues in Time complexity, Approximation algorithm and Matrix norm. His study in Algorithm is interdisciplinary in nature, drawing from both Sampling, Kernel, Streaming algorithm and Numerical linear algebra.

Between 2017 and 2021, his most popular works were:

  • Relative error tensor low rank approximation (35 citations)
  • Oblivious sketching of high-degree polynomial kernels (22 citations)
  • Faster Algorithms for High-Dimensional Robust Covariance Estimation (21 citations)

In his most recent research, the most cited papers focused on:

  • Algorithm
  • Statistics
  • Combinatorics

David P. Woodruff mainly focuses on Combinatorics, Algorithm, Matrix, Upper and lower bounds and Low-rank approximation. In general Combinatorics study, his work on Binary logarithm often relates to the realm of Omega, thereby connecting several areas of interest. The Algorithm study combines topics in areas such as Kernel, Streaming algorithm, Numerical linear algebra and Matrix norm.

His studies in Matrix integrate themes in fields like Time complexity, Distribution and Trace. His research in Upper and lower bounds focuses on subjects like Sampling, which are connected to Data stream and Bounded function. David P. Woodruff has researched Low-rank approximation in several fields, including Distance matrices in phylogeny, Approximation algorithm, Kronecker product, Metric space and Distance matrix.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

Top Publications

Sketching as a Tool for Numerical Linear Algebra

David P. Woodruff.
(2014)

607 Citations

Fast approximation of matrix coherence and statistical leverage

Petros Drineas;Malik Magdon-Ismail;Michael W. Mahoney;David P. Woodruff.
Journal of Machine Learning Research (2012)

407 Citations

Low rank approximation and regression in input sparsity time

Kenneth L. Clarkson;David P. Woodruff.
symposium on the theory of computing (2013)

386 Citations

Numerical linear algebra in the streaming model

Kenneth L. Clarkson;David P. Woodruff.
symposium on the theory of computing (2009)

325 Citations

An optimal algorithm for the distinct elements problem

Daniel M. Kane;Jelani Nelson;David P. Woodruff.
symposium on principles of database systems (2010)

302 Citations

Optimal approximations of the frequency moments of data streams

Piotr Indyk;David Woodruff.
symposium on the theory of computing (2005)

251 Citations

Optimal space lower bounds for all frequency moments

David Woodruff.
symposium on discrete algorithms (2004)

185 Citations

Lower bounds for sparse recovery

Khanh Do Ba;Piotr Indyk;Eric Price;David P. Woodruff.
symposium on discrete algorithms (2010)

180 Citations

Optimal bounds for Johnson-Lindenstrauss transforms and streaming problems with sub-constant error

T. S. Jayram;David P. Woodruff.
symposium on discrete algorithms (2011)

161 Citations

Tight lower bounds for the distinct elements problem

P. Indyk;D. Woodruff.
foundations of computer science (2003)

148 Citations

Profile was last updated on December 6th, 2021.
Research.com Ranking is based on data retrieved from the Microsoft Academic Graph (MAG).
The ranking h-index is inferred from publications deemed to belong to the considered discipline.

If you think any of the details on this page are incorrect, let us know.

Contact us

Top Scientists Citing David P. Woodruff

Michael W. Mahoney

Michael W. Mahoney

University of California, Berkeley

Publications: 63

Piotr Indyk

Piotr Indyk

MIT

Publications: 43

Graham Cormode

Graham Cormode

University of Warwick

Publications: 42

Andrew McGregor

Andrew McGregor

University of Massachusetts Amherst

Publications: 40

Robert Krauthgamer

Robert Krauthgamer

Weizmann Institute of Science

Publications: 34

Petros Drineas

Petros Drineas

Purdue University West Lafayette

Publications: 31

Rafail Ostrovsky

Rafail Ostrovsky

University of California, Los Angeles

Publications: 25

Elad Hazan

Elad Hazan

Princeton University

Publications: 22

Rasmus Pagh

Rasmus Pagh

University of Copenhagen

Publications: 21

Daniel M. Kane

Daniel M. Kane

University of California, San Diego

Publications: 18

Victor Y. Pan

Victor Y. Pan

City University of New York

Publications: 17

Martin J. Wainwright

Martin J. Wainwright

University of California, Berkeley

Publications: 17

C. Seshadhri

C. Seshadhri

University of California, Santa Cruz

Publications: 16

Aarti Singh

Aarti Singh

Carnegie Mellon University

Publications: 16

Martin J. Strauss

Martin J. Strauss

University of Michigan–Ann Arbor

Publications: 16

Something went wrong. Please try again later.