Obserwuj
Manish Purohit
Manish Purohit
Google
Zweryfikowany adres z cs.umd.edu - Strona główna
Tytuł
Cytowane przez
Cytowane przez
Rok
Improving online algorithms via ML predictions
M Purohit, Z Svitkina, R Kumar
Advances in Neural Information Processing Systems 31, 2018
160*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
672014
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
402014
On scheduling coflows
S Ahmadi, S Khuller, M Purohit, S Yang
Algorithmica 82 (12), 3604-3629, 2020
282020
Online learning with imperfect hints
A Bhaskara, A Cutkosky, R Kumar, M Purohit
International Conference on Machine Learning, 822-831, 2020
272020
A comparison of page replacement algorithms
AS Chavan, KR Nayak, KD Vora, MD Purohit, PM Chawan
International Journal of Engineering and Technology 3 (2), 171, 2011
262011
Semi-online bipartite matching
R Kumar, M Purohit, A Schild, Z Svitkina, E Vee
arXiv preprint arXiv:1812.00134, 2018
252018
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
252016
Efficient rematerialization for deep networks
R Kumar, M Purohit, Z Svitkina, E Vee, J Wang
Advances in Neural Information Processing Systems 32, 2019
242019
Non-clairvoyant scheduling with predictions
S Im, R Kumar, M Montazer Qaem, M Purohit
Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and …, 2021
192021
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
172019
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
152021
Approximation algorithms for connected maximum cut and related problems
MT Hajiaghayi, G Kortsarz, R MacDavid, M Purohit, K Sarpatwar
Algorithms-ESA 2015, 693-704, 2015
13*2015
Matroid Coflow Scheduling.
S Im, B Moseley, K Pruhs, M Purohit
ICALP, 2019
122019
Interleaved caching with access graphs
R Kumar, M Purohit, Z Svitkina, E Vee
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020
102020
Betweenness computation in the single graph representation of hypergraphs
R Puzis, M Purohit, VS Subrahmanian
Social networks 35 (4), 561-572, 2013
92013
Firewall placement in cloud data centers
S Lee, M Purohit, B Saha
Proceedings of the 4th annual Symposium on Cloud Computing, 1-2, 2013
92013
Online linear optimization with many hints
A Bhaskara, A Cutkosky, R Kumar, M Purohit
Advances in neural information processing systems 33, 9530-9539, 2020
82020
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
72022
Analyzing the optimal neighborhood: Algorithms for partial and budgeted connected dominating set problems
S Khuller, M Purohit, KK Sarpatwar
SIAM Journal on Discrete Mathematics 34 (1), 251-270, 2020
72020
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20