
Accuracy, Interpretability, and Differential Privacy via Explainable Boosting
We show that adding differential privacy to Explainable Boosting Machine...
read it

On the Hardness of Scheduling With NonUniform Communication Delays
In the scheduling with nonuniform communication delay problem, the inpu...
read it

Private Nonsmooth Empirical Risk Minimization and Stochastic Convex Optimization in Subquadratic Steps
We study the differentially private Empirical Risk Minimization (ERM) an...
read it

Differentially Private Correlation Clustering
Correlation clustering is a widely used technique in unsupervised machin...
read it

Fast and Memory Efficient Differentially PrivateSGD via JL Projections
Differentially PrivateSGD (DPSGD) of Abadi et al. (2016) and its varia...
read it

Scheduling Opportunistic Links in TwoTiered Reconfigurable Datacenters
Reconfigurable optical topologies are emerging as a promising technology...
read it

Consistent kMedian: Simpler, Better and Robust
In this paper we introduce and study the online consistent kclustering ...
read it

HierarchyBased Algorithms for Minimizing Makespan under Precedence and Communication Constraints
We consider the classic problem of scheduling jobs with precedence const...
read it

Scheduling with Communication Delays via LP Hierarchies and Clustering
We consider the classic problem of scheduling jobs with precedence const...
read it

The Power of Recourse: Better Algorithms for Facility Location in Online and Dynamic Models
In this paper we study the facility location problem in the online with ...
read it

Differentially Private Set Union
We study the basic operation of set union in the global model of differe...
read it

Locally Private Hypothesis Selection
We initiate the study of hypothesis selection under local differential p...
read it

Privately Learning Markov Random Fields
We consider the problem of learning Markov Random Fields (including the ...
read it

Fully Dynamic (Δ+1)Coloring in Constant Update Time
The problem of (vertex) (Δ+1)coloring a graph of maximum degree Δ has b...
read it

Online Geometric Discrepancy for Stochastic Arrivals with Applications to Envy Minimization
Consider a unit interval [0,1] in which n points arrive onebyone indep...
read it

Parallel BatchDynamic Graphs: Algorithms and Lower Bounds
In this paper we study the problem of dynamically maintaining graph prop...
read it

Locally Private Gaussian Estimation
We study a basic private estimation problem: each of n users draws a sin...
read it

An Improved Algorithm for Incremental Cycle Detection and Topological Ordering in Sparse Graphs
We consider the problem of incremental cycle detection and topological o...
read it

A Polynomial Time Constant Approximation For Minimizing Total Weighted Flowtime
We consider the classic scheduling problem of minimizing the total weigh...
read it

Flowtime Optimization For Concurrent OpenShop and Precedence Constrained Scheduling Models
Scheduling a set of jobs over a collection of machines is a fundamental ...
read it

An Algorithmic Framework For Differentially Private Data Analysis on Trusted Processors
Differential privacy has emerged as the main definition for private data...
read it

Deterministically Maintaining a (2+ε)Approximate Minimum Vertex Cover in O(1/ε^2) Amortized Update Time
We consider the problem of maintaining an (approximately) minimum vertex...
read it

Collecting Telemetry Data Privately
The collection and analysis of telemetry data from users' devices is rou...
read it

Do the Hard Stuff First: Scheduling Dependent Computations in DataAnalytics Clusters
We present a scheduler that improves cluster utilization and job complet...
read it
Janardhan Kulkarni
is this you? claim profile