99 citations · 220 across the 16 of their papers we have counts for
Showing 2020 · cs.DSShow all
2 papers · 2 filters
cs.DS2020★ 1 cited
Near-Optimal Entrywise Sampling of Numerically Sparse Matrices
Vladimir Braverman, Robert Krauthgamer, Aditya Krishnan +1
Many real-world data sets are sparse or almost sparse. One method to measure this for a matrix is the \emph{numerical sparsity}, denoted $\mathsf{ns}(…
cs.DS2020
Competitively Pricing Parking in a Tree
Max Bender, Jacob Gilbert, Aditya Krishnan +1
Motivated by demand-responsive parking pricing systems we consider posted-price algorithms for the online metrical matching problem and the online metrical searching problem in a t…