( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
ProjecToR: Agile Reconfigurable Data Center Interconnect.

, , , , , , , , , и . SIGCOMM, стр. 216-229. ACM, (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Jagadish Kulkarni

Praveen Kulkarni

Aniket Kulkarni

Suchita Kulkarni

Mangesh Kulkarni

 

Другие публикации лиц с тем же именем

Competitive Analysis of Constrained Queueing Systems., , и . ICALP, том 55 из LIPIcs, стр. 143:1-143:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)An Improved Algorithm for Incremental Cycle Detection and Topological Ordering in Sparse Graphs., и . SODA, стр. 2509-2521. SIAM, (2020)On the Hardness of Scheduling With Non-Uniform Communication Delays., , , , , и . SODA, стр. 316-328. SIAM, (2022)Fast and Memory Efficient Differentially Private-SGD via JL Projections., , , , , и . NeurIPS, стр. 19680-19691. (2021)A Competitive Flow Time Algorithm for Heterogeneous Clusters Under Polytope Constraints., , , и . APPROX-RANDOM, том 60 из LIPIcs, стр. 10:1-10:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Differentially Private Set Union., , , , , и . ICML, том 119 из Proceedings of Machine Learning Research, стр. 3627-3636. PMLR, (2020)A Unified Rounding Algorithm For Unrelated Machines Scheduling Problems., и . SPAA, стр. 283-290. ACM, (2018)Algorithms for Cost-Aware Scheduling., и . WAOA, том 7846 из Lecture Notes in Computer Science, стр. 201-214. Springer, (2012)Non-clairvoyantly Scheduling to Minimize Convex Functions., , , и . Algorithmica, 81 (9): 3746-3764 (2019)Competitive Algorithms from Competitive Equilibria: Non-Clairvoyant Scheduling under Polyhedral Constraints., , и . J. ACM, 65 (1): 3:1-3:33 (2018)