default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPrakirt Raj Jhunjhunwala
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2024
[b1]Prakirt Raj Jhunjhunwala:
Design and Analysis of Stochastic Processing and Matching Networks. Georgia Institute of Technology, Atlanta, GA, USA, 2024
Journal Articles
- 2026
- [j10]Martin Zubeldia
, Prakirt Raj Jhunjhunwala, Siva Theja Maguluri:
Matching Queues with Abandonments in Quantum Switches: Stability and Throughput Analysis. Oper. Res. 74(1): 339-355 (2026) - [j9]Prakirt Raj Jhunjhunwala, Martin Zubeldia, Siva Theja Maguluri:
Join-the-Shortest Queue with Abandonment: Critically Loaded and Heavily Overloaded Regimes. Math. Oper. Res. 51(1): 398-439 (2026) - 2024
- [j8]Prakirt Raj Jhunjhunwala:
Design and Analysis of Stochastic Processing and Matching Networks. SIGMETRICS Perform. Evaluation Rev. 51(3): 33-37 (2024) - [j7]Prakirt Raj Jhunjhunwala, Siva Theja Maguluri:
Heavy Traffic Joint Queue Length Distribution withoutResource Pooling. SIGMETRICS Perform. Evaluation Rev. 51(4): 16-17 (2024) - [j6]Prakirt Raj Jhunjhunwala, Daniela Hurtado-Lange, Siva Theja Maguluri:
Exponential Tail Bounds on Queues: A Confluence of Non- Asymptotic Heavy Traffic and Large Deviations. SIGMETRICS Perform. Evaluation Rev. 51(4): 18-19 (2024) - 2023
- [j5]Prakirt Raj Jhunjhunwala, Siva Theja Maguluri:
Heavy Traffic Queue Length Distribution without Resource Pooling in an Input-Queued Switch. SIGMETRICS Perform. Evaluation Rev. 50(4): 26-28 (2023) - [j4]Prakirt Raj Jhunjhunwala, Daniela Hurtado-Lange, Siva Theja Maguluri:
Exponential Tail Bounds on Queues. SIGMETRICS Perform. Evaluation Rev. 51(2): 24-26 (2023) - 2022
- [j3]Sajad Khodadadian, Prakirt Raj Jhunjhunwala, Sushil Mahavir Varma, Siva Theja Maguluri:
On linear and super-linear convergence of Natural Policy Gradient algorithm. Syst. Control. Lett. 164: 105214 (2022) - [j2]Prakirt Raj Jhunjhunwala, Siva Theja Maguluri:
Low-Complexity Switch Scheduling Algorithms: Delay Optimality in Heavy Traffic. IEEE/ACM Trans. Netw. 30(1): 464-473 (2022) - 2020
- [j1]Prakirt Raj Jhunjhunwala, Bejjipuram Sombabu, Sharayu Moharir:
Optimal AoI-Aware Scheduling and Cycles in Graphs. IEEE Trans. Commun. 68(3): 1593-1603 (2020)
Conference and Workshop Papers
- 2021
- [c3]Sajad Khodadadian, Prakirt Raj Jhunjhunwala, Sushil Mahavir Varma, Siva Theja Maguluri:
On the Linear Convergence of Natural Policy Gradient Algorithm. CDC 2021: 3794-3799 - 2018
- [c2]Prakirt Raj Jhunjhunwala, Sharayu Moharir:
Age-of-Information Aware Scheduling. SPCOM 2018: 222-226 - [c1]Prakirt Raj Jhunjhunwala, Sharayu Moharir, D. Manjunath, Aditya Gopalan:
On a Class of Restless Multi-armed Bandits with Deterministic Policies. SPCOM 2018: 487-491
Informal and Other Publications
- 2022
- [i3]Martin Zubeldia, Prakirt Raj Jhunjhunwala, Siva Theja Maguluri:
Matching Queues with Abandonments in Quantum Switches: Stability and Throughput Analysis. CoRR abs/2209.12324 (2022) - 2021
- [i2]Sajad Khodadadian, Prakirt Raj Jhunjhunwala, Sushil Mahavir Varma, Siva Theja Maguluri:
On the Linear convergence of Natural Policy Gradient Algorithm. CoRR abs/2105.01424 (2021) - 2020
- [i1]Prakirt Raj Jhunjhunwala, Siva Theja Maguluri:
Low-Complexity Switch Scheduling Algorithms: Delay Optimality in Heavy Traffic. CoRR abs/2004.12271 (2020)
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 2026-04-01 23:43 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:
