Manish Purohit

Orcid: 0000-0002-8650-2022

According to our database1, Manish Purohit authored at least 43 papers between 2013 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Online Load and Graph Balancing for Random Order Inputs.
Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures, 2024

2023
Non-clairvoyant Scheduling with Predictions.
ACM Trans. Parallel Comput., December, 2023

Strategy-proof and envy-free mechanisms for house allocation.
J. Econ. Theory, October, 2023

New Tools for Peak Memory Scheduling.
CoRR, 2023

Optimizing Memory Mapping Using Deep Reinforcement Learning.
CoRR, 2023

Bandit Online Linear Optimization with Hints and Queries.
Proceedings of the International Conference on Machine Learning, 2023

Efficient Caching with Reserves via Marking.
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

2022
Scheduling with Communication Delay in Near-Linear Time.
Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 2022

Learning-Augmented Weighted Paging.
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Parsimonious Learning-Augmented Caching.
Proceedings of the International Conference on Machine Learning, 2022

Caching with Reserves.
Proceedings of the Approximation, 2022

2021
NP-completeness of the Active Time Scheduling Problem.
CoRR, 2021

Online Knapsack with Frequency Predictions.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Logarithmic Regret from Sublinear Hints.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Dynamic Balancing for Model Selection in Bandits and RL.
Proceedings of the 38th International Conference on Machine Learning, 2021

Revenue Maximization in Transportation Networks.
Proceedings of the Approximation, 2021

Power of Hints for Online Learning with Movement Costs.
Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021

2020
Approximation algorithms for connected maximum cut and related problems.
Theor. Comput. Sci., 2020

Analyzing the Optimal Neighborhood: Algorithms for Partial and Budgeted Connected Dominating Set Problems.
SIAM J. Discret. Math., 2020

Upper Confidence Bounds for Combining Stochastic Bandits.
CoRR, 2020

Scale-Free Allocation, Amortized Convexity, and Myopic Weighted Paging.
CoRR, 2020

On Scheduling Coflows.
Algorithmica, 2020

Interleaved Caching with Access Graphs.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Online Linear Optimization with Many Hints.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Online Learning with Imperfect Hints.
Proceedings of the 37th International Conference on Machine Learning, 2020

2019
Near Optimal Coflow Scheduling in Networks.
Proceedings of the 31st ACM on Symposium on Parallelism in Algorithms and Architectures, 2019

Efficient Rematerialization for Deep Networks.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Semi-Online Bipartite Matching.
Proceedings of the 10th Innovations in Theoretical Computer Science Conference, 2019

Hiring Under Uncertainty.
Proceedings of the 36th International Conference on Machine Learning, 2019

Matroid Coflow Scheduling.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

2018
On maximum leaf trees and connections to connected maximum cut problems.
Inf. Process. Lett., 2018

Improving Online Algorithms via ML Predictions.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

2017
A Tight Approximation for Co-flow Scheduling for Minimizing Total Weighted Completion Time.
CoRR, 2017

On the Approximability of Digraph Ordering.
Algorithmica, 2017

On Scheduling Coflows - (Extended Abstract).
Proceedings of the Integer Programming and Combinatorial Optimization, 2017

2016
Data-Aware Scheduling in Datacenters.
PhD thesis, 2016

Brief Announcement: Improved Approximation Algorithms for Scheduling Co-Flows.
Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, 2016

2015
On Correcting Inputs: Inverse Optimization for Online Structured Prediction.
Proceedings of the 35th IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Science, 2015

2014
Analyzing the Optimal Neighborhood: Algorithms for Budgeted and Partial Connected Dominating Set Problems.
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

Fast influence-based coarsening for large networks.
Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2014

2013
Betweenness computation in the single graph representation of hypergraphs.
Soc. Networks, 2013

Improved algorithms and analysis for the laminar matroid secretary problem
CoRR, 2013

Firewall placement in cloud data centers.
Proceedings of the ACM Symposium on Cloud Computing, SOCC '13, 2013


  Loading...