# Janardhan Kulkarni

According to our database

Collaborative distances:

^{1}, Janardhan Kulkarni authored at least 48 papers between 2008 and 2020.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2020

Scheduling with Communication Delays via LP Hierarchies and Clustering.

CoRR, 2020

The Power of Recourse: Better Algorithms for Facility Location in Online and Dynamic Models.

CoRR, 2020

Differentially Private Set Union.

CoRR, 2020

Locally Private Hypothesis Selection.

CoRR, 2020

Privately Learning Markov Random Fields.

CoRR, 2020

Hierarchy-Based Algorithms for Minimizing Makespan under Precedence and Communication Constraints.

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Differentially Private Release of Synthetic Graphs.

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Parallel Batch-Dynamic Graphs: Algorithms and Lower Bounds.

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

An Improved Algorithm for Incremental Cycle Detection and Topological Ordering in Sparse Graphs.

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

2019

Tight Bounds for Online Vector Scheduling.

SIAM J. Comput., 2019

Fully Dynamic (Δ+1)-Coloring in Constant Update Time.

CoRR, 2019

Online Geometric Discrepancy for Stochastic Arrivals with Applications to Envy Minimization.

CoRR, 2019

Non-clairvoyantly Scheduling to Minimize Convex Functions.

Algorithmica, 2019

Lift and Project Algorithms for Precedence Constrained Scheduling to Minimize Completion Time.

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

A Polynomial Time Constant Approximation For Minimizing Total Weighted Flow-time.

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Deterministically Maintaining a (2 + ∊)-Approximate Minimum Vertex Cover in O(1/∊2) Amortized Update Time.

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Locally Private Gaussian Estimation.

Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

An Algorithmic Framework For Differentially Private Data Analysis on Trusted Processors.

Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

2018

Competitive Algorithms from Competitive Equilibria: Non-Clairvoyant Scheduling under Polyhedral Constraints.

J. ACM, 2018

Deterministically Maintaining a (2+ε)-Approximate Minimum Vertex Cover in O(1/ε

^{2}) Amortized Update Time.
CoRR, 2018

A Unified Rounding Algorithm For Unrelated Machines Scheduling Problems.

Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, 2018

Flow-time Optimization for Concurrent Open-Shop and Precedence Constrained Scheduling Models.

Proceedings of the Approximation, 2018

2017

Truth and Regret in Online Scheduling.

Proceedings of the 2017 ACM Conference on Economics and Computation, 2017

Collecting Telemetry Data Privately.

Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

Minimum Birkhoff-von Neumann Decomposition.

Proceedings of the Integer Programming and Combinatorial Optimization, 2017

2016

Do the Hard Stuff First: Scheduling Dependent Computations in Data-Analytics Clusters.

CoRR, 2016

Fair Online Scheduling for Selfish Jobs on Heterogeneous Machines.

Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, 2016

ProjecToR: Agile Reconfigurable Data Center Interconnect.

Proceedings of the ACM SIGCOMM 2016 Conference, Florianopolis, Brazil, August 22-26, 2016, 2016

Morpheus: Towards Automated SLOs for Enterprise Clusters.

Proceedings of the 12th USENIX Symposium on Operating Systems Design and Implementation, 2016

GRAPHENE: Packing and Dependency-Aware Scheduling for Data-Parallel Clusters.

Proceedings of the 12th USENIX Symposium on Operating Systems Design and Implementation, 2016

Competitive Analysis of Constrained Queueing Systems.

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

A Competitive Flow Time Algorithm for Heterogeneous Clusters Under Polytope Constraints.

Proceedings of the Approximation, 2016

2015

Dynamic Coordination Mechanisms: [Extended Abstract].

SIGMETRICS Perform. Evaluation Rev., 2015

Minimizing Flow-Time on Unrelated Machines.

Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015

Temporal Fairness of Round Robin: Competitive Analysis for Lk-norms of Flow Time.

Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, 2015

Robust Price of Anarchy Bounds via LP and Fenchel Duality.

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

Competitive Flow Time Algorithms for Polyhedral Scheduling.

Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015

2014

Coordination mechanisms from (almost) all scheduling policies.

Proceedings of the Innovations in Theoretical Computer Science, 2014

Coordination Mechanisms for Selfish Routing over Time on a Tree.

Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

SelfishMigrate: A Scalable Algorithm for Non-clairvoyantly Scheduling Heterogeneous Processors.

Proceedings of the 55th IEEE Annual Symposium on Foundations of Computer Science, 2014

2013

Near-optimal multi-unit auctions with ordered bidders.

Proceedings of the fourteenth ACM Conference on Electronic Commerce, 2013

Online Non-clairvoyant Scheduling to Simultaneously Minimize All Convex Functions.

Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2013

2012

Constant-Competitive Prior-Free Auction with Ordered Bidders

CoRR, 2012

Algorithms for Cost-Aware Scheduling.

Proceedings of the Approximation and Online Algorithms - 10th International Workshop, 2012

2011

On Allocations with Negative Externalities.

Proceedings of the Internet and Network Economics - 7th International Workshop, 2011

2010

New epsilon-net constructions.

Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010

Small strong epsilon nets.

Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010

2008

On the Decidability of Model-Checking Information Flow Properties.

Proceedings of the Information Systems Security, 4th International Conference, 2008