activity
20202026
most citedNon-clairvoyant Scheduling of Coflows

4 citations · 5 across the 4 of their papers we have counts for

collaborators

6 papers

cs.CR2026

Differentially Private Modeling of Disease Transmission within Human Contact Networks

Shlomi Hod, Debanuj Nayak, Jason R. Gantenberg +3

Epidemiologic studies of infectious diseases often rely on models of contact networks to capture the complex interactions that govern disease spread, and ongoing projects aim to va…

cs.DS2025

Homomorphism Testing with Resilience to Online Manipulations

Esty Kelman, Uri Meir, Debanuj Nayak +1

A central challenge in property testing is verifying algebraic structure with minimal access to data. A landmark result addressing this challenge, the linearity test of Blum, Luby,…

cs.LG2025

Private Sketches for Linear Regression

Shrutimoy Das, Debanuj Nayak, Anirban Dasgupta

Linear regression is frequently applied in a variety of domains, some of which might contain sensitive information. This necessitates that the application of these methods does not…

cs.CR2024★ 1 cited

Differentially Private Multi-Sampling from Distributions

Albert Cheu, Debanuj Nayak

Many algorithms have been developed to estimate probability distributions subject to differential privacy (DP): such an algorithm takes as input independent samples from a distribu…

cs.GT2021

On Fair Division with Binary Valuations Respecting Social Networks

Neeldhara Misra, Debanuj Nayak

We study the computational complexity of finding fair allocations of indivisible goods in the setting where a social network on the agents is given. Notions of fairness in this con…

cs.DS2020★ 4 cited

Non-clairvoyant Scheduling of Coflows

Akhil Bhimaraju, Debanuj Nayak, Rahul Vaze

The coflow scheduling problem is considered: given an input/output switch with each port having a fixed capacity, find a scheduling algorithm that minimizes the weighted sum of the…