Santhoshini Velusamy

activity

20202026

most citedFair allocation of a multiset of indivisible items

14 citations · 27 across the 20 of their papers we have counts for

collaborators

Showing 2025Show all

3 papers · 1 filter

cs.DS2025

Near-optimal streaming approximation for Max-DICUT in sublinear space using two passes

Santhoshini Velusamy

The Max-DICUT problem has gained a lot of attention in the streaming setting in recent years, and has so far served as a canonical problem for designing algorithms for general cons…

cs.CC2025

Sketching approximations and LP approximations for finite CSPs are related

Noah G. Singer, Madhur Tulsiani, Santhoshini Velusamy

We identify a connection between the approximability of CSPs in two models: (i) sublinear space streaming algorithms, and (ii) the basic LP relaxation. We show that whenever the ba…

cs.DS2025

Optimally detecting uniformly-distributed $ℓ_{2}$ heavy hitters in data streams

Santhoshini Velusamy, Huacheng Yu

Given a stream $x_{1}, x_{2}, \dots, x_{n}$ of items from a Universe $U$ of size poly $(n)$ , and a parameter $ε > 0$ , an item $i \in U$ is said to be an $ℓ_{2}$ heavy hitter if its frequency $…

Near-optimal streaming approximation for Max-DICUT in sublinear space using two passes

Sketching approximations and LP approximations for finite CSPs are related

Optimally detecting uniformly-distributed ℓ2​ heavy hitters in data streams

Optimally detecting uniformly-distributed $ℓ_{2}$ heavy hitters in data streams