Sledovat
Manish Purohit
Manish Purohit
Google
E-mailová adresa ověřena na: cs.umd.edu - Domovská stránka
Název
Citace
Citace
Rok
Improving online algorithms via ML predictions
M Purohit, Z Svitkina, R Kumar
Advances in Neural Information Processing Systems 31, 2018
331*2018
Fast influence-based coarsening for large networks
M Purohit, BA Prakash, C Kang, Y Zhang, VS Subrahmanian
Proceedings of the 20th ACM SIGKDD international conference on Knowledge …, 2014
822014
Online learning with imperfect hints
A Bhaskara, A Cutkosky, R Kumar, M Purohit
International Conference on Machine Learning, 822-831, 2020
572020
Non-clairvoyant scheduling with predictions
S Im, R Kumar, MM Qaem, M Purohit
ACM Transactions on Parallel Computing 10 (4), 1-26, 2023
532023
Efficient rematerialization for deep networks
R Kumar, M Purohit, Z Svitkina, E Vee, J Wang
Advances in Neural Information Processing Systems 32, 2019
522019
Analyzing the optimal neighborhood: Algorithms for budgeted and partial connected dominating set problems
S Khuller, M Purohit, KK Sarpatwar
Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete …, 2014
462014
On scheduling coflows
S Ahmadi, S Khuller, M Purohit, S Yang
Algorithmica 82 (12), 3604-3629, 2020
442020
Online knapsack with frequency predictions
S Im, R Kumar, M Montazer Qaem, M Purohit
Advances in neural information processing systems 34, 2733-2743, 2021
412021
Semi-online bipartite matching
R Kumar, M Purohit, A Schild, Z Svitkina, E Vee
arXiv preprint arXiv:1812.00134, 2018
412018
Dynamic balancing for model selection in bandits and rl
A Cutkosky, C Dann, A Das, C Gentile, A Pacchiano, M Purohit
International Conference on Machine Learning, 2276-2285, 2021
372021
Brief announcement: Improved approximation algorithms for scheduling co-flows
S Khuller, M Purohit
Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and …, 2016
372016
Near optimal coflow scheduling in networks
M Chowdhury, S Khuller, M Purohit, S Yang, J You
The 31st ACM Symposium on Parallelism in Algorithms and Architectures, 123-134, 2019
302019
Learning-augmented weighted paging
N Bansal, C Coester, R Kumar, M Purohit, E Vee
Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022
232022
Parsimonious learning-augmented caching
S Im, R Kumar, A Petety, M Purohit
International Conference on Machine Learning, 9588-9601, 2022
212022
Approximation algorithms for connected maximum cut and related problems
MT Hajiaghayi, G Kortsarz, R MacDavid, M Purohit, K Sarpatwar
Algorithms-ESA 2015: 23rd Annual European Symposium, Patras, Greece …, 2015
19*2015
Matroid Coflow Scheduling.
S Im, B Moseley, K Pruhs, M Purohit
ICALP, 2019
182019
Online linear optimization with many hints
A Bhaskara, A Cutkosky, R Kumar, M Purohit
Advances in neural information processing systems 33, 9530-9539, 2020
172020
Hiring under uncertainty
M Purohit, S Gollapudi, M Raghavan
International Conference on Machine Learning, 5181-5189, 2019
172019
Interleaved caching with access graphs
R Kumar, M Purohit, Z Svitkina, E Vee
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020
152020
Betweenness computation in the single graph representation of hypergraphs
R Puzis, M Purohit, VS Subrahmanian
Social networks 35 (4), 561-572, 2013
152013
Systém momentálně nemůže danou operaci provést. Zkuste to znovu později.
Články 1–20