default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWilliam A. Massey
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j27]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)- 2020
- [i1]Sergio Palomo, Jamol Pender, William A. Massey, Robert C. Hampshire:
Flattening the Curve: Insights From Queueing Theory. CoRR abs/2004.09645 (2020)
2010 – 2019
- 2018
- [j26]William A. Massey, Jamol Pender:
Dynamic rate Erlang-A queues. Queueing Syst. Theory Appl. 89(1-2): 127-164 (2018) - 2013
- [j25]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
- [j24]William A. Massey, Jamol Pender:
Poster: skewness variance approximation for dynamic rate MultiServer queues with abandonment. SIGMETRICS Perform. Evaluation Rev. 39(2): 74 (2011)
2000 – 2009
- 2008
- [j23]Zohar Feldman, Avishai Mandelbaum, William A. Massey, Ward Whitt:
Staffing of Time-Varying Queues to Achieve Time-Stable Performance. Manag. Sci. 54(2): 324-338 (2008) - [j22]Robert C. Hampshire, William A. Massey:
A note on the event horizon for a processor sharing queue. Queueing Syst. Theory Appl. 59(3-4): 185-190 (2008) - 2006
- [j21]Robert C. Hampshire, Mor Harchol-Balter, William A. Massey:
Fluid and diffusion limits for transient sojourn times of processor sharing queues with time varying rates. Queueing Syst. Theory Appl. 53(1-2): 19-30 (2006) - 2005
- [c7]Robert C. Hampshire, William A. Massey:
Variational optimization for call center staffing. Richard Tapia Celebration of Diversity in Computing Conference 2005: 4-6 - 2004
- [c6]William A. Massey, K. G. Ramakrisluian, M. Aravamudan, G. A. Vijayalakshmi Pai:
Scheduling algorithms for downlink services in wireless networks: a Markov decision process approach. GLOBECOM 2004: 4038-4042 - 2003
- [c5]Ahmad D. Ridley, Michael C. Fu, William A. Massey:
Customer relations management: call center operations: fluid approximations for a priority call center with time-varying arrivals. WSC 2003: 1817-1823 - 2002
- [j20]Avishai Mandelbaum, William A. Massey, Martin I. Reiman, Alexander L. Stolyar, Brian Rider:
Queue Lengths and Waiting Times for Multiserver Queues with Abandonment and Retrials. Telecommun. Syst. 21(2): 149-171 (2002) - [j19]William A. Massey:
The Analysis of Queues with Time-Varying Rates for Telecommunication Models. Telecommun. Syst. 21(2): 173-204 (2002) - 2001
- [j18]Nick G. Duffield, William A. Massey, Ward Whitt:
A Nonstationary Offered-Load Model for Packet Networks. Telecommun. Syst. 16(3-4): 271-296 (2001)
1990 – 1999
- 1998
- [j17]Avishai Mandelbaum, William A. Massey, Martin I. Reiman:
Strong approximations for Markovian service networks. Queueing Syst. Theory Appl. 30(1-2): 149-201 (1998) - 1997
- [j16]William A. Massey, Raj Srinivasan:
A Packet Delay Analysis for Cellular Digital Packet Data. IEEE J. Sel. Areas Commun. 15(7): 1364-1372 (1997) - [j15]William A. Massey, Ward Whitt:
Peak Congestion in Multi-Server Service Systems with Slowly Varying Arrival Rates. Queueing Syst. Theory Appl. 25(1-4): 157-172 (1997) - [j14]Otis B. Jennings, William A. Massey:
A modified offered load approximation for nonstationary circuit switched networks. Telecommun. Syst. 7(1-3): 229-251 (1997) - [j13]Nathaniel Grier, William A. Massey, Tyrone McKoy, Ward Whitt:
The time-dependent Erlang loss model with retrials. Telecommun. Syst. 7(1-3): 253-265 (1997) - 1996
- [j12]William A. Massey, Ward Whitt:
Stationary-Process Approximations for the Nonstationary Erlang Loss Model. Oper. Res. 44(6): 976-983 (1996) - [j11]William A. Massey, Geraldine A. Parker, Ward Whitt:
Estimating the parameters of a nonhomogeneous Poisson process with linear rate. Telecommun. Syst. 5(2): 361-388 (1996) - 1995
- [j10]Avi Mandelbaum, William A. Massey:
Strong Approximations for Time-Dependent Queues. Math. Oper. Res. 20(1): 33-64 (1995) - 1994
- [j9]Kin K. Leung, William A. Massey, Ward Whitt:
Traffic models for wireless communication networks. IEEE J. Sel. Areas Commun. 12(8): 1353-1364 (1994) - [j8]William A. Massey, Ward Whitt:
Unstable Asymptomatics for Nonstationary Queues. Math. Oper. Res. 19(2): 267-291 (1994) - [j7]François Baccelli, William A. Massey, Paul E. Wright:
Determining the Exit Time Distribution for a Closed Cyclic Network. Theor. Comput. Sci. 125(1): 149-165 (1994) - [c4]Kin K. Leung, William A. Massey, Ward Whitt:
Traffic Models for Wireless Communication Networks. INFOCOM 1994: 1029-1037 - 1993
- [j6]Stephen G. Eick, William A. Massey, Ward Whitt:
The Physics of the Mt/G/∞ Queue. Oper. Res. 41(4): 731-742 (1993) - [j5]William A. Massey, Ward Whitt:
Networks of infinite-server queues with nonstationary Poisson input. Queueing Syst. Theory Appl. 13(1-3): 183-250 (1993) - 1991
- [j4]William A. Massey, Rengarajan Srinivasan:
A Heavy Traffic Analysis for Semi-Open Networks. Perform. Evaluation 13(1): 59-66 (1991) - 1990
- [c3]William A. Massey, Rengarajan Srinivasan:
A Heavy Traffic Analysis for Semi-Open Networks. Performance 1990: 289-300
1980 – 1989
- 1989
- [j3]François Baccelli, William A. Massey, Donald F. Towsley:
Acyclic fork-join queuing networks. J. ACM 36(3): 615-642 (1989) - 1987
- [j2]William A. Massey:
Stochastic Orderings for Markov Processes on Partially Ordered Spaces. Math. Oper. Res. 12(2): 350-367 (1987) - [c2]François Baccelli, William A. Massey:
On the Busy Period of Certain Classes of Queueing Networks. Computer Performance and Reliability 1987: 3-11 - 1986
- [c1]William A. Massey:
A Probabilistic Analysis of a Database System. SIGMETRICS 1986: 141-146 - 1985
- [j1]William A. Massey:
Asymptotic Analysis of the Time Dependent M/M/1 Queue. Math. Oper. Res. 10(2): 305-327 (1985)
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-24 23:11 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:
