| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6049077 | 2023-10-16 | Paper |
| A Second Course in Probability | 2023-05-30 | Paper |
| Increasing Gambler's Ruin duration and Brownian Motion exit times | 2023-01-19 | Paper |
| DUELING BANDIT PROBLEMS | 2022-11-22 | Paper |
| BLOCKCHAIN DOUBLE-SPEND ATTACK DURATION | 2022-11-18 | Paper |
| Concentration inequalities from monotone couplings for graphs, walks, trees and branching processes | 2022-08-29 | Paper |
| Fair gambler’s ruin stochastically maximizes playing time | 2022-06-28 | Paper |
| Arcsine laws for random walks generated from random permutations with applications to genomics | 2021-12-01 | Paper |
| Exponential and Laplace approximation for occupation statistics of branching random walk | 2020-05-29 | Paper |
| Is reliability a new science? A paper from the panel session held at the 10th International Conference on Mathematical Methods in Reliability | 2020-02-06 | Paper |
| Joint degree distributions of preferential attachment random graphs | 2019-09-16 | Paper |
| Stein's method and approximating the quantum harmonic oscillator | 2019-01-28 | Paper |
| Pólya urns with immigration at random times | 2019-01-28 | Paper |
| Generalized gamma approximation with rates for urns, walks and trees | 2016-07-14 | Paper |
| Stein's method, many interacting worlds and quantum mechanics | 2016-06-21 | Paper |
| Total variation error bounds for geometric approximation | 2013-05-30 | Paper |
| Degree asymptotics with rates for preferential attachment random graphs | 2013-05-10 | Paper |
| Exponential approximation for the nearly critical Galton-Watson process and occupation times of Markov chains | 2012-06-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3094155 | 2011-10-21 | Paper |
| SOME RESULTS FOR SKIP-FREE RANDOM WALK | 2011-08-17 | Paper |
| New rates for exponential approximation and the theorems of Rényi and Yaglom | 2011-04-15 | Paper |
| A Three-Parameter Binomial Approximation | 2010-02-02 | Paper |
| A Random Permutation Model Arising in Chemistry | 2009-01-21 | Paper |
| How Nearly do Arriving Customers See Time-Average Behavior? | 2009-01-21 | Paper |
| Relating Time and Customer Averages for Queues Using ‘forward’ Coupling from the Past | 2008-08-05 | Paper |
| COUPON COLLECTING | 2008-05-22 | Paper |
| A monotonicity result for a G/GI/c queue with balking or reneging | 2008-02-15 | Paper |
| HEAVY TRAFFIC LIMITS VIA BROWNIAN EMBEDDINGS | 2007-02-13 | Paper |
| A Compound Poisson Approximation Inequality | 2006-09-25 | Paper |
| Estimating the Mean Cover Time of a Semi-Markov Process via Simulation | 2006-09-22 | Paper |
| Policies without Memory for the Infinite-Armed Bernoulli Bandit under the Average-Reward Criterion | 2006-08-30 | Paper |
| COMPOUND RANDOM VARIABLES | 2005-05-09 | Paper |
| Characterizing losses during busy periods in finite buffer systems | 2003-11-20 | Paper |
| Poisson traffic flow in a general feedback queue | 2003-09-23 | Paper |
| Some memoryless bandit policies | 2003-06-29 | Paper |
| Optimal policies for multi-server non-preemptive priority queues | 2002-12-15 | Paper |
| MORE ON USING FORCED IDLE TIME TO IMPROVE PERFORMANCE IN POLLING MODELS | 2001-10-04 | Paper |
| ON THE NUMBER OF REFUSALS IN A BUSY PERIOD | 2001-08-30 | Paper |
| Inequalities for queues with a learning server | 2001-07-19 | Paper |
| A note on reliability bounds via conditional inequalities | 2000-05-18 | Paper |
| Ignatov's theorem and correlated record values | 2000-04-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4945025 | 2000-03-22 | Paper |
| Stein's method for geometric approximation | 1996-11-19 | Paper |
| A simple derivation of exact reliability formulas for linear and circular consecutive-k-of-n: F systems | 1995-08-16 | Paper |
