162 citations · 630 across the 36 of their papers we have counts for
5 papers · 1 filter
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…
Fair Set Cover
Mohsen Dehghankar, Rahul Raychaudhury, Stavros Sintos +1
The potential harms of algorithmic decisions have ignited algorithmic fairness as a central topic in computer science. One of the fundamental problems in computer science is Set Co…
Online Maximum Independent Set of Hyperrectangles
Rishi Advani, Abolfazl Asudeh
The maximum independent set problem is a classical NP-hard problem in theoretical computer science. In this work, we study a special case where the family of graphs considered is r…
A Fair and Memory/Time-efficient Hashmap
Abolfazl Asudeh, Nima Shahbazi, Stavros Sintos
Hashmap is a fundamental data structure in computer science. There has been extensive research on constructing hashmaps that minimize the number of collisions leading to efficient…
Maximizing Neutrality in News Ordering
Rishi Advani, Paolo Papotti, Abolfazl Asudeh
The detection of fake news has received increasing attention over the past few years, but there are more subtle ways of deceiving one's audience. In addition to the content of news…