Manish Purohit

ORCID

Publication Activity (10 Years)

Years Active: 2013-2023
Publications (10 Years): 52

Top Venues

University of Maryland, College Park, MD, USA (PHD)

Education History

University of Maryland, College Park, MD, USA

PHD

Publications

Priyanka Shende, Manish Purohit
Strategy-proof and envy-free mechanisms for house allocation. J. Econ. Theory 213 (2023)
Sharat Ibrahimpur, Manish Purohit, Zoya Svitkina, Erik Vee, Joshua R. Wang
Efficient Caching with Reserves via Marking. CoRR (2023)
Sungjin Im, Ravi Kumar, Mahshid Montazer Qaem, Manish Purohit
Non-clairvoyant Scheduling with Predictions. ACM Trans. Parallel Comput. 10 (4) (2023)
Aditya Bhaskara, Ashok Cutkosky, Ravi Kumar, Manish Purohit
Bandit Online Linear Optimization with Hints and Queries. ICML (2023)
Sharat Ibrahimpur, Manish Purohit, Zoya Svitkina, Erik Vee, Joshua R. Wang
Efficient Caching with Reserves via Marking. ICALP (2023)
Ce Jin, Manish Purohit, Zoya Svitkina, Erik Vee, Joshua R. Wang
New Tools for Peak Memory Scheduling. CoRR (2023)
Pengming Wang, Mikita Sazanovich, Berkin Ilbeyi, Phitchaya Mangpo Phothilimthana, Manish Purohit, Han Yang Tay, Ngân Vu, Miaosen Wang, Cosmin Paduraru, Edouard Leurent, Anton Zhernov, Julian Schrittwieser, Thomas Hubert, Robert Tung, Paula Kurylowicz, Kieran Milan, Oriol Vinyals, Daniel J. Mankowitz
Optimizing Memory Mapping Using Deep Reinforcement Learning. CoRR (2023)
Quanquan C. Liu, Manish Purohit, Zoya Svitkina, Erik Vee, Joshua R. Wang
Scheduling with Communication Delay in Near-Linear Time. STACS (2022)
Sharat Ibrahimpur, Manish Purohit, Zoya Svitkina, Erik Vee, Joshua R. Wang
Caching with Reserves. APPROX/RANDOM (2022)
Sharat Ibrahimpur, Manish Purohit, Zoya Svitkina, Erik Vee, Joshua R. Wang
Caching with Reserves. CoRR (2022)
Nikhil Bansal, Christian Coester, Ravi Kumar, Manish Purohit, Erik Vee
Learning-Augmented Weighted Paging. SODA (2022)
Sungjin Im, Ravi Kumar, Aditya Petety, Manish Purohit
Parsimonious Learning-Augmented Caching. ICML (2022)
Sungjin Im, Ravi Kumar, Aditya Petety, Manish Purohit
Parsimonious Learning-Augmented Caching. CoRR (2022)
Aditya Bhaskara, Ashok Cutkosky, Ravi Kumar, Manish Purohit
Logarithmic Regret from Sublinear Hints. NeurIPS (2021)
Quanquan C. Liu, Manish Purohit, Zoya Svitkina, Erik Vee, Joshua R. Wang
Scheduling with Communication Delay in Near-Linear Time. CoRR (2021)
Aditya Bhaskara, Ashok Cutkosky, Ravi Kumar, Manish Purohit
Power of Hints for Online Learning with Movement Costs. AISTATS (2021)
Sagnik Saha, Manish Purohit
NP-completeness of the Active Time Scheduling Problem. CoRR (2021)
Sungjin Im, Ravi Kumar, Mahshid Montazer Qaem, Manish Purohit
Non-Clairvoyant Scheduling with Predictions. SPAA (2021)
Kshipra Bhawalkar, Kostas Kollias, Manish Purohit
Revenue Maximization in Transportation Networks. APPROX-RANDOM (2021)
Sungjin Im, Ravi Kumar, Mahshid Montazer Qaem, Manish Purohit
Online Knapsack with Frequency Predictions. NeurIPS (2021)
Ashok Cutkosky, Christoph Dann, Abhimanyu Das, Claudio Gentile, Aldo Pacchiano, Manish Purohit
Dynamic Balancing for Model Selection in Bandits and RL. ICML (2021)
Aditya Bhaskara, Ashok Cutkosky, Ravi Kumar, Manish Purohit
Logarithmic Regret from Sublinear Hints. CoRR (2021)
Ashok Cutkosky, Abhimanyu Das, Manish Purohit
Upper Confidence Bounds for Combining Stochastic Bandits. CoRR (2020)
Ravi Kumar, Manish Purohit, Zoya Svitkina, Erik Vee
Interleaved Caching with Access Graphs. SODA (2020)
Aditya Bhaskara, Ashok Cutkosky, Ravi Kumar, Manish Purohit
Online Linear Optimization with Many Hints. NeurIPS (2020)
Aditya Bhaskara, Ashok Cutkosky, Ravi Kumar, Manish Purohit
Online Linear Optimization with Many Hints. CoRR (2020)
Saba Ahmadi, Samir Khuller, Manish Purohit, Sheng Yang
On Scheduling Coflows. Algorithmica 82 (12) (2020)
MohammadTaghi Hajiaghayi, Guy Kortsarz, Robert MacDavid, Manish Purohit, Kanthi K. Sarpatwar
Approximation algorithms for connected maximum cut and related problems. Theor. Comput. Sci. 814 (2020)
Samir Khuller, Manish Purohit, Kanthi K. Sarpatwar
Analyzing the Optimal Neighborhood: Algorithms for Partial and Budgeted Connected Dominating Set Problems. SIAM J. Discret. Math. 34 (1) (2020)
Aditya Bhaskara, Ashok Cutkosky, Ravi Kumar, Manish Purohit
Online Learning with Imperfect Hints. CoRR (2020)
Aditya Bhaskara, Ashok Cutkosky, Ravi Kumar, Manish Purohit
Online Learning with Imperfect Hints. ICML (2020)
Nikhil Bansal, Christian Coester, Ravi Kumar, Manish Purohit, Erik Vee
Scale-Free Allocation, Amortized Convexity, and Myopic Weighted Paging. CoRR (2020)
Mosharaf Chowdhury, Samir Khuller, Manish Purohit, Sheng Yang, Jie You
Near Optimal Coflow Scheduling in Networks. CoRR (2019)
Ravi Kumar, Manish Purohit, Aaron Schild, Zoya Svitkina, Erik Vee
Semi-Online Bipartite Matching. ITCS (2019)
Mosharaf Chowdhury, Samir Khuller, Manish Purohit, Sheng Yang, Jie You
Near Optimal Coflow Scheduling in Networks. SPAA (2019)
Manish Purohit, Sreenivas Gollapudi, Manish Raghavan
Hiring Under Uncertainty. ICML (2019)
Sungjin Im, Benjamin Moseley, Kirk Pruhs, Manish Purohit
Matroid Coflow Scheduling. ICALP (2019)
Ravi Kumar, Manish Purohit, Zoya Svitkina, Erik Vee, Joshua R. Wang
Efficient Rematerialization for Deep Networks. NeurIPS (2019)
Manish Raghavan, Manish Purohit, Sreenivas Gollapudi
Hiring Under Uncertainty. CoRR (2019)
Manish Purohit, Zoya Svitkina, Ravi Kumar
Improving Online Algorithms via ML Predictions. NeurIPS (2018)
Rajiv Gandhi, Mohammad Taghi Hajiaghayi, Guy Kortsarz, Manish Purohit, Kanthi K. Sarpatwar
On maximum leaf trees and connections to connected maximum cut problems. Inf. Process. Lett. 129 (2018)
Ravi Kumar, Manish Purohit, Aaron Schild, Zoya Svitkina, Erik Vee
Semi-Online Bipartite Matching. CoRR (2018)
Sreyash Kenkre, Vinayaka Pandit, Manish Purohit, Rishi Saket
On the Approximability of Digraph Ordering. Algorithmica 78 (4) (2017)
Sungjin Im, Manish Purohit
A Tight Approximation for Co-flow Scheduling for Minimizing Total Weighted Completion Time. CoRR (2017)
Saba Ahmadi, Samir Khuller, Manish Purohit, Sheng Yang
On Scheduling Coflows - (Extended Abstract). IPCO (2017)
Samir Khuller, Manish Purohit
Brief Announcement: Improved Approximation Algorithms for Scheduling Co-Flows. SPAA (2016)
Mohammad Taghi Hajiaghayi, Guy Kortsarz, Robert MacDavid, Manish Purohit, Kanthi K. Sarpatwar
Approximation Algorithms for Connected Maximum Cut and Related Problems. ESA (2015)
Hal Daumé III, Samir Khuller, Manish Purohit, Gregory Sanders
On Correcting Inputs: Inverse Optimization for Online Structured Prediction. FSTTCS (2015)
Hal Daumé III, Samir Khuller, Manish Purohit, Gregory Sanders
On Correcting Inputs: Inverse Optimization for Online Structured Prediction. CoRR (2015)
Sreyash Kenkre, Vinayaka Pandit, Manish Purohit, Rishi Saket
On the Approximability of Digraph Ordering. CoRR (2015)
MohammadTaghi Hajiaghayi, Guy Kortsarz, Robert MacDavid, Manish Purohit, Kanthi K. Sarpatwar
Approximation Algorithms for Connected Maximum Cut and Related Problems. CoRR (2015)
Sreyash Kenkre, Vinayaka Pandit, Manish Purohit, Rishi Saket
On the Approximability of Digraph Ordering. ESA (2015)
Samir Khuller, Manish Purohit, Kanthi K. Sarpatwar
Analyzing the Optimal Neighborhood: Algorithms for Budgeted and Partial Connected Dominating Set Problems. SODA (2014)
Manish Purohit, B. Aditya Prakash, Chanhyun Kang, Yao Zhang, V. S. Subrahmanian
Fast influence-based coarsening for large networks. KDD (2014)
David G. Harris, Manish Purohit
Improved algorithms and analysis for the laminar matroid secretary problem CoRR (2013)
Seungjoon Lee, Manish Purohit, Barna Saha
Firewall placement in cloud data centers. SoCC (2013)
Rami Puzis, Manish Purohit, V. S. Subrahmanian
Betweenness computation in the single graph representation of hypergraphs. Soc. Networks 35 (4) (2013)
Samir Khuller, Manish Purohit, Kanthi K. Sarpatwar
Analyzing the Optimal Neighborhood: Algorithms for Budgeted and Partial Connected Dominating Set Problems. CoRR (2013)

Manish Purohit.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Manish Purohit