default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDavid A. Stanford
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j33]Blair L. Bilodeau
, David A. Stanford:
High-priority expected waiting times in the delayed accumulating priority queue with applications to health care KPIs. INFOR Inf. Syst. Oper. Res. 60(3): 285-314 (2022)- 2020
- [j32]Maryam Mojalal, David A. Stanford, Richard J. Caron:
The lower-class waiting time distribution in the delayed accumulating priority queue. INFOR Inf. Syst. Oper. Res. 58(1): 60-86 (2020) - [j31]Blair L. Bilodeau, David A. Stanford, Mark Goldszmidt, Andrew Appleton:
Simulated co-location of patients admitted to an inpatient internal medicine teaching unit: potential impacts on efficiency and physician-nurse collaboration. INFOR Inf. Syst. Oper. Res. 58(1): 109-123 (2020)
2010 – 2019
- 2019
- [j30]Na Li, David A. Stanford, Azaz B. Sharif, Richard J. Caron, Alim Pardhan:
Optimising key performance indicator adherence with application to emergency department congestion. Eur. J. Oper. Res. 272(1): 313-323 (2019) - [c2]Sally I. McClean, David A. Stanford, Lalit Garg, Naveed Khan:
Using Phase-type Models to Monitor and Predict Process Target Compliance. ICORES 2019: 82-90 - 2017
- [j29]Na Li, David A. Stanford, Peter G. Taylor, Ilze Ziedins:
Nonlinear Accumulating Priority Queues with Equivalent Linear Proxies. Oper. Res. 65(6): 1712-1721 (2017) - 2016
- [j28]Na Li, David A. Stanford:
Multi-server accumulating priority queues with heterogeneous servers. Eur. J. Oper. Res. 252(3): 866-878 (2016) - 2015
- [j27]Steve Drekic, David A. Stanford, Douglas G. Woolford, Vivian C. McAlister:
A model for deceased-donor transplant queue waiting times. Queueing Syst. Theory Appl. 79(1): 87-115 (2015) - [j26]Yaofei Xiong, Duncan J. Murdoch, David A. Stanford:
Perfect sampling of a single-server queue with periodic Poisson arrivals. Queueing Syst. Theory Appl. 80(1-2): 15-33 (2015) - [j25]Yaofei Xiong, Duncan J. Murdoch, David A. Stanford:
Perfect and nearly perfect sampling of work-conserving queues. Queueing Syst. Theory Appl. 80(3): 197-222 (2015) - 2014
- [j24]David A. Stanford, Peter G. Taylor, Ilze Ziedins:
Waiting time distributions in the accumulating priority queue. Queueing Syst. Theory Appl. 77(3): 297-330 (2014) - 2012
- [j23]Steve Drekic, David A. Stanford, Douglas G. Woolford:
A self-promoting priority model for transplant queues (abstract only). SIGMETRICS Perform. Evaluation Rev. 39(4): 26 (2012) - [j22]David A. Stanford, Peter G. Taylor, Ilze Ziedins:
A new paradigm for priority patient selection (abstract only). SIGMETRICS Perform. Evaluation Rev. 39(4): 29 (2012)
2000 – 2009
- 2009
- [j21]Zinovi L. Krougly, Irena F. Creed, David A. Stanford:
A stochastic model for generating disturbance patterns within landscapes. Comput. Geosci. 35(7): 1451-1459 (2009) - [j20]Douglas G. Woolford, David A. Stanford, Reginald J. Kulperger, Dennis Boychuk, B. Michael Wotton:
Erlangian Approximations for the Transient Analysis of a Fluid Queue Model for Forest Fire Perimeter. INFOR Inf. Syst. Oper. Res. 47(4): 305-317 (2009) - 2008
- [j19]V. Ramaswami, Douglas G. Woolford, David A. Stanford:
The erlangization method for Markovian fluid flows. Ann. Oper. Res. 160(1): 215-225 (2008) - 2007
- [j18]Serge B. Provost, David A. Stanford, Kaiqi Yu:
On Approximating the Distribution of Random Distances Within and Between Certain Regions of Space. INFOR Inf. Syst. Oper. Res. 45(2): 51-63 (2007) - [i1]Kaiqi Yu, David A. Stanford, Jiandong Ren:
Erlangian Approximation to Finite Time Ruin Probabilities in Perturbed Risk Models. Numerical Methods for Structured Markov Chains 2007 - 2005
- [j17]Zinovi L. Krougly, David A. Stanford:
Iterative algorithms for performance evaluation of closed network models. Perform. Evaluation 61(1): 41-64 (2005) - 2003
- [j16]Elizabeth M. Jewkes, David A. Stanford:
A Two Priority Queue with Crossover Feedback. Queueing Syst. Theory Appl. 43(1-2): 129-146 (2003) - 2001
- [j15]Steve Drekic, David A. Stanford:
Reducing Delay in Preemptive Repeat Priority Queues. Oper. Res. 49(1): 145-156 (2001) - 2000
- [j14]Steve Drekic, David A. Stanford:
Threshold-based interventions to optimize performance in preemptive priority queues. Queueing Syst. Theory Appl. 35(1-4): 289-315 (2000) - [j13]David A. Stanford, Steve Drekic:
Interdeparture time distributions in SM/G/1 priority queues. Queueing Syst. Theory Appl. 36(1-3): 1-21 (2000)
1990 – 1999
- 1999
- [j12]Qi-Ming He, David A. Stanford:
Distributions of the Interdeparture Times in FCFS and Nonpreemptive Priority MMAP [2]/G [2]/1 Queues. Perform. Evaluation 38(2): 85-103 (1999) - 1997
- [j11]David A. Stanford:
Waiting and Interdeparture Times in Priority Queues with Poisson- and General-Arrival Streams. Oper. Res. 45(5): 725-735 (1997) - 1996
- [j10]David A. Stanford, Myron Hlynka:
Observing general service queues before joining. Oper. Res. Lett. 18(5): 237-245 (1996) - [j9]Michel Gendreau, Brunilde Sansò, David A. Stanford:
Optimizing routing in packet-switched networks with non-Poisson offered traffic. Telecommun. Syst. 5(2): 323-340 (1996) - 1994
- [j8]Myron Hlynka, David A. Stanford, Wai-Hang Poon, T. Wang:
Observing Queues Before Joining. Oper. Res. 42(2): 365-371 (1994) - [j7]Gennadi Falin, Zohel Khalil, David A. Stanford:
Performance analysis of a hybrid switching system where voice messages can be queued. Queueing Syst. Theory Appl. 16(1-2): 51-65 (1994) - 1992
- [j6]Wolfgang Fischer, David A. Stanford:
Approximations for the Per-Class Waiting Time and Interdepearture Time in the Sigma_i GI_i/GI_i/1 Queue. Perform. Evaluation 14(2): 65-78 (1992) - 1991
- [j5]David A. Stanford:
Interdeparture-Time Distributions in the Nonpreemptive Priority \Sigma M_i/G_i/1 Queue. Perform. Evaluation 12(1): 43-60 (1991)
1980 – 1989
- 1989
- [j4]David A. Stanford, Wolfgang Fischer:
The Interdeparture-Time Distribution for Each Class in the SigmaiMi/Gi/1 Queue. Queueing Syst. Theory Appl. 4(3): 179-191 (1989) - 1987
- [j3]David A. Stanford, Bernard Pagurek, C. Murray Woodside:
The Serial Correlation Coefficients for Waiting Times in the Stationary GI/M/m Queue. Queueing Syst. Theory Appl. 2(4): 373-380 (1987) - 1986
- [c1]David A. Stanford, Misbah Islam:
Comparative Network Strategies for the Management of Mutual Consistency in Distributed Databases. ICCC 1986: 681-686 - 1984
- [j2]C. Murray Woodside, David A. Stanford, Bernard Pagurek:
Optimal Prediction of Queue Lengths and Delays in GI/M/m Multiserver Queues. Oper. Res. 32(4): 809-817 (1984) - 1983
- [j1]David A. Stanford, Bernard Pagurek, C. Murray Woodside:
Optimal Prediction of Times and Queue Lengths in the GI/M/1 Queue. Oper. Res. 31(2): 322-337 (1983)
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:52 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:
