DOIAbstract
Waiting time problems, discrete distributions of order k , Markov chain, Markov chain imbedding method, probability generating function,
Waiting time problems, discrete distributions of order k , Markov chain, Markov chain imbedding method, probability generating function,
We consider a class of two-queue polling systems with exhaustive service, where the order in which t...
In this note we present algorithms that compute, exactly or approximately, time-dependent waiting ti...
The exact distribution of the number of occurrences of subpattern of a specified length or larger un...
Sequence patterns, runs, sooner and later problems, r-th occurrence problem, discrete distribution o...
Analysis of AlgorithmsIn this paper we consider the distribution of a pattern of interest in a binar...
We study waiting time problems for first-order Markov dependent trials via conditional probability g...
Abstract. Methods using gambling teams and martingales are developed and applied to find formulas fo...
In this article, we investigate the waiting time distributions for the rth (r[greater-or-equal, slan...
In this note we present algorithms that compute, exactly or approximately, time dependent waiting ti...
In this paper the concept of later waiting time distributions for patterns in multi-state trials is ...
Methods using gambling teams and martingales are developed and applied to find formulas for the expe...
A discrete time queueing model with Markovian arrival process in which jobs require primary and poss...
Analysis of AlgorithmsA binary sequence of zeros and ones is called a (d; k)-sequence if it does not...
[[abstract]]In this thesis we mainly aim to compute the expected waiting time of a certain pattern i...
A binary sequence of zeros and ones is called a (d,k)-sequence if it does not contain runs of zer...
We consider a class of two-queue polling systems with exhaustive service, where the order in which t...
In this note we present algorithms that compute, exactly or approximately, time-dependent waiting ti...
The exact distribution of the number of occurrences of subpattern of a specified length or larger un...
Sequence patterns, runs, sooner and later problems, r-th occurrence problem, discrete distribution o...
Analysis of AlgorithmsIn this paper we consider the distribution of a pattern of interest in a binar...
We study waiting time problems for first-order Markov dependent trials via conditional probability g...
Abstract. Methods using gambling teams and martingales are developed and applied to find formulas fo...
In this article, we investigate the waiting time distributions for the rth (r[greater-or-equal, slan...
In this note we present algorithms that compute, exactly or approximately, time dependent waiting ti...
In this paper the concept of later waiting time distributions for patterns in multi-state trials is ...
Methods using gambling teams and martingales are developed and applied to find formulas for the expe...
A discrete time queueing model with Markovian arrival process in which jobs require primary and poss...
Analysis of AlgorithmsA binary sequence of zeros and ones is called a (d; k)-sequence if it does not...
[[abstract]]In this thesis we mainly aim to compute the expected waiting time of a certain pattern i...
A binary sequence of zeros and ones is called a (d,k)-sequence if it does not contain runs of zer...
We consider a class of two-queue polling systems with exhaustive service, where the order in which t...
In this note we present algorithms that compute, exactly or approximately, time-dependent waiting ti...
The exact distribution of the number of occurrences of subpattern of a specified length or larger un...
Add to ORKG