![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Ronald W. Wolff
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
- [j17]Ronald W. Wolff, Yi-Ching Yao
:
Little's law when the average waiting time is infinite. Queueing Syst. Theory Appl. 76(3): 267-281 (2014) - 2012
- [c1]Chia-Li Wang, Ronald W. Wolff:
Hybrid simulation for conditional estimators over an infinite interval. WSC 2012: 333:1-333:2
2000 – 2009
- 2009
- [j16]Chia-Li Wang, Ronald W. Wolff:
Loss probability properties in retrial queues. Oper. Res. Lett. 37(1): 47-50 (2009) - 2007
- [j15]Felix Papier
, Ronald W. Wolff, Ulrich W. Thonemann
:
On the convexity of loss probabilities when arrivals occur in batches and servers are heterogeneous. Oper. Res. Lett. 35(4): 467-471 (2007) - 2005
- [j14]Chia-Li Wang, Ronald W. Wolff:
Work-Conserving Tandem Queues. Queueing Syst. Theory Appl. 49(3-4): 283-296 (2005) - 2003
- [j13]Chia-Li Wang, Ronald W. Wolff:
Efficient simulation of queues in heavy traffic. ACM Trans. Model. Comput. Simul. 13(1): 62-81 (2003)
1990 – 1999
- 1998
- [j12]Chia-Li Wang, Ronald W. Wolff:
The M/G/c queue in light traffic. Queueing Syst. Theory Appl. 29(1): 17-34 (1998) - 1993
- [j11]Karl Sigman, Ronald W. Wolff:
A Review of Regenerative Processes. SIAM Rev. 35(2): 269-288 (1993) - 1991
- [j10]Ronald W. Wolff:
On Finite Delay-Moment Conditions in Queues. Oper. Res. 39(5): 771-775 (1991) - 1990
- [j9]Ronald W. Wolff:
A Note on PASTA and Anti-PASTA for Continuous-Time Markov Chains. Oper. Res. 38(1): 176-177 (1990)
1980 – 1989
- 1989
- [j8]S. Ghahramani, Ronald W. Wolff:
A New Proof of Finite Moment Conditions for GI/G/1 Busy Periods. Queueing Syst. Theory Appl. 4(2): 171-178 (1989) - 1988
- [j7]Betsy S. Greenberg, Robert C. Leachman, Ronald W. Wolff:
Predicting Dispatching Delays on a Low Speed, Single Track Railroad. Transp. Sci. 22(1): 31-38 (1988) - 1984
- [j6]Ronald W. Wolff:
Conditions for Finite Ladder Height and Delay Moments. Oper. Res. 32(4): 909-916 (1984) - 1982
- [j5]Ronald W. Wolff:
Poisson Arrivals See Time Averages. Oper. Res. 30(2): 223-231 (1982) - [j4]Michael L. Pinedo, Ronald W. Wolff:
A Comparison Between Tandem Queues with Dependent and Independent Service Times. Oper. Res. 30(3): 464-479 (1982) - [j3]Ronald W. Wolff:
Tandem Queues with Dependent Service Times in Light Traffic. Oper. Res. 30(4): 619-635 (1982) - 1980
- [j2]Francis L. Gunther, Ronald W. Wolff:
The Almost Regenerative Method for Stochastic System Simulations. Oper. Res. 28(2): 375-386 (1980)
1970 – 1979
- 1974
- [j1]Shantanu V. Tembe, Ronald W. Wolff:
The Optimal Order of Service in Tandem Queues. Oper. Res. 22(4): 824-832 (1974)
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-08-05 21:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint