A Simple and Efficient Algorithm to Compute Tail Probabilities from Transforms
From MaRDI portal
Publication:3802575
DOI10.1287/opre.36.1.137zbMath0655.65150MaRDI QIDQ3802575
John J. III Bartholdi, Jane C. Ammons, L. K. Platzman
Publication date: 1988
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.36.1.137
68W99: Algorithms in computer science
65C99: Probabilistic methods, stochastic differential equations
Related Items
Queue length distributions from probability generating functions via discrete Fourier transforms, Exact and approximate numerical solutions to steady-state single-server queues: \(M/G/1\) -- a unified approach, Transient and busy period analysis of the GI/G/1 queue: The method of stages, The Fourier-series method for inverting transforms of probability distributions, Stochastic models of space priority mechanisms with Markovian arrival processes, Performance analysis of an ISDN switch with distributed architecture: Circuit switched calls, A comparison of three random disciplines