default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJamol Pender
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j24]William A. Massey, Emmanuel Ekwedike, Robert C. Hampshire, Jamol Pender
:
A transient symmetry analysis for the M/M/1/k queue. Queueing Syst. Theory Appl. 103(1-2): 1-43 (2023)- [c12]Adam Cahall, Jasmine Eng, Jane Gao, Ben Hilbert, Jamol Pender:
Using Simulation to Study The Impact of Covid-19 Policies on The Availability of Childcare. WSC 2023: 958-969 - [c11]Sophia Gunluk, Yidan Zhang, Jamol Pender:
Simulating Justice: Simulation of Stochastic Models for Community Bail Funds. WSC 2023: 2813-2824 - 2022
- [j23]Philip Doldo, Jamol Pender:
Queues with Updating Information: Finding the Amplitude of Oscillations. Int. J. Bifurc. Chaos 32(3): 2230006:1-2230006:20 (2022) - [j22]Philip Doldo, Jamol Pender:
Multidelay Differential Equations: A Taylor Expansion Approach. Int. J. Bifurc. Chaos 32(3): 2250034:1-2250034:31 (2022) - [j21]Jamol Pender:
k-Nearest Neighbor Queues with Delayed Information. Int. J. Bifurc. Chaos 32(12): 2250174:1-2250174:14 (2022) - [j20]Philip Doldo, Jamol Pender:
Queues with Delayed Information: Analyzing the Impact of the Choice Model Function. Int. J. Bifurc. Chaos 32(13): 2250194:1-2250194:21 (2022) - [j19]Faouzi Lakrad, Jamol Pender, Richard H. Rand:
Queues with Delayed Information: A Dynamical Systems Perspective. SIAM J. Appl. Dyn. Syst. 21(1): 676-713 (2022) - 2021
- [j18]Philip Doldo, Jamol Pender, Richard H. Rand:
Breaking the Symmetry in Queues with Delayed Information. Int. J. Bifurc. Chaos 31(9): 2130027:1-2130027:23 (2021) - [c10]Christopher Archer, Matthew Ziron, Jamol Pender:
Ride Along: Using Simulation To Staff The Ithaca Police Department. WSC 2021: 1-12 - [c9]Sergio Palomo, Jamol Pender:
Learning the Tandem Network Lindley Recursion. WSC 2021: 1-12 - [c8]Sergio Palomo, Jamol Pender:
Measuring the Overlap with Other Customers in the Single Server Queue. WSC 2021: 1-12 - [c7]Jamol Pender, Sukriti Sudhakar, Eva Zhang:
Combining Simulation and Machine Learning for Response Time Prediction for the Shortest Remaining Processing Time Discipline. WSC 2021: 1-12 - [c6]Jamol Pender, Elena Zhang:
Uniting Simulation and Machine Learning For Response Time Prediction In Processor Sharing Queues. WSC 2021: 1-12 - [i7]Philip Doldo, Jamol Pender:
Queues with Updating Information: Finding the Amplitude of Oscillations. CoRR abs/2104.13350 (2021) - [i6]Jamol Pender, Sergio Palomo:
Overlap Times in the Infinite Server Queue. CoRR abs/2104.14437 (2021) - 2020
- [j17]Jamol Pender, Richard H. Rand, Elizabeth Wesson:
A Stochastic Analysis of Queues with Customer Choice and Delayed Information. Math. Oper. Res. 45(3): 1104-1126 (2020) - [j16]Sophia Novitzky, Jamol Pender, Richard H. Rand, Elizabeth Wesson:
Limiting the oscillations in queues with delayed information through a novel type of delay announcement. Queueing Syst. Theory Appl. 95(3): 281-330 (2020) - [c5]Sergio Palomo, Jamol Pender:
Learning Lindley's Recursion. WSC 2020: 644-655 - [i5]Andrew Daw, Antonio Castellanos, Galit B. Yom-Tov, Jamol Pender, Leor Gruendlinger:
The Co-Production of Service: Modeling Service Times in Contact Centers Using Hawkes Processes. CoRR abs/2004.07861 (2020) - [i4]Sergio Palomo, Jamol Pender, William A. Massey, Robert C. Hampshire:
Flattening the Curve: Insights From Queueing Theory. CoRR abs/2004.09645 (2020)
2010 – 2019
- 2019
- [j15]Andrew Daw, Jamol Pender:
On the distributions of infinite server queues with batch arrivals. Queueing Syst. Theory Appl. 91(3-4): 367-401 (2019) - [j14]Sophia Novitzky, Jamol Pender, Richard H. Rand, Elizabeth Wesson:
Nonlinear Dynamics in Queueing Theory: Determining the Size of Oscillations in Queues with Delay. SIAM J. Appl. Dyn. Syst. 18(1): 279-311 (2019) - [c4]Aditya Shah, Anders Wikum, Jamol Pender:
Using Simulation to Study the Last to Enter Service Delay Announcement in Multiserver Queues with Abandonment. WSC 2019: 2595-2605 - [i3]Andrew Daw, Robert C. Hampshire, Jamol Pender:
Beyond Safety Drivers: Staffing a Teleoperations System for Autonomous Vehicles. CoRR abs/1907.12650 (2019) - [i2]Michelangelo Harris, Brian Liu, Cean Park, Ravi Ramireddy, Gloria Ren, Max Ren, Shangdi Yu, Andrew Daw, Jamol Pender:
Analyzing the Spotify Top 200 Through a Point Process Lens. CoRR abs/1910.01445 (2019) - 2018
- [j13]William A. Massey, Jamol Pender:
Dynamic rate Erlang-A queues. Queueing Syst. Theory Appl. 89(1-2): 127-164 (2018) - [c3]Samantha Nirenberg, Andrew Daw, Jamol Pender:
The Impact of Queue Length Rounding and delayed App Information on Disney World Queues. WSC 2018: 3849-3860 - 2017
- [j12]Jamol Pender, Richard H. Rand, Elizabeth Wesson:
Queues with Choice via Delay Differential Equations. Int. J. Bifurc. Chaos 27(4): 1730016:1-1730016:20 (2017) - [j11]Jamol Pender:
Sampling the Functional Kolmogorov Forward Equations for Nonstationary Queueing Networks. INFORMS J. Comput. 29(1): 1-17 (2017) - [j10]Jamol Pender, Young Myoung Ko:
Approximations for the Queue Length Distributions of Time-Varying Many-Server Queues. INFORMS J. Comput. 29(4): 688-704 (2017) - [j9]Young Myoung Ko, Jamol Pender:
Diffusion limits for the (MAPt/Pht/∞)N queueing network. Oper. Res. Lett. 45(3): 248-253 (2017) - [c2]Marie Kahara, Jamol Pender:
Using simulation to study the impact of racial demographics on blood transfusion allocation policies. WSC 2017: 2786-2797 - 2016
- [j8]Jamol Pender:
Risk measures and their application to staffing nonstationary service systems. Eur. J. Oper. Res. 254(1): 113-126 (2016) - [j7]Otis B. Jennings, Jamol Pender:
Comparisons of ticket and standard queues. Queueing Syst. Theory Appl. 84(1-2): 145-202 (2016) - [j6]Jamol Pender:
An analysis of nonstationary coupled queues. Telecommun. Syst. 61(4): 823-838 (2016) - [c1]Jamol Pender, Tuan Phung-Duc:
A Law of Large Numbers for M/M/c/Delayoff-Setup Queues with Nonstationary Arrivals. ASMTA 2016: 253-268 - 2015
- [j5]Jamol Pender:
The truncated normal distribution: Applications to queues with impatient customers. Oper. Res. Lett. 43(1): 40-45 (2015) - 2014
- [j4]Jamol Pender:
A Poisson-Charlier approximation for nonstationary queues. Oper. Res. Lett. 42(4): 293-298 (2014) - [j3]Jamol Pender:
Gram Charlier Expansion for Time Varying Multiserver Queues with Abandonment. SIAM J. Appl. Math. 74(4): 1238-1265 (2014) - [i1]Stefan Engblom, Jamol Pender:
Approximations for the Moments of Nonstationary and State Dependent Birth-Death Queues. CoRR abs/1406.6164 (2014) - 2013
- [j2]William A. Massey, Jamol Pender:
Gaussian skewness approximation for dynamic rate multi-server queues with abandonment. Queueing Syst. Theory Appl. 75(2-4): 243-277 (2013) - 2011
- [j1]William A. Massey, Jamol Pender:
Poster: skewness variance approximation for dynamic rate MultiServer queues with abandonment. SIGMETRICS Perform. Evaluation Rev. 39(2): 74 (2011)
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-04-25 05:59 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:
