265 citations · 336 across the 22 of their papers we have counts for
6 papers · 1 filter
Locally Private Gaussian Estimation
Matthew Joseph, Janardhan Kulkarni, Jieming Mao +1
We study a basic private estimation problem: each of users draws a single i.i.d. sample from an unknown Gaussian distribution, and the goal is to estimate the mean of this Gaus…
An Improved Algorithm for Incremental Cycle Detection and Topological Ordering in Sparse Graphs
Sayan Bhattacharya, Janardhan Kulkarni
We consider the problem of incremental cycle detection and topological ordering in a directed graph with nodes. In this setting, initially the edge-set o…
A Polynomial Time Constant Approximation For Minimizing Total Weighted Flow-time
Uriel Feige, Janardhan Kulkarni, Shi Li
We consider the classic scheduling problem of minimizing the total weighted flow-time on a single machine (min-WPFT), when preemption is allowed. In this problem, we are given a se…
Flow-time Optimization For Concurrent Open-Shop and Precedence Constrained Scheduling Models
Janardhan Kulkarni, Shi Li
Scheduling a set of jobs over a collection of machines is a fundamental problem that needs to be solved millions of times a day in various computing platforms: in operating systems…
An Algorithmic Framework For Differentially Private Data Analysis on Trusted Processors
Joshua Allen, Bolin Ding, Janardhan Kulkarni +3
Differential privacy has emerged as the main definition for private data analysis and machine learning. The {\em global} model of differential privacy, which assumes that users tru…
Deterministically Maintaining a -Approximate Minimum Vertex Cover in Amortized Update Time
Sayan Bhattacharya, Janardhan Kulkarni
We consider the problem of maintaining an (approximately) minimum vertex cover in an -node graph that is getting updated dynamically via a sequence of edge insertio…