research
∙
05/10/2023
Universal Matrix Sparsifiers and Fast Deterministic Algorithms for Linear Algebra
Given 𝐀∈ℝ^n × n with entries bounded in magnitude by 1, it is well-known...
share
research
∙
12/17/2021
Sublinear Time Approximation of Text Similarity Matrices
We study algorithms for approximating pairwise similarity matrices that ...
research
∙
09/16/2021
