| Publication | Date of Publication | Type |
|---|
| Kelly and Jackson networks with interchangeable, cooperative servers | 2022-01-18 | Paper |
| Efficient simulation of queues in heavy traffic | 2018-06-12 | Paper |
| Little's law when the average waiting time is infinite | 2014-11-14 | Paper |
| Understanding the marginal impact of customer flexibility | 2013-11-25 | Paper |
| Partial flexibility in routeing and scheduling | 2013-10-23 | Paper |
| Multiple-server system with flexible arrivals | 2012-01-17 | Paper |
| Grid scheduling with NBU service times | 2010-12-23 | Paper |
| Job replication on multiserver systems | 2009-07-22 | Paper |
| Loss probability properties in retrial queues | 2009-02-23 | Paper |
| On the convexity of loss probabilities when arrivals occur in batches and servers are heterogeneous | 2007-10-30 | Paper |
| On the time spent below a random threshold by a system driven by a general counting process | 2006-11-16 | Paper |
| Two Extremal Autocorrelated Arrival Processes | 2006-09-22 | Paper |
| Work-conserving tandem queues | 2005-11-07 | Paper |
| On Finite Moments of Full Busy Periods of GI/G/c Queues | 2005-08-25 | Paper |
| NEW ESTIMATORS FOR EFFICIENT GI/G/1 SIMULATION | 2005-06-21 | Paper |
| Idle period approximations and bounds for the GI/G/1 queue | 2004-06-10 | Paper |
| PICKING CLUMPY ORDERS ON A CAROUSEL | 2004-03-29 | Paper |
| On the convexity of loss probabilities | 2002-11-06 | Paper |
| BLOCK RENEWAL PROCESSES AND THEIR APPLICATION TO MODELING | 2002-07-11 | Paper |
| Losses per cycle in a single-server queue | 2002-01-01 | Paper |
| The \(M/G/c\) queue in light traffic | 1999-01-17 | Paper |
| Symmetric queues with batch departures and their networks | 1996-09-02 | Paper |
| A note on the existence of regeneration times | 1995-07-16 | Paper |
| Bounds for Different Arrangements of Tandem Queues with Nonoverlapping Service Times | 1994-04-10 | Paper |
| A Review of Regenerative Processes | 1993-11-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3998392 | 1992-09-17 | Paper |
| On Finite Delay-Moment Conditions in Queues | 1992-06-28 | Paper |
| The equality of the virtual delay and attained waiting time distributions | 1990-01-01 | Paper |
| Further results on ASTA for general stationary processes and related problems | 1990-01-01 | Paper |
| A Note on PASTA and Anti-PASTA for Continuous-Time Markov Chains | 1990-01-01 | Paper |
| A new proof of finite moment conditions for GI/G/1 busy periods | 1989-01-01 | Paper |
| Finiteness of moments of randomly stopped sums of i.i.d. random variables | 1989-01-01 | Paper |
| Optimal Order of Servers for Tandem Queues in Light Traffic | 1988-01-01 | Paper |
| Sample-path derivations of the excess, age, and spread distributions | 1988-01-01 | Paper |
| An upper bound on the performance of queues with returning customers | 1987-01-01 | Paper |
| Upper bounds on work in system for multichannel queues | 1987-01-01 | Paper |
| Conditions for Finite Ladder Height and Delay Moments | 1984-01-01 | Paper |
| Poisson Arrivals See Time Averages | 1982-01-01 | Paper |
| A Comparison Between Tandem Queues with Dependent and Independent Service Times | 1982-01-01 | Paper |
| Tandem Queues with Dependent Service Times in Light Traffic | 1982-01-01 | Paper |
| Note—On the Aggregation of Individual Probability Estimates | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3908748 | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3909802 | 1981-01-01 | Paper |
| The Almost Regenerative Method for Stochastic System Simulations | 1980-01-01 | Paper |
| Aggregation and Proration in Forecasting | 1979-01-01 | Paper |
| An upper bound for multi-channel queues | 1977-01-01 | Paper |
| An extension of Erlang's loss formula | 1976-01-01 | Paper |
| The Optimal Order of Service in Tandem Queues | 1974-01-01 | Paper |
| Customer average and time average queue lengths and waiting times | 1971-01-01 | Paper |
| Time Sharing with Priorities | 1970-01-01 | Paper |
| Work-conserving priorities | 1970-01-01 | Paper |
| Problems of Statistical Inference for Birth and Death Queuing Models | 1965-01-01 | Paper |
