Showing 1 - 20 results of 20 for search '"Computer Science"', query time: 0.06s Refine Results
  1. 1
    Continued fraction expansions for q-tangent and q-cotangent functions

    Continued fraction expansions for q-tangent and q-cotangent functions by Helmut Prodinger

    Published 2010-01-01
    “…Discrete Mathematics & Theoretical Computer Science…”
    Get full text
    Article
  2. 2
    How often do we reject a superior value? (Extended abstract)

    How often do we reject a superior value? (Extended abstract) by Kamilla Oliver, Helmut Prodinger

    Published 2011-01-01
    “…Discrete Mathematics & Theoretical Computer Science…”
    Get full text
    Article
  3. 3
    q-Enumeration of words by their total variation

    q-Enumeration of words by their total variation by Ligia Loreta Cristea, Helmut Prodinger

    Published 2011-01-01
    “…Discrete Mathematics & Theoretical Computer Science…”
    Get full text
    Article
  4. 4
    The register function for lattice paths

    The register function for lattice paths by Guy Louchard, Helmut Prodinger

    Published 2008-01-01
    “…Discrete Mathematics & Theoretical Computer Science…”
    Get full text
    Article
  5. 5
    Growing and Destroying Catalan-Stanley Trees

    Growing and Destroying Catalan-Stanley Trees by Benjamin Hackl, Helmut Prodinger

    Published 2018-02-01
    “…Discrete Mathematics & Theoretical Computer Science…”
    Get full text
    Article
  6. 6
    Minimal and maximal plateau lengths in Motzkin paths

    Minimal and maximal plateau lengths in Motzkin paths by Helmut Prodinger, Stephan Wagner

    Published 2007-01-01
    “…Discrete Mathematics & Theoretical Computer Science…”
    Get full text
    Article
  7. 7
    The asymmetric leader election algorithm with Swedish stopping: a probabilistic analysis

    The asymmetric leader election algorithm with Swedish stopping: a probabilistic analysis by Guy Louchard, Helmut Prodinger

    Published 2012-09-01
    “…Discrete Mathematics & Theoretical Computer Science…”
    Get full text
    Article
  8. 8
    Analysis of a new skip list variant

    Analysis of a new skip list variant by Guy Louchard, Helmut Prodinger

    Published 2006-01-01
    “…Discrete Mathematics & Theoretical Computer Science…”
    Get full text
    Article
  9. 9
    Analysis of some statistics for increasing tree families

    Analysis of some statistics for increasing tree families by Alois Panholzer, Helmut Prodinger

    Published 2004-01-01
    “…Discrete Mathematics & Theoretical Computer Science…”
    Get full text
    Article
  10. 10
    A combinatorial and probabilistic study of initial and end heights of descents in samples of geometrically distributed random variables and in permutations

    A combinatorial and probabilistic study of initial and end heights of descents in samples of geometrically distributed random variables and in permutations by Guy Louchard, Helmut Prodinger

    Published 2007-01-01
    “…Discrete Mathematics & Theoretical Computer Science…”
    Get full text
    Article
  11. 11
    Approximate Counting via the Poisson-Laplace-Mellin Method

    Approximate Counting via the Poisson-Laplace-Mellin Method by Michael Fuchs, Chung-Kuei Lee, Helmut Prodinger

    Published 2012-01-01
    “…Discrete Mathematics & Theoretical Computer Science…”
    Get full text
    Article
  12. 12
    Bootstrapping and double-exponential limit laws

    Bootstrapping and double-exponential limit laws by Helmut Prodinger, Stephan Wagner

    Published 2015-03-01
    “…Discrete Mathematics & Theoretical Computer Science…”
    Get full text
    Article
  13. 13
    The number of distinct values of some multiplicity in sequences of geometrically distributed random variables

    The number of distinct values of some multiplicity in sequences of geometrically distributed random variables by Guy Louchard, Helmut Prodinger, Mark Daniel Ward

    Published 2005-01-01
    “…Discrete Mathematics & Theoretical Computer Science…”
    Get full text
    Article
  14. 14
    The height of q-Binary Search Trees

    The height of q-Binary Search Trees by Michael Drmota, Helmut Prodinger

    Published 2002-01-01
    “…Discrete Mathematics & Theoretical Computer Science…”
    Get full text
    Article
  15. 15
    Asymptotic results for silent elimination

    Asymptotic results for silent elimination by Guy Louchard, Helmut Prodinger

    Published 2010-01-01
    “…Discrete Mathematics & Theoretical Computer Science…”
    Get full text
    Article
  16. 16
    Descendants and ascendants in binary trees

    Descendants and ascendants in binary trees by Alois Panholzer, Helmut Prodinger

    Published 1997-01-01
    “…Discrete Mathematics & Theoretical Computer Science…”
    Get full text
    Article
  17. 17
    Probabilistic Analysis of Carlitz Compositions

    Probabilistic Analysis of Carlitz Compositions by Guy Louchard, Helmut Prodinger

    Published 2002-01-01
    “…Discrete Mathematics & Theoretical Computer Science…”
    Get full text
    Article
  18. 18
    Fountains, histograms, and q-identities

    Fountains, histograms, and q-identities by Peter Paule, Helmut Prodinger

    Published 2003-01-01
    “…Discrete Mathematics & Theoretical Computer Science…”
    Get full text
    Article
  19. 19
    Digital search trees with m trees: Level polynomials and insertion costs

    Digital search trees with m trees: Level polynomials and insertion costs by Helmut Prodinger

    Published 2011-08-01
    “…Discrete Mathematics & Theoretical Computer Science…”
    Get full text
    Article
  20. 20
    The location of the first maximum in the first sojourn of a Dyck path

    The location of the first maximum in the first sojourn of a Dyck path by Helmut Prodinger

    Published 2008-01-01
    “…Discrete Mathematics & Theoretical Computer Science…”
    Get full text
    Article

Search Tools: