default search action
Subhankar Banerjee
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j5]Subhankar Banerjee, Sennur Ulukus:
The Freshness Game: Timely Communications in the Presence of an Adversary. IEEE/ACM Trans. Netw. 32(5): 4067-4084 (2024) - [c15]Subhankar Banerjee, Sennur Ulukus:
When to Preempt in a Status Update System? ISIT 2024: 1379-1384 - [i11]Subhankar Banerjee, Sennur Ulukus:
When to Preempt in a Status Update System? CoRR abs/2402.00845 (2024) - 2023
- [j4]Subhankar Banerjee, Sennur Ulukus, Anthony Ephremides:
Age of information games between power constrained schedulers and adversaries. J. Commun. Networks 25(5): 631-642 (2023) - [c14]Subhankar Banerjee, Sennur Ulukus, Anthony Ephremides:
Minimizing the Age of Information Over an Erasure Channel for Random Packet Arrivals With a Storage Option at the Transmitter. ACSSC 2023: 95-100 - [c13]Subhankar Banerjee, Sennur Ulukus, Anthony Ephremides:
Age of Information of a Power Constrained Scheduler in the Presence of a Power Constrained Adversary. INFOCOM Workshops 2023: 1-6 - [c12]Subhankar Banerjee, Sennur Ulukus, Anthony Ephremides:
To Re-Transmit or Not to Re-Transmit for Freshness. WiOpt 2023: 516-523 - [c11]Subhankar Banerjee, Priyanka Kaswan, Sennur Ulukus:
Age-Based Cache Updating Under Timestomping. WiOpt 2023: 635-642 - [i10]Subhankar Banerjee, Sennur Ulukus, Anthony Ephremides:
Age of Information of a Power Constrained Scheduler in the Presence of a Power Constrained Adversary. CoRR abs/2301.01276 (2023) - [i9]Subhankar Banerjee, Sennur Ulukus, Anthony Ephremides:
Minimizing the Age of Information Over an Erasure Channel for Random Packet Arrivals With a Storage Option at the Transmitter. CoRR abs/2301.04116 (2023) - [i8]Subhankar Banerjee, Sennur Ulukus:
The Freshness Game: Timely Communications in the Presence of an Adversary. CoRR abs/2302.14024 (2023) - [i7]Subhankar Banerjee, Sennur Ulukus, Anthony Ephremides:
To Re-transmit or Not to Re-transmit for Freshness. CoRR abs/2305.10392 (2023) - [i6]Subhankar Banerjee, Priyanka Kaswan, Sennur Ulukus:
Age-Based Cache Updating Under Timestomping. CoRR abs/2307.09443 (2023) - 2022
- [c10]Subhankar Banerjee, Chung Shue Chen, Marceau Coupechoux, Abhishek Sinha:
Joint Power and Subcarrier Allocation in Multi-Cell Multi-Carrier NOMA. ICUFN 2022: 180-185 - [c9]Subhankar Banerjee, Sennur Ulukus:
Age of Information in the Presence of an Adversary. INFOCOM Workshops 2022: 1-8 - [c8]Subhankar Banerjee, Sennur Ulukus:
Game Theoretic Analysis of an Adversarial Status Updating System. ISIT 2022: 2070-2075 - [i5]Subhankar Banerjee, Sennur Ulukus:
Age of Information in the Presence of an Adversary. CoRR abs/2202.04050 (2022) - [i4]Subhankar Banerjee, Sennur Ulukus:
Game Theoretic Analysis of an Adversarial Status Updating System. CoRR abs/2202.05233 (2022) - [i3]Subhankar Banerjee, Chung Shue Chen, Marceau Coupechoux, Abhishek Sinha:
Joint Power and Subcarrier Allocation in Multi-Cell Multi-Carrier NOMA. CoRR abs/2204.00120 (2022) - 2021
- [c7]Subhankar Banerjee, Shayok Chakraborty:
Deterministic Mini-batch Sequencing for Training Deep Neural Networks. AAAI 2021: 6723-6731 - 2020
- [j3]Rajarshi Bhattacharjee, Subhankar Banerjee, Abhishek Sinha:
Fundamental Limits on the Regret of Online Network-Caching. Proc. ACM Meas. Anal. Comput. Syst. 4(2): 25:1-25:31 (2020) - [c6]Subhankar Banerjee, Shayok Chakraborty:
Budgeted Subset Selection for Fine-tuning Deep Learning Architectures in Resource-Constrained Applications. IJCNN 2020: 1-10 - [c5]Subhankar Banerjee, Rajarshi Bhattacharjee, Abhishek Sinha:
Fundamental Limits of Age-of-Information in Stationary and Non-stationary Environments. ISIT 2020: 1741-1746 - [c4]Rajarshi Bhattacharjee, Subhankar Banerjee, Abhishek Sinha:
Fundamental Limits on the Regret of Online Network-Caching. SIGMETRICS (Abstracts) 2020: 15-16 - [i2]Subhankar Banerjee, Rajarshi Bhattacharjee, Abhishek Sinha:
Fundamental Limits of Age-of-Information in Stationary and Non-stationary Environments. CoRR abs/2001.05471 (2020) - [i1]Rajarshi Bhattacharjee, Subhankar Banerjee, Abhishek Sinha:
Fundamental Limits of Online Network-Caching. CoRR abs/2003.14085 (2020)
2010 – 2019
- 2019
- [c3]Subhankar Banerjee, Shayok Chakraborty:
Deepsub: A Novel Subset Selection Framework for Training Deep Learning Architectures. ICIP 2019: 1615-1619 - [c2]Subhankar Banerjee, K. Giridhar:
A Novel Method for Non-Stationary CFO Estimation and Tracking in Inter-UAV OFDM Links. VTC Fall 2019: 1-5
2000 – 2009
- 2002
- [j2]James A. Aries, Subhankar Banerjee, Marc S. Brittan, Eric Dillon, Janusz S. Kowalik, John P. Lixvar:
Capacity and performance analysis of distributed enterprise systems. Commun. ACM 45(6): 100-105 (2002) - 2001
- [j1]Joseph W. Manke, G. David Kerlick, David Levine, Subhankar Banerjee, Eric Dillon:
Parallel performance of two applications in the Boeing high performance computing benchmark suite. Parallel Comput. 27(4): 457-475 (2001)
1990 – 1999
- 1995
- [c1]Mikhail Auguston, Subhankar Banerjee, Manish Mamnani, Ghulam Nabi, Juris Reinfelds, Ugis Sarkans, Ivan Strnad:
AUI - the Debugger and Assertion Checker for the Awk Programming Language. AADEBUG 1995: 309-310
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-10-31 20:15 CET 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: