11 citations · 66 across the 33 of their papers we have counts for
3 papers · 1 filter
Maximizing coverage while ensuring fairness: a tale of conflicting objective
Abolfazl Asudeh, Tanya Berger-Wolf, Bhaskar DasGupta +1
Ensuring fairness in computational problems has emerged as a topic during recent years, buoyed by considerations for equitable resource distributions and social justice. It $…
Fractal dimension and lower bounds for geometric problems
Anastasios Sidiropoulos, Kritika Singhal, Vijay Sridhar
We study the complexity of geometric problems on spaces of low fractal dimension. It was recently shown by [Sidiropoulos & Sridhar, SoCG 2017] that several problems admit improved…
On the Complexity of Processing Massive, Unordered, Distributed Data
Jon Feldman, S. Muthukrishnan, Anastasios Sidiropoulos +2
An existing approach for dealing with massive data sets is to stream over the input in few passes and perform computations with sublinear resources. This method does not work for t…