Manish Purohit
Manish Purohit
Google
Verified email at cs.umd.edu - Homepage
Title
Cited by
Cited by
Year
Improving online algorithms via ml predictions
M Purohit, Z Svitkina, R Kumar
Advances in Neural Information Processing Systems, 9661-9670, 2018
642018
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
602014
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
342014
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
232011
On scheduling coflows
S Ahmadi, S Khuller, M Purohit, S Yang
Algorithmica 82 (12), 3604-3629, 2020
222020
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
182016
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
15*2015
Semi-online bipartite matching
R Kumar, M Purohit, A Schild, Z Svitkina, E Vee
arXiv preprint arXiv:1812.00134, 2018
142018
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
102019
Matroid Coflow Scheduling.
S Im, B Moseley, K Pruhs, M Purohit
ICALP, 2019
102019
Interleaved caching with access graphs
R Kumar, M Purohit, Z Svitkina, E Vee
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020
82020
Betweenness computation in the single graph representation of hypergraphs
R Puzis, M Purohit, VS Subrahmanian
Social networks 35 (4), 561-572, 2013
82013
Online learning with imperfect hints
A Bhaskara, A Cutkosky, R Kumar, M Purohit
International Conference on Machine Learning, 822-831, 2020
72020
Efficient rematerialization for deep networks
R Kumar, M Purohit, Z Svitkina, E Vee, J Wang
Advances in Neural Information Processing Systems 32, 15172-15181, 2019
72019
Firewall placement in cloud data centers
S Lee, M Purohit, B Saha
Proceedings of the 4th annual Symposium on Cloud Computing, 1-2, 2013
72013
Online Linear Optimization with Many Hints
A Bhaskara, A Cutkosky, R Kumar, M Purohit
arXiv preprint arXiv:2010.03082, 2020
42020
On maximum leaf trees and connections to connected maximum cut problems
R Gandhi, MT Hajiaghayi, G Kortsarz, M Purohit, K Sarpatwar
Information Processing Letters 129, 31-34, 2018
42018
On the approximability of digraph ordering
S Kenkre, V Pandit, M Purohit, R Saket
Algorithmica 78 (4), 1182-1205, 2017
42017
A tight approximation for co-flow scheduling for minimizing total weighted completion time
S Im, M Purohit
arXiv preprint arXiv:1707.04331, 2017
32017
On correcting inputs: Inverse optimization for online structured prediction
H Daumé III, S Khuller, M Purohit, G Sanders
arXiv preprint arXiv:1510.03130, 2015
32015
The system can't perform the operation now. Try again later.
Articles 1–20