Gregory Dexter

activity

20182024

most citedFaster Randomized Interior Point Methods for Tall/Wide Linear Programs

4 citations · 7 across the 6 of their papers we have counts for

collaborators

Showing 2023 · cs.DSShow all

2 papers · 2 filters

cs.DS2023

Sketching Algorithms for Sparse Dictionary Learning: PTAS and Turnstile Streaming

Gregory Dexter, Petros Drineas, David P. Woodruff +1

Sketching algorithms have recently proven to be a powerful approach both for designing low-space streaming algorithms as well as fast polynomial time approximation schemes (PTAS).…

cs.DS2023

Universal Matrix Sparsifiers and Fast Deterministic Algorithms for Linear Algebra

Rajarshi Bhattacharjee, Gregory Dexter, Cameron Musco +3

Let $S \in R^{n \times n}$ satisfy $∥ 1 - S ∥_{2} \leq ε n$ , where $1$ is the all ones matrix and $∥ \cdot ∥_{2}$ is the spectral norm. It is well-kno…