58 citations · 65 across the 8 of their papers we have counts for
4 papers · 1 filter
Impossibility Results for Grammar-Compressed Linear Algebra
Amir Abboud, Arturs Backurs, Karl Bringmann +1
To handle vast amounts of data, it is natural and popular to compress vectors and matrices. When we compress a vector from size down to size , it certainly makes it ea…
Active Local Learning
Arturs Backurs, Avrim Blum, Neha Gupta
In this work we consider active local learning: given a query point , and active access to an unlabeled training set , output the prediction of a near-optimal $h \in H…
Fast and Simple Modular Subset Sum
Kyriakos Axiotis, Arturs Backurs, Karl Bringmann +4
We revisit the Subset Sum problem over the finite cyclic group for some given integer . A series of recent works has provided near-optimal algorithms for this pro…
Submodular Clustering in Low Dimensions
Arturs Backurs, Sariel Har-Peled
We study a clustering problem where the goal is to maximize the coverage of the input points by chosen centers. Specifically, given a set of points $P \subseteq \mathbb{R}^…