Janardhan Kulkarni
Janardhan Kulkarni
Microsoft Research, Redmond
Verified email at cs.washington.edu
Cited by
Cited by
Collecting telemetry data privately
B Ding, J Kulkarni, S Yekhanin
arXiv preprint arXiv:1712.01524, 2017
Projector: Agile reconfigurable data center interconnect
M Ghobadi, R Mahajan, A Phanishayee, N Devanur, J Kulkarni, ...
Proceedings of the 2016 ACM SIGCOMM Conference, 216-229, 2016
Morpheus: Towards automated slos for enterprise clusters
SA Jyothi, C Curino, I Menache, SM Narayanamurthy, A Tumanov, ...
12th {USENIX} Symposium on Operating Systems Design and Implementationá…, 2016
{GRAPHENE}: Packing and dependency-aware scheduling for data-parallel clusters
R Grandl, S Kandula, S Rao, A Akella, J Kulkarni
12th {USENIX} Symposium on Operating Systems Design and Implementationá…, 2016
Push-button verification of file systems via crash refinement
H Sigurbjarnarson, J Bornholt, E Torlak, X Wang
12th {USENIX} Symposium on Operating Systems Design and Implementationá…, 2016
Competitive algorithms from competitive equilibria: Non-clairvoyant scheduling under polyhedral constraints
S Im, J Kulkarni, K Munagala
Journal of the ACM (JACM) 65 (1), 1-33, 2017
Selfishmigrate: A scalable algorithm for non-clairvoyantly scheduling heterogeneous processors
S Im, J Kulkarni, K Munagala, K Pruhs
2014 IEEE 55th Annual Symposium on Foundations of Computer Science, 531-540, 2014
Permeation enhancers in the transmucosal delivery of macromolecules
S Sharma, J Kulkarni, AP Pawar
Die Pharmazie-An International Journal of Pharmaceutical Sciences 61 (6á…, 2006
Tight bounds for online vector scheduling
S Im, N Kell, J Kulkarni, D Panigrahi
2015 IEEE 56th Annual Symposium on Foundations of Computer Science, 525-544, 2015
Locally private gaussian estimation
M Joseph, J Kulkarni, J Mao, ZS Wu
arXiv preprint arXiv:1811.08382, 2018
Robust price of anarchy bounds via LP and fenchel duality
J Kulkarni, V Mirrokni
Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discreteá…, 2014
Coordination mechanisms from (almost) all scheduling policies
S Bhattacharya, S Im, J Kulkarni, K Munagala
Proceedings of the 5th conference on Innovations in theoretical computerá…, 2014
Deterministically Maintaining a (2 + )-Approximate Minimum Vertex Cover in O(1/2) Amortized Update Time
S Bhattacharya, J Kulkarni
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discreteá…, 2019
An algorithmic framework for differentially private data analysis on trusted processors
J Allen, B Ding, J Kulkarni, H Nori, O Ohrimenko, S Yekhanin
Advances in Neural Information Processing Systems 32, 13657-13668, 2019
Minimizing flow-time on unrelated machines
N Bansal, J Kulkarni
Proceedings of the forty-seventh annual ACM symposium on Theory of Computingá…, 2015
On allocations with negative externalities
S Bhattacharya, J Kulkarni, K Munagala, X Xu
International Workshop on Internet and Network Economics, 25-36, 2011
Antiulcer activity of aqueous extract of Spinacia oleracia in rats
J KoreKakasaheb, S Rajkumar, J PatelApsari, B KulkarniJitendra
IJRPC 13, 29-31, 2011
Competitive flow time algorithms for polyhedral scheduling
S Im, J Kulkarni, K Munagala
2015 IEEE 56th Annual Symposium on Foundations of Computer Science, 506-524, 2015
Temporal fairness of round robin: Competitive analysis for lk-norms of flow time
S Im, J Kulkarni, B Moseley
Proceedings of the 27th ACM symposium on Parallelism in Algorithms andá…, 2015
Algorithms for cost-aware scheduling
J Kulkarni, K Munagala
International workshop on approximation and online algorithms, 201-214, 2012
The system can't perform the operation now. Try again later.
Articles 1–20