7 citations · 8 across the 10 of their papers we have counts for
4 papers · 1 filter
Dynamic Necklace Splitting
Rishi Advani, Abolfazl Asudeh, Mohsen Dehghankar +1
The necklace splitting problem is a classic problem in fair division with many applications, including data-informed fair hash maps. We extend necklace splitting to a dynamic setti…
On Fair Epsilon Net and Geometric Hitting Set
Mohsen Dehghankar, Stavros Sintos, Abolfazl Asudeh
Fairness has emerged as a formidable challenge in data-driven decisions. Many of the data problems, such as creating compact data summaries for approximate query processing, can be…
Fair-Count-Min: Frequency Estimation under Equal Group-wise Approximation Factor
Nima Shahbazi, Stavros Sintos, Abolfazl Asudeh
Frequency estimation in streaming data often relies on sketches like Count-Min (CM) to provide approximate answers with sublinear space. However, CM sketches introduce additive err…
A Theoretical Framework for Distribution-Aware Dataset Search
Aryan Esmailpour, Sainyam Galhotra, Rahul Raychaudhury +1
Effective data discovery is a cornerstone of modern data-driven decision-making. Yet, identifying datasets with specific distributional characteristics, such as percentiles or pref…