Biblio Discovery — Demo Discovery Service

41 results for "Helmut Prodinger"

Showing 1–20 · 1.84 seconds · RSS

  1. Journal Article

    The location of the first maximum in the first sojourn of a Dyck path

    Helmut Prodinger

    Discrete Mathematics & Theoretical Computer Science, Vol. 10 No. 3 · 2008 · English · DOAJ Scopus

    For Dyck paths (nonnegative symmetric) random walks, the location of the first maximum within the first sojourn is studied. Generating functions and explicit resp. asymptotic expressions for the average are derived. Related parameters are also discussed.

    Also available at: DOAJ

  2. Journal Article Full text

    Dispersed Dyck paths revisited

    Helmut Prodinger

    Contributions to Mathematics, Vol. 9 · 2024 · English · DOAJ

  3. Journal Article

    Digital search trees with m trees: Level polynomials and insertion costs

    Helmut Prodinger

    Discrete Mathematics & Theoretical Computer Science, Vol. Vol. 13 no. 3 No. Analysis of Algorithms · 2011 · English · DOAJ Scopus

    Analysis of Algorithms

  4. Journal Article Full text

    MIN-turns and MAX-turns in k-Dyck paths: A pure generating function approach

    Helmut Prodinger

    Notes on Number Theory and Discrete Mathematics, Vol. 30 No. 2 · 2024 · English · DOAJ

    k-Dyck paths differ from ordinary Dyck paths by using an up-step of length k. We analyze at which level the path is after the s-th up-step and before the (s+1)-st up-step. In honour of Rainer Kemp who studied a related concept 40 years ago the terms MAX-terms and MIN-terms are used. Results are…

  5. Journal Article

    d-records in geometrically distributed random variables

    Helmut Prodinger

    Discrete Mathematics & Theoretical Computer Science, Vol. 8 No. 1 · 2006 · English · DOAJ Scopus

    We study d–records in sequences generated by independent geometric random variables and derive explicit and asymptotic formulæ for expectation and variance. Informally speaking, a d–record occurs, when one computes the d–largest values, and the variable maintaining it changes its value while the…

  6. Journal Article Full text

    Skew Dyck paths with catastrophes

    Helmut Prodinger

    Discrete Mathematics Letters, Vol. 10 · 2022 · English · DOAJ Scopus

  7. Journal Article

    Ordered trees with distinguished children

    Helmut Prodinger

    The American Journal of Combinatorics, Vol. 5 · 2026 · English · DOAJ

    A new tree model is introduced based on ordered trees, by distinguishing exactly one child of each node that has children. The basic enumeration leads to a cubic equation of the generating function. The extraction of its coefficients can be done using the Lagrange inversion formula. Various…

  8. Journal Article

    Combinatorics of geometrically distributed random variables: new q-tangent and q-secant numbers

    Helmut Prodinger

    International Journal of Mathematics and Mathematical Sciences, Vol. 24 No. 12 · 2000 · English · DOAJ Scopus

    Up-down permutations are counted by tangent (respectively, secant) numbers. Considering words instead, where the letters are produced by independent geometric distributions, there are several ways of introducing this concept; in the limit they all coincide with the classical version. In this way…

  9. Journal Article Full text

    S-Motzkin paths with catastrophes and air pockets

    Helmut Prodinger

    Discrete Mathematics Letters, Vol. 12 · 2023 · English · DOAJ Scopus

  10. Journal Article

    Continued fraction expansions for q-tangent and q-cotangent functions

    Helmut Prodinger

    Discrete Mathematics & Theoretical Computer Science, Vol. Vol. 12 no. 2 · 2010 · English · DOAJ Scopus

    For 3 different versions of q-tangent resp. q-cotangent functions, we compute the continued fraction expansion explicitly, by guessing the relative quantities and proving the recursive relation afterwards. It is likely that these are the only instances with a ''nice'' expansion. Additional formulae…

  11. Journal Article

    A combinatorial and probabilistic study of initial and end heights of descents in samples of geometrically distributed random variables and in permutations

    Helmut Prodinger; Guy Louchard

    Discrete Mathematics & Theoretical Computer Science, Vol. 9 No. 1 · 2007 · English · DOAJ Scopus

    In words, generated by independent geometrically distributed random variables, we study the l th descent, which is, roughly speaking, the l th occurrence of a neighbouring pair ab with a>b. The value a is called the initial height, and b the end height. We study these two random variables (and some…

  12. Journal Article

    The first descent in samples of geometric random variables and permutations

    Arnold Knopfmacher; Helmut Prodinger

    Discrete Mathematics & Theoretical Computer Science, Vol. 8 No. 1 · 2006 · English · DOAJ Scopus

    For words of length n, generated by independent geometric random variables, we study the average initial and end heights of the first descent in the word. Higher moments and limiting distributions are also derived. In addition we compute the average initial and end height of the first descent for a…

  13. Journal Article

    How often do we reject a superior value? (Extended abstract)

    Kamilla Oliver; Helmut Prodinger

    Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AO… · 2011 · English · DOAJ Scopus

    Words $a_1 a_2 \ldots a_n$ with independent letters $a_k$ taken from the set of natural numbers, and a weight (probability) attached via the geometric distribution $pq^{i-1}(p+q=1)$ are considered. A consecutive record (motivated by the analysis of a skip list structure) can only advance from $k$…

  14. Journal Article

    Analysis of some statistics for increasing tree families

    Alois Panholzer; Helmut Prodinger

    Discrete Mathematics & Theoretical Computer Science, Vol. Vol. 6 no. 2 · 2004 · English · DOAJ Scopus

    This paper deals with statistics concerning distances between randomly chosen nodes in varieties of increasing trees. Increasing trees are labelled rooted trees where labels along any branch from the root go in increasing order. Many mportant tree families that have applications in computer science…

  15. Journal Article

    The height of q-Binary Search Trees

    Michael Drmota; Helmut Prodinger

    Discrete Mathematics & Theoretical Computer Science, Vol. Vol. 5 · 2002 · English · DOAJ Scopus

    q-binary search trees are obtained from words, equipped with a geometric distribution instead of permutations. The average and variance of the heighth computated, based on random words of length n, as well as a Gaussian limit law.