default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRolf Schassberger
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2001
[j15]Rolf Schassberger:
On the Existence of Invariant Measures for Networks with String Transitions. Queueing Syst. Theory Appl. 38(3): 265-285 (2001)
1990 – 1999
- 1999
- [j14]Alexandr A. Borovkov, Dmitry Korshunov, Rolf Schassberger:
Ergodicity of a polling network with an infinite number of stations. Queueing Syst. Theory Appl. 32(1-3): 169-193 (1999) - 1993
- [c5]Jens Braband, Rolf Schassberger:
Random Quantum Allocation: A New Approach to Waiting Time Distributions for M/M/N Processor Sharing Queues. MMB 1993: 130-142 - 1992
- [j13]Rolf Schassberger:
The BCD queue and its ramifications. Queueing Syst. Theory Appl. 11(4): 377-393 (1992)
1980 – 1989
- 1989
- [j12]Philippe Robert, Rolf Schassberger:
On the M/G/1 Foreground-Background Processor-Sharing Queue. Queueing Syst. Theory Appl. 4(3): 281-286 (1989) - 1987
- [c4]Rolf Schassberger:
A Detailed Steady-State Analysis of the M/G/1 Queue under Various Time Sharing Disciplines. Computer Performance and Reliability 1987: 431-441 - 1985
- [c3]Rolf Schassberger:
Exact Results on Response Time Distributions in Networks of Queues. MMB 1985: 115-126 - 1983
- [j11]Rolf Schassberger, Hans Daduna:
The Time for a Round Trip in a Cycle of Exponential Queues. J. ACM 30(1): 146-150 (1983) - [j10]Hans Daduna, Rolf Schaßberger:
Networks of queues in discrete time. Z. Oper. Research 27(1): 159-175 (1983) - [c2]Rolf Schassberger:
An Aggregation Principle for Computing Invariant Probability Vectors for Semi-Markovian Models. Computer Performance and Reliability 1983: 259-273 - [c1]Rolf Schassberger, Hans Daduna:
A Discrete Time technique for Solving Closed Queueing Network Models of Computer Systems. MMB 1983: 122-134 - 1982
- [j9]Werner E. Helm, Rolf Schassberger:
Insensitive Generalized Semi-Markov Schemes with Point Process Input. Math. Oper. Res. 7(1): 129-138 (1982) - 1981
- [j8]Hans Daduna, Rolf Schassberger:
A Discrete-Time Round-Robin Queue with Bernoulli Input and General Arithmetic Service Time Distributions. Acta Informatica 15: 251-263 (1981) - [j7]Rolf Schassberger:
On the Response Time Distribution in a Discrete Round-Robin Queue. Acta Informatica 16: 57-62 (1981) - [j6]Rolf Schassberger:
The doubly stochastic server: A time-sharing model. Z. Oper. Research 25(7): 179-189 (1981) - [j5]Rolf Schassberger:
Reversibility and stochastic networks: Review of: Kelly F.P., (Wiley, 1980). Perform. Evaluation 1(1): 90 (1981)
1970 – 1979
- 1979
- [j4]Rolf Schassberger:
A definition of discrete product form distributions. Z. Oper. Research 23(5): 189-195 (1979) - 1976
- [j3]Rolf Schassberger:
On the Equilibrium Distribution of a Class of Finite-State Generalized Semi-Markov Processes. Math. Oper. Res. 1(4): 395-406 (1976)
1960 – 1969
- 1969
- [j2]Rolf Schassberger:
A service system with two parallel queues. Computing 4(1): 24-29 (1969) - 1968
- [j1]Rolf Schassberger:
Ein Wartesystem mit zwei parallelen Warteschlangen. Computing 3(2): 110-124 (1968)
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:10 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:
