3 citations · 3 across the 11 of their papers we have counts for
5 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…
Random-Access Ranked Retrieval and Similarity Search
Mohsen Dehghankar, Abolfazl Asudeh, Raghav Mittal +2
We extend Random Access, a fundamental operation that enables efficient search and exploration algorithms, to the modern interactive data systems based on Ranked Retrieval and Simi…
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…
An Adversary-Resistant Multi-Agent LLM System via Credibility Scoring
Sana Ebrahimi, Mohsen Dehghankar, Abolfazl Asudeh
While multi-agent LLM systems show strong capabilities in various domains, they are highly vulnerable to adversarial and low-performing agents. To resolve this issue, in this paper…
HENN: A Hierarchical Epsilon Net Navigation Graph for Approximate Nearest Neighbor Search
Mohsen Dehghankar, Abolfazl Asudeh
Hierarchical graph-based algorithms such as HNSW have achieved state-of-the-art performance for Approximate Nearest Neighbor (ANN) search in practice, yet they often lack theoretic…