Seuraa
Janardhan Kulkarni
Janardhan Kulkarni
Microsoft Research, Redmond
Vahvistettu sähköpostiosoite verkkotunnuksessa cs.washington.edu
Nimike
Viittaukset
Viittaukset
Vuosi
Collecting telemetry data privately
B Ding, J Kulkarni, S Yekhanin
Advances in Neural Information Processing Systems 30, 2017
4432017
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
2672016
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 (OSDI …, 2016
2582016
{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 (OSDI …, 2016
1882016
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
622017
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
482014
Locally private gaussian estimation
M Joseph, J Kulkarni, J Mao, SZ Wu
Advances in Neural Information Processing Systems 32, 2019
322019
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, 2019
302019
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
302015
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
292019
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
282014
Differentially private fine-tuning of language models
D Yu, S Naik, A Backurs, S Gopi, HA Inan, G Kamath, J Kulkarni, YT Lee, ...
arXiv preprint arXiv:2110.06500, 2021
222021
Minimizing flow-time on unrelated machines
N Bansal, J Kulkarni
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing …, 2015
222015
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
222014
Parallel batch-dynamic graphs: Algorithms and lower bounds
L Dhulipala, D Durfee, J Kulkarni, R Peng, S Sawlani, X Sun
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020
212020
Differentially private set union
S Gopi, P Gulhane, J Kulkarni, JH Shen, M Shokouhi, S Yekhanin
International Conference on Machine Learning, 3627-3636, 2020
202020
Fast and memory efficient differentially private-sgd via jl projections
Z Bu, S Gopi, J Kulkarni, YT Lee, H Shen, U Tantipongpipat
Advances in Neural Information Processing Systems 34, 19680-19691, 2021
192021
Algorithms for cost-aware scheduling
J Kulkarni, K Munagala
International workshop on approximation and online algorithms, 201-214, 2012
172012
On allocations with negative externalities
S Bhattacharya, J Kulkarni, K Munagala, X Xu
International Workshop on Internet and Network Economics, 25-36, 2011
172011
Privately learning markov random fields
H Zhang, G Kamath, J Kulkarni, S Wu
International Conference on Machine Learning, 11129-11140, 2020
162020
Järjestelmä ei voi suorittaa toimenpidettä nyt. Yritä myöhemmin uudelleen.
Artikkelit 1–20