Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDebankur Mukherjee
Person information
- affiliation: Georgia Tech, School of Industrial and Systems Engineering, USA
- affiliation: University of Technology, Eindhoven, The Netherlands
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j17]Daan Rutten
, Debankur Mukherjee:
A New Approach to Capacity Scaling Augmented with Unreliable Machine Learning Predictions. Math. Oper. Res. 49(1): 476-508 (2024)- [j16]Zhisheng Zhao, Debankur Mukherjee:
Optimal Rate-Matrix Pruning For Heterogeneous Systems. SIGMETRICS Perform. Evaluation Rev. 51(4): 26-27 (2024) - [c9]Neelkamal Bhuyan, Debankur Mukherjee, Adam Wierman:
Best of Both Worlds Guarantees for Smoothed Online Quadratic Optimization. ICML 2024 - [c8]Daan Rutten, Martin Zubeldia, Debankur Mukherjee:
Distributed Speed Scaling in Large-Scale Service Systems. SIGMETRICS/Performance (Abstracts) 2024: 95-96 - 2023
- [j15]Daan Rutten, Debankur Mukherjee:
Load Balancing Under Strict Compatibility Constraints. Math. Oper. Res. 48(1): 227-256 (2023) - [j14]Daan Rutten, Nicolas Christianson, Debankur Mukherjee, Adam Wierman:
Smoothed Online Optimization with Unreliable Predictions. Proc. ACM Meas. Anal. Comput. Syst. 7(1): 12:1-12:36 (2023) - [j13]Zhisheng Zhao, Debankur Mukherjee:
Optimal Rate-Matrix Pruning For Heterogeneous Systems. SIGMETRICS Perform. Evaluation Rev. 51(2): 18-20 (2023) - [j12]Daan Rutten, Martin Zubeldia, Debankur Mukherjee:
Distributed Rate Scaling in Large-Scale Service Systems. SIGMETRICS Perform. Evaluation Rev. 51(2): 21-23 (2023) - [c7]Daan Rutten, Debankur Mukherjee:
Mean-field Analysis for Load Balancing on Spatial Graphs. SIGMETRICS (Abstracts) 2023: 27-28 - [c6]Daan Rutten, Nicolas Christianson, Debankur Mukherjee, Adam Wierman:
Smoothed Online Optimization with Unreliable Predictions. SIGMETRICS (Abstracts) 2023: 71-72 - [i15]Zhisheng Zhao, Debankur Mukherjee:
Optimal Rate-Matrix Pruning For Large-Scale Heterogeneous Systems. CoRR abs/2306.00274 (2023) - [i14]Neelkamal Bhuyan, Debankur Mukherjee, Adam Wierman:
Best of Both Worlds: Stochastic and Adversarial Convex Function Chasing. CoRR abs/2311.00181 (2023) - 2022
- [j11]Diego Goldsztajn, Sem C. Borst, Johan S. H. van Leeuwaarden, Debankur Mukherjee, Philip A. Whiting:
Self-Learning Threshold-Based Load Balancing. INFORMS J. Comput. 34(1): 39-54 (2022) - [j10]Debankur Mukherjee:
Rates of convergence of the join the shortest queue policy for large-system heavy traffic. Queueing Syst. Theory Appl. 100(3-4): 317-319 (2022) - [j9]Mark van der Boor, Sem C. Borst, Johan S. H. van Leeuwaarden, Debankur Mukherjee:
Scalable Load Balancing in Networked Systems: A Survey of Recent Advances. SIAM Rev. 64(3): 554-622 (2022) - [j8]Daan Rutten, Debankur Mukherjee:
Capacity Scaling Augmented With Unreliable Machine Learning Predictions. SIGMETRICS Perform. Evaluation Rev. 49(2): 24-26 (2022) - [i13]Daan Rutten, Nicolas Christianson, Debankur Mukherjee, Adam Wierman:
Online Optimization with Untrusted Predictions. CoRR abs/2202.03519 (2022) - [i12]Zhisheng Zhao, Debankur Mukherjee, Ruoyu Wu:
Exploiting Data Locality to Improve Performance of Heterogeneous Server Clusters. CoRR abs/2211.16416 (2022) - 2021
- [c5]Daan Rutten, Debankur Mukherjee:
Load Balancing Under Strict Compatibility Constraints. SIGMETRICS (Abstracts) 2021: 51-52 - [i11]Daan Rutten, Debankur Mukherjee:
A New Approach to Capacity Scaling Augmented With Unreliable Machine Learning Predictions. CoRR abs/2101.12160 (2021) - 2020
- [j7]Debankur Mukherjee, Sem C. Borst, Johan S. H. van Leeuwaarden, Philip A. Whiting:
Asymptotic Optimality of Power-of-d Load Balancing in Large-Scale Systems. Math. Oper. Res. 45(4): 1535-1571 (2020) - [i10]Daan Rutten, Debankur Mukherjee:
Load Balancing Under Strict Compatibility Constraints. CoRR abs/2008.07562 (2020) - [i9]Diego Goldsztajn, Sem C. Borst, Johan S. H. van Leeuwaarden, Debankur Mukherjee, Philip A. Whiting:
Self-Learning Threshold-Based Load Balancing. CoRR abs/2010.15525 (2020)
2010 – 2019
- 2018
- [j6]Mark de Berg, Bart M. P. Jansen, Debankur Mukherjee:
Independent-set reconfiguration thresholds of hereditary graph classes. Discret. Appl. Math. 250: 165-182 (2018) - [j5]Debankur Mukherjee, Sem C. Borst, Johan S. H. van Leeuwaarden:
Asymptotically Optimal Load Balancing Topologies. Proc. ACM Meas. Anal. Comput. Syst. 2(1): 14:1-14:29 (2018) - [j4]Debankur Mukherjee, Alexander L. Stolyar:
Join-Idle-Queue with Service Elasticity. SIGMETRICS Perform. Evaluation Rev. 46(2): 18-20 (2018) - [c4]Debankur Mukherjee, Sem C. Borst, Johan S. H. van Leeuwaarden:
Asymptotically Optimal Load Balancing Topologies. SIGMETRICS (Abstracts) 2018: 138 - [i8]Debankur Mukherjee, Alexander L. Stolyar:
Join-Idle-Queue with Service Elasticity: Large-Scale Asymptotics of a Non-monotone System. CoRR abs/1803.07689 (2018) - [i7]Mark van der Boor, Sem C. Borst, Johan S. H. van Leeuwaarden, Debankur Mukherjee:
Scalable load balancing in networked systems: A survey of recent advances. CoRR abs/1806.05444 (2018) - [i6]Debankur Mukherjee:
Scalable Load Balancing Algorithms in Networked Systems. CoRR abs/1809.02018 (2018) - 2017
- [j3]Debankur Mukherjee, Souvik Dhara, Sem C. Borst, Johan S. H. van Leeuwaarden:
Optimal Service Elasticity in Large-Scale Distributed Systems. Proc. ACM Meas. Anal. Comput. Syst. 1(1): 25:1-25:28 (2017) - [c3]Debankur Mukherjee, Souvik Dhara, Sem C. Borst, Johan S. H. van Leeuwaarden:
Optimal Service Elasticity in Large-Scale Distributed Systems. SIGMETRICS (Abstracts) 2017: 3 - [i5]Debankur Mukherjee, Souvik Dhara, Sem C. Borst, Johan S. H. van Leeuwaarden:
Optimal Service Elasticity in Large-Scale Distributed Systems. CoRR abs/1703.08373 (2017) - [i4]Debankur Mukherjee, Sem C. Borst, Johan S. H. van Leeuwaarden:
Asymptotically Optimal Load Balancing Topologies. CoRR abs/1707.05866 (2017) - [i3]Mark van der Boor, Sem C. Borst, Johan S. H. van Leeuwaarden, Debankur Mukherjee:
Scalable Load Balancing in Networked Systems: Universality Properties and Stochastic Coupling Methods. CoRR abs/1712.08555 (2017) - 2016
- [j2]Debankur Mukherjee, Sem C. Borst, Johan S. H. van Leeuwaarden, Philip A. Whiting:
Universality of load balancing schemes on the diffusion scale. J. Appl. Probab. 53(4): 1111-1124 (2016) - [j1]Debankur Mukherjee, Sem C. Borst, Johan van Leeuwaarden, Phil Whiting:
Universality of Power-of-d Load Balancing Schemes. SIGMETRICS Perform. Evaluation Rev. 44(2): 36-38 (2016) - [c2]Debankur Mukherjee, Sem C. Borst, J. S. H. van Leeuwaarden, Philip A. Whiting:
Efficient load balancing in large-scale systems. CISS 2016: 384-389 - [c1]Mark de Berg, Bart M. P. Jansen, Debankur Mukherjee:
Independent-Set Reconfiguration Thresholds of Hereditary Graph Classes. FSTTCS 2016: 34:1-34:15 - [i2]Mark de Berg, Bart M. P. Jansen, Debankur Mukherjee:
Independent Set Reconfiguration Thresholds of Hereditary Graph Classes. CoRR abs/1610.03766 (2016) - [i1]Souvik Dhara, Debankur Mukherjee, Subhabrata Sen:
Phase transitions of extremal cuts for the configuration model. CoRR abs/1611.03075 (2016)
Coauthor Index
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.
last updated on 2024-09-04 00:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
