The following pages link to Marcel F. Neuts (Q189467):
Displaying 38 items.
- (Q228538) (redirect page) (← links)
- Matrix-analytic methods in queueing theory (Q593969) (← links)
- Descriptors for point processes based on runs: the Markovian arrival process (Q675259) (← links)
- A limit theorem for orthogonal functions (Q775719) (← links)
- Numerical investigation of a multiserver retrial model (Q923526) (← links)
- Statistical group testing with queueing involved (Q1106565) (← links)
- A duality theorem for phase type queues (Q1147442) (← links)
- On the use of phase type distributions in reliability modelling of systems with two components (Q1153618) (← links)
- Algorithmic methods for multi-server queues with group arrivals and exponential services (Q1157844) (← links)
- An illustrative problem in computational probability (Q1159560) (← links)
- On the design of a finite-capacity queue with phase-type service times and hysteretic control (Q1196020) (← links)
- Computational uses of the method of phases in the theory of queues (Q1231233) (← links)
- An annoted bibliography on computational probability. I (Q1235925) (← links)
- The M/M/1 queue with randomly varying arrival and service rates (Q1259103) (← links)
- Further results on the M/M/1 queue with randomly varying rates (Q1259104) (← links)
- Two service units with interference in the access to servers (Q1566516) (← links)
- Markov chains with marked transitions (Q1805742) (← links)
- Point processes competing for runs: A new tool for their investigation (Q1807740) (← links)
- Two \(M\)/\(M\)/1 queues with transfers of customers (Q1871982) (← links)
- On mixtures of \(\chi^ 2\)-and \(F\)-distributions which yield distributions of the same family (Q2527597) (← links)
- Controlling a lethal growth process (Q2528570) (← links)
- The queue with Poisson input and general service times, treated as a branching process (Q2535634) (← links)
- Convexity of the bounds induced by Markov's inequality (Q2559863) (← links)
- Pair formation in a Markovian arrival process with two event labels (Q4660536) (← links)
- The single server queue in discrete time‐numerical analysis IV (Q4766384) (← links)
- The Distribution of the Maximum Length of a Poisson Queue During a Busy Period (Q5334661) (← links)
- The Busy Period of a Queue with Batch Service (Q5342798) (← links)
- An Alternative Proof of a Theorem of Takács on the <i>GI</i>/<i>M</i>/1 Queue (Q5514903) (← links)
- A General Class of Bulk Queues with Poisson Input (Q5539492) (← links)
- A Priority Rule Based on the Ranking of the Service Times for the <i>M</i>/<i>G</i>/1 Queue (Q5562410) (← links)
- An Exact Comparison of the Waiting Times Under Three Priority Rules (Q5626047) (← links)
- The single server queue in discrete time‐numerical analysis I (Q5683535) (← links)
- The single server queue in discrete time‐numerical analysis II (Q5683536) (← links)
- The Infinite-Server Queue with Poisson Arrivals and Semi-Markovian Services (Q5684075) (← links)
- The single server queue in discrete time‐numerical analysis III (Q5686762) (← links)
- Modelling Vehicular Traffic Using the Discrete Time Markovian Arrival Process (Q5689140) (← links)
- A Discrete-Time Model for Common Lifetime Inventory Systems (Q5704246) (← links)
- Generating Functions for Markov Renewal Processes (Q5736565) (← links)
