The following pages link to Frosso S. Makri (Q297138):
Displaying 37 items.
- On the length and the position of the minimum sequence containing all runs of ones in a Markovian binary sequence (Q297140) (← links)
- On runs of ones defined on a \(q\)-sequence of binary trials (Q300523) (← links)
- Corrigendum to ``On success runs of a fixed length in Bernoulli sequences: exact and asymptotic results'' (Q520838) (← links)
- On success runs of length exceeded a threshold (Q539513) (← links)
- On success runs of a fixed length in Bernoulli sequences: exact and asymptotic results (Q552212) (← links)
- Minimum and maximum distances between failures in binary sequences (Q631539) (← links)
- On runs of length exceeding a threshold: normal approximation (Q641775) (← links)
- Counting certain binary strings (Q665047) (← links)
- On binomial and circular binomial distributions of order \(k\) for \(l\)-overlapping success runs of length \(k\) (Q816557) (← links)
- Joint distribution of \(k\)-tuple statistics in zero-one sequences of Markov-dependent trials (Q1690091) (← links)
- Weak runs in sequences of binary trials (Q2142462) (← links)
- Binomial distribution of order \(k\) in a modified binary sequence (Q2156009) (← links)
- Generalizations of runs and patterns distributions for sequences of binary trials (Q2241503) (← links)
- The reliability of a generalized consecutive system (Q2279417) (← links)
- Length of the minimum sequence containing repeats of success runs (Q2339519) (← links)
- Exact distributions of constrained \((k, \ell )\) strings of failures between subsequent successes (Q2392698) (← links)
- Shortest and longest length of success runs in binary sequences (Q2455709) (← links)
- Polya, Inverse Polya, and Circular Polya Distributions of Order<i>k</i>for<i>l</i>-Overlapping Success Runs (Q3436010) (← links)
- On ℓ-overlapping Runs of Ones of Length<i>k</i>in Sequences of Independent Binary Random Variables (Q3458128) (← links)
- (Q3488947) (← links)
- On Occurrences of <i>F</i>-<i>S</i> Strings in Linearly and Circularly Ordered Binary Sequences (Q3550995) (← links)
- (Q3696109) (← links)
- Closed Formulas for the Failure Probability of a Strict-Consecutive-k-out-of-n:F System (Q3800846) (← links)
- (Q4427768) (← links)
- Distributions of statistics describing concentration of runs in non homogeneous Markov-dependent trials (Q4563538) (← links)
- An Input Vector Monitoring Concurrent BIST Architecture Based on a Precomputed Test Set (Q4564054) (← links)
- Algorithm 987 (Q4611304) (← links)
- Locating and Computing Arbitrarily Distributed Zeros (Q4702420) (← links)
- (Q4850675) (← links)
- On the concentration of runs of ones of length exceeding a threshold in a Markov chain (Q5036487) (← links)
- Success run statistics defined on an urn model (Q5443148) (← links)
- Efficiently Computing Many Roots of a Function (Q5693188) (← links)
- (Q5852781) (← links)
- Successes, runs and longest runs (Q5903000) (← links)
- Successes, runs and longest runs (Q5903147) (← links)
- Distributions related to weak runs with a minimum and a maximum number of successes: a unified approach (Q6164855) (← links)
- Distribution of patterns of constrained length in binary sequences (Q6204666) (← links)
