scientific article; zbMATH DE number 3613959
From MaRDI portal
Publication:4178286
zbMATH Open0395.60082MaRDI QIDQ4178286FDOQ4178286
Authors: Dietrich Stoyan 
Publication date: 1977
Title of this publication is not available (Why is that?)
Queueing theory (aspects of probability theory) (60K25) Research exposition (monographs, survey articles) pertaining to probability theory (60-02) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)
Cited In (21)
- Processor sharing: a survey of the mathematical theory
- Solution of a statistical optimization problem by rearrangement methods
- On the Statistical Inference from Survival Experiments with Two Types of Failure
- Inequalities for Stationary Poisson Cuboid Processes
- The cycle-time distribution in a central server network with state-dependent branching
- On Some Qualitative Properties of the Boolean Model of Stochastic Geometry
- Some examples of non-monotonicities in a two-unit redundant system
- Konvergenzvergleiche bei Lösungen linearer Differenzengleichungen mit konstanten Koeffizienten
- Stop-loss ordering for scale and power mixtures of distributions
- Stability of infinite systems of stochastic equations
- Descriptive Parameters of Location, Dispersion and Stochastic Dependence
- Bemerkungen zu der Arbeit Approximation von Leistungsgrößen symmetrischer Mehrprozessorsysteme von G. Bolch
- Bemerkungen zu der Arbeit Approximation von Leistungsgrößen symmetrischer Mehrprozessorsysteme von G. Bolch
- A Possible Approach to Comparison of Survival Functions
- Title not available (Why is that?)
- Approximations and bounds for a generalized optimal stopping problem
- A Note on Bounds for the Moments of a Stochastic Project Planniag Model Duration
- Approximating the stationary waiting time distribution function of GI/GI/1-queues with arithmetic interarrival time and service time distribution function
- An upper bound on the expected completion time of PERT networks
- Waiting time in a preemptive resume system with compound-Poisson input
- Stationary queuing systems with dependencies
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4178286)
