The following pages link to Robert B. Cooper (Q1271253):
Displayed 21 items.
- Some reflections on the renewal-theory paradox in queueing theory (Q1271254) (← links)
- Heterogeneous-server loss systems with ordered entry: An anomaly (Q1823846) (← links)
- Relating polling models with zero and nonzero switchover times (Q1892647) (← links)
- A duality relation for busy cycles in GI/G/1 queues (Q2277685) (← links)
- When Does Forced Idle Time Improve Performance in Polling Models? (Q2784014) (← links)
- (Q3484145) (← links)
- Stochastic Decompositions in the <i>M</i>/<i>G</i>/1 Queue with Generalized Vacations (Q3712098) (← links)
- Benes's formula for <i>M</i>/<i>G</i>/1–FIFO ‘explained' by preemptive-resume LIFO (Q3738369) (← links)
- Information-theoretic Complexity of Program Specifications (Q3761671) (← links)
- Duality and Other Results for <i>M</i>/<i>G</i>/1 and <i>GI</i>/<i>M</i>/1 Queues, Via a New Ballot Theorem (Q3829326) (← links)
- (Q3920345) (← links)
- (Q3946848) (← links)
- On the relationship between the distribution of maximal queue length in the <i>M/G/</i>1 queue and the mean busy period in the <i>M/G</i>/1/<i>n</i> queue (Q4107302) (← links)
- (Q4771978) (← links)
- Setups in polling models: does it make sense to set up if no work is waiting? (Q4935347) (← links)
- Queues with Service in Random Order (Q5180182) (← links)
- On the convergence of jacobi and gauss-seidel iteration for steady-state probabilities of finite-state continuous-time markov chains (Q5203653) (← links)
- Transform-Free Analysis of M/G/1/K and Related Queues (Q5287993) (← links)
- Queues Served in Cyclic Order: Waiting Times (Q5610201) (← links)
- Note—Derivation from Queueing Theory of an Identity Related to Abel's Generalization of the Binomial Theorem, which is Useful in Graph Theory (Q5660998) (← links)
- A Decomposition Theorem for Polling Models: The Switchover Times are Effectively Additive (Q5689785) (← links)