default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Exact matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 66 matches
- 2024
- Sungjin Im, Ravi Kumar, Shi Li, Aditya Petety, Manish Purohit:
Online Load and Graph Balancing for Random Order Inputs. SPAA 2024: 491-497 - Sungjin Im, Ravi Kumar, Shi Li, Aditya Petety, Manish Purohit:
Online Load and Graph Balancing for Random Order Inputs. CoRR abs/2405.07949 (2024) - Ravi Kumar, Manish Purohit, Zoya Svitkina:
Improving Online Algorithms via ML Predictions. CoRR abs/2407.17712 (2024) - 2023
- Priyanka Shende, Manish Purohit:
Strategy-proof and envy-free mechanisms for house allocation. J. Econ. Theory 213: 105712 (2023) - Himanshu Purohit, Manish Dadhich, Pawan K. Ajmera:
Analytical study on users' awareness and acceptability towards adoption of multimodal biometrics (MMB) mechanism in online transactions: a two-stage SEM-ANN approach. Multim. Tools Appl. 82(9): 14239-14263 (2023) - Sungjin Im, Ravi Kumar, Mahshid Montazer Qaem, Manish Purohit:
Non-clairvoyant Scheduling with Predictions. ACM Trans. Parallel Comput. 10(4): 19:1-19:26 (2023) - Sharat Ibrahimpur, Manish Purohit, Zoya Svitkina, Erik Vee, Joshua R. Wang:
Efficient Caching with Reserves via Marking. ICALP 2023: 80:1-80:20 - Aditya Bhaskara, Ashok Cutkosky, Ravi Kumar, Manish Purohit:
Bandit Online Linear Optimization with Hints and Queries. ICML 2023: 2313-2336 - Sharat Ibrahimpur, Manish Purohit, Zoya Svitkina, Erik Vee, Joshua R. Wang:
Efficient Caching with Reserves via Marking. CoRR abs/2305.02508 (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 abs/2305.07440 (2023) - Oceane Bel, Joon-Seok Kim, William J. Hofer, Manisha Maharjan, Sumit Purohit, Shwetha Niddodi:
Co-Simulation Framework For Network Attack Generation and Monitoring. CoRR abs/2307.09633 (2023) - Ce Jin, Manish Purohit, Zoya Svitkina, Erik Vee, Joshua R. Wang:
New Tools for Peak Memory Scheduling. CoRR abs/2312.13526 (2023) - 2022
- Sharat Ibrahimpur, Manish Purohit, Zoya Svitkina, Erik Vee, Joshua R. Wang:
Caching with Reserves. APPROX/RANDOM 2022: 52:1-52:16 - Sungjin Im, Ravi Kumar, Aditya Petety, Manish Purohit:
Parsimonious Learning-Augmented Caching. ICML 2022: 9588-9601 - Nikhil Bansal, Christian Coester, Ravi Kumar, Manish Purohit, Erik Vee:
Learning-Augmented Weighted Paging. SODA 2022: 67-89 - Quanquan C. Liu, Manish Purohit, Zoya Svitkina, Erik Vee, Joshua R. Wang:
Scheduling with Communication Delay in Near-Linear Time. STACS 2022: 47:1-47:23 - Sungjin Im, Ravi Kumar, Aditya Petety, Manish Purohit:
Parsimonious Learning-Augmented Caching. CoRR abs/2202.04262 (2022) - Sharat Ibrahimpur, Manish Purohit, Zoya Svitkina, Erik Vee, Joshua R. Wang:
Caching with Reserves. CoRR abs/2207.05975 (2022) - 2021
- Aditya Bhaskara, Ashok Cutkosky, Ravi Kumar, Manish Purohit:
Power of Hints for Online Learning with Movement Costs. AISTATS 2021: 2818-2826 - Kshipra Bhawalkar, Kostas Kollias, Manish Purohit:
Revenue Maximization in Transportation Networks. APPROX-RANDOM 2021: 26:1-26:16 - Ashok Cutkosky, Christoph Dann, Abhimanyu Das, Claudio Gentile, Aldo Pacchiano, Manish Purohit:
Dynamic Balancing for Model Selection in Bandits and RL. ICML 2021: 2276-2285 - Aditya Bhaskara, Ashok Cutkosky, Ravi Kumar, Manish Purohit:
Logarithmic Regret from Sublinear Hints. NeurIPS 2021: 28222-28232 - Sungjin Im, Ravi Kumar, Mahshid Montazer Qaem, Manish Purohit:
Online Knapsack with Frequency Predictions. NeurIPS 2021: 2733-2743 - Ashwin Raut, Anubhav Shivhare, Neetesh Purohit, Vijay Kumar Chaurasiya, Manish Kumar:
Improving Classification Accuracy Using Data Fusion Technique in IoT. PACIS 2021: 142 - Sungjin Im, Ravi Kumar, Mahshid Montazer Qaem, Manish Purohit:
Non-Clairvoyant Scheduling with Predictions. SPAA 2021: 285-294 - Quanquan C. Liu, Manish Purohit, Zoya Svitkina, Erik Vee, Joshua R. Wang:
Scheduling with Communication Delay in Near-Linear Time. CoRR abs/2108.02770 (2021) - Aditya Bhaskara, Ashok Cutkosky, Ravi Kumar, Manish Purohit:
Logarithmic Regret from Sublinear Hints. CoRR abs/2111.05257 (2021) - Sagnik Saha, Manish Purohit:
NP-completeness of the Active Time Scheduling Problem. CoRR abs/2112.03255 (2021) - 2020
- Saba Ahmadi, Samir Khuller, Manish Purohit, Sheng Yang:
On Scheduling Coflows. Algorithmica 82(12): 3604-3629 (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): 251-270 (2020)
skipping 36 more matches
loading more results
failed to load more results, please try again later
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-10-06 09:58 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint