 | 2001 |
| 14 |  | Rolf Schassberger:
On the Existence of Invariant Measures for Networks with String Transitions.
Queueing Syst. 38(3): 265-285 (2001) |
| 1999 |
| 13 |  | Alexandr A. Borovkov,
Dmitry Korshunov,
Rolf Schassberger:
Ergodicity of a polling network with an infinite number of stations.
Queueing Syst. 32(1-3): 169-193 (1999) |
| 1993 |
| 12 |  | 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 |
| 11 |  | Rolf Schassberger:
The BCD queue and its ramifications.
Queueing Syst. 11(4): 377-393 (1992) |
| 1989 |
| 10 |  | Philippe Robert,
Rolf Schassberger:
On the M/G/1 Foreground-Background Processor-Sharing Queue.
Queueing Syst. 4(3): 281-286 (1989) |
| 1987 |
| 9 |  | 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 |
| 8 |  | Rolf Schassberger:
Exact Results on Response Time Distributions in Networks of Queues.
MMB 1985: 115-126 |
| 1983 |
| 7 |  | Rolf Schassberger:
An Aggregation Principle for Computing Invariant Probability Vectors for Semi-Markovian Models.
Computer Performance and Reliability 1983: 259-273 |
| 6 |  | Rolf Schassberger,
Hans Daduna:
A Discrete Time technique for Solving Closed Queueing Network Models of Computer Systems.
MMB 1983: 122-134 |
| 5 |  | Rolf Schassberger,
Hans Daduna:
The Time for a Round Trip in a Cycle of Exponential Queues
J. ACM 30(1): 146-150 (1983) |
| 1981 |
| 4 |  | Hans Daduna,
Rolf Schassberger:
A Discrete-Time Round-Robin Queue with Bernoulli Input and General Arithmetic Service Time Distributions.
Acta Inf. 15: 251-263 (1981) |
| 3 |  | Rolf Schassberger:
On the Response Time Distribution in a Discrete Round-Robin Queue.
Acta Inf. 16: 57-62 (1981) |
| 1969 |
| 2 |  | Rolf Schassberger:
A service system with two parallel queues.
Computing 4(1): 24-29 (1969) |
| 1968 |
| 1 |  | Rolf Schassberger:
Ein Wartesystem mit zwei parallelen Warteschlangen.
Computing 3(2): 110-124 (1968) |