16 citations · 33 across the 5 of their papers we have counts for
5 papers
Consecutive k-out-of-n:F Systems Have Unbounded Roots
Marilena Jianu, Leonard Daus, Vlad-Florin Dragoi +1
This article is studying the roots of the reliability polynomials of linear consecutive-\textit{k}-out-of-\textit{n}:\textit{F} systems. We are able to prove that these roots are u…
Tight Bounds on the Coeffcients of Consecutive -out-of-: Systems
Vlad-Florin Drăgoi, Simon R. Cowell, Valeriu Beiu
In this paper we compute the coefficients of the reliability polynomial of a consecutive--out-of-: system, in Bernstein basis, using the generalized Pascal coefficients. B…
Fast Reliability Ranking of Matchstick Minimal Networks
Vlad-Florin Dragoi, Valeriu Beiu
In this article, we take a closer look at the reliability of large minimal networks constructed by repeated compositions of the simplest possible networks. For a given number of de…
Survey of Cubic Fibonacci Identities - When Cuboids Carry Weight
Mariana Nagy, Simon R. Cowell, Valeriu Beiu
The aim of this paper is to present a comprehensive survey of cubic Fibonacci identities, trying to uncover as many as possible. From the outset, our rationale for a very careful s…
Brick-wall lattice paths and applications
Leonard Daus, Valeriu Beiu, Simon Cowell +1
We introduce a new type of lattice path, called brick-wall lattice path, and we derive a formula which counts the number of paths on these lattices imposing certain restrictions on…