Helmut Prodinger

Q: What Schools Are Affiliated With Helmut Prodinger

Helmut Prodinger is affiliated with the following schools: TU Wien, Stellenbosch University, University of the Witwatersrand, University of Vienna

Helmut Prodinger's AcademicInfluence.com Rankings

Helmut Prodinger

Mathematics

#7033

World Rank

#9639

Historical Rank

Combinatorics

#84

World Rank

#91

Historical Rank

Measure Theory

#1809

World Rank

#2213

Historical Rank

mathematics Degrees

Download Badge

Mathematics

Helmut Prodinger's Degrees

PhD Mathematics University of Vienna
Masters Mathematics University of Vienna
Bachelors Mathematics University of Vienna

Similar Degrees You Can Earn

Best Online Bachelor's in Math 2025

Why Is Helmut Prodinger Influential?

(Suggest an Edit or Addition)

(See a Problem?)

Helmut Prodinger's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

FIBONACCI NUMBERS OF GRAPHS: II (1983) (162)
Mellin Transforms and Asymptotics: Digital Sums (1994) (143)
On Ramanujan's Q-function (1995) (96)
Spanning tree formulas and chebyshev polynomials (1986) (83)
How to select a loser (1993) (80)
Combinatorics of geometrically distributed random variables: Left-to-right maxima (1996) (67)
Level of nodes in increasing trees revisited (2007) (64)
On the variance of the external path length in a symmetric digital trie (1989) (59)
Analysis of Hoare's FIND algorithm with Median-of-three partition (1997) (57)
Level number sequences for trees (1987) (57)
On Carlitz Compositions (1998) (54)
ON SOME APPLICATIONS OF FORMULAE OF RAMANUJAN IN THE ANALYSIS OF ALGORITHMS (1991) (49)
Digital Search Trees Again Revisited: The Internal Path Length Perspective (1994) (48)
Register Allocation for Unary-Binary Trees (1986) (48)
Multiple Quickselect - Hoare's Find Algorithm for Several Elements (1995) (44)
A correspondence between ordered trees and noncrossing partitions (1983) (43)
The path length of random skip lists (1994) (42)
The Sum‐of‐Digits Function for Complex Bases (1998) (41)
Distribution results for low-weight binary representations for pairs of integers (2004) (40)
Asymptotics of the Moments of Extreme-Value Related Distribution Functions (2006) (39)
On the Balance Property of Patricia Tries: External Path Length Viewpoint (1989) (39)
A result in order statistics related to probabilistic counting (1993) (39)
Some Further Results on Digital Search Trees (1986) (39)
Minimality of the Hamming Weight of the \tau-NAF for Koblitz Curves and Improved Combination with Point Halving (2005) (38)
On monotone functions of tree structures (1983) (38)
Addendum: "The number of winners in a discrete geometrically distributed sample" (1996) (38)
Comparisons in Hoare's Find Algorithm (1998) (36)
Analysis of Alternative Digit Sets for Nonadjacent Representations (2006) (36)
Analysis of a splitting process arising in probabilistic counting and other related algorithms (1996) (33)
On the Moments of the Sum-of-Digits Function (1993) (32)
Padé approximations to the logarithm III: Alternative methods and additional results (2006) (32)
Bijections for ternary trees and non-crossing trees (2002) (32)
Analysis of an Optimized Search Algorithm for Skip Lists (1995) (31)
Combinatorics of geometrically distributed random variables: new q-tangent and q-secant numbers (1999) (30)
The Number of Inversions in Permutations: A Saddle Point Approach (2003) (30)
A generating functions approach for the analysis of grand averages for multiple QUICKSELECT (1998) (29)
Maximum Statistics of N Random Variables Distributed by the Negative Binomial Distribution (1997) (28)
ON A SUM OF MELHAM AND ITS VARIANTS (2008) (28)
Scalar Multiplication on Koblitz Curves Using the Frobenius Endomorphism and Its Combination with Point Halving: Extensions and Mathematical Analysis (2006) (27)
Analysis of linear combination algorithms in cryptography (2005) (27)
Further Results on Digital Search Trees (1988) (26)
Multidimensional Digital Searching and Some New Parameters in Tries (1993) (26)
Spanning tree size in random binary search trees (2004) (26)
Padé approximations to the logarithm II: Identities, recurrences, and symbolic computation (2006) (26)
Asymptotic analysis of the moments of the Cantor distribution (1996) (26)
On Minimal Expansions in Redundant Number Systems: Algorithms and Quantitative Analysis (2001) (25)
Partial match queries in relaxed multidimensional search trees (2001) (25)
A Generalized Filbert Matrix (2010) (25)
Infinite 0-1-sequences without long adjacent identical blocks (1979) (25)
Combinatorics of geometrically distributed random variables: Value and position of the rth left-to-right maximum (1998) (25)
Notes on protected nodes in digital search trees (2012) (24)
On the analysis of probabilistic counting (1990) (24)
Approximate counting: an alternative approach (1991) (23)
The number of distinct values of some multiplicity in sequences of geometrically distributed random variables (2005) (23)
The Asymmetric Leader Election Algorithm: Another Approach (2009) (23)
Fibonacci Numbers of Graphs III: Planted Plane Trees (1986) (23)
Redundant τ-adic expansions I: non-adjacent digit sets and their applications to scalar multiplication (2011) (22)
Periodic Oscillations in the Analysis of Algorithms and Their Cancellations (2004) (22)
Some applications of the q‐Rice formula (2001) (22)
Human proofs of identities by Osburn and Schneider (2007) (22)
Probabilistic Analysis of Carlitz Compositions (2002) (21)
THE ALTERNATING GREEDY EXPANSION AND APPLICATIONS TO LEFT-TO-RIGHT ALGORITHMS IN CRYPTOGRAPHY (2004) (21)
Generating Random Derangements (2008) (21)
On Stirling Numbers for Complex Arguments and Hankel Contours (1999) (21)
A bijection between directed column-convex polyominoes and ordered trees of height at most three (2003) (21)
On gaps and unoccupied urns in sequences of geometrically distributed random variables (2008) (20)
Positional number systems with digits forming an arithmetic progression (2008) (20)
Carry propagation in signed digit representations (2003) (20)
Descendants in heap ordered trees or a triumph of computer algebra (1996) (19)
Formulas for Fibonomial sums with generalized Fibonacci and Lucas coefficients (2011) (19)
On the Number of Descendants and Ascendants in Random Search Trees (1998) (19)
The number of distinct values in a geometrically distributed sample (2006) (19)
Subblock Occurrences in Positional Number Systems and Gray code Representation (1984) (19)
Combinatorics of geometrically distributed random variables: run statistics (2003) (19)
ON BINARY REPRESENTATIONS OF INTEGERS WITH DIGITS-1 , 0 , 1 (2000) (18)
89.44 A curious identity proved by Cauchy’s integral formula* (2005) (18)
The Number of Huffman Codes, Compact Trees, and Sums of Unit Fractions (2011) (18)
Variants of the Filbert Matrix (2013) (17)
A continued fraction expansion for a q-tangent function: An elementary proof (2008) (17)
On Redundant τ -Adic Expansions and Non-adjacent Digit Sets (2006) (17)
On Redundant tau -Adic Expansions and Non-adjacent Digit Sets (2006) (16)
The q-Pilbert matrix (2012) (16)
On the Number of Combinations without a Fixed Distance (1983) (16)
Three Series for the Generalized Golden Mean (2014) (16)
Combinatorics of Geometrically Distributed Random Variables: Inversions and a Parameter of Knuth (1999) (16)
Counting optimal joint digit expansions. (2005) (16)
A multivariate view of random bucket digital search trees (2002) (16)
Sums of squares of Tetranacci numbers: A generating function approach. (2019) (15)
Unfair permutations (2011) (15)
Analysis of some statistics for increasing tree families (2004) (15)
Multidimensional Digital Searching-Alternative Data Structures (1994) (15)
A Simple Card Guessing Game Revisited (2000) (15)
The Hamming weight of the non-adjacent-form under various input statistics (2007) (14)
How to Count Quickly and Accurately: A Unified Analysis of Probabilistic Counting and Other Related Problems (1992) (14)
Depth and Path Length of Heap Ordered Trees (1996) (14)
Hypothetical Analyses: Approximate Counting in the Style of Knuth, Path Length in the Style of Flajolet (1992) (14)
Sorting algorithms for broadcast communications: mathematical analysis (2002) (14)
ANALYTIC METHODS (2014) (14)
The alternating greedy expansion and applications to computing digit expansions from left-to-right in cryptography (2005) (14)
The register function for t-ary trees (2006) (14)
The generalized q-Pilbert matrix (2014) (13)
Bottom-up mergesort — A detailed analysis (1995) (13)
Secant and cosecant sums and Bernoulli-Nörlund polynomials (2007) (13)
An analytic approach for the analysis of rotations in fringe-balanced binary search trees (1998) (13)
Sums of powers of Fibonacci polynomials (2009) (13)
Evaluation of sums involving Gaussian q-binomial coefficients with rational weight functions (2016) (13)
Compositions and Patricia Tries: No Fluctuations in the Variance! (2004) (13)
The height of multiple edge plane trees (2015) (13)
IDENTITIES INVOLVING HARMONIC NUMBERS THAT ARE OF INTEREST TO PHYSICISTS (2010) (13)
Representing derivatives of Chebyshev polynomials by Chebyshev polynomials and related questions (2016) (13)
q-identities of Fu and Lascoux proved by the q-rice formula (2004) (13)
Generalized approximate counting revisited (2008) (13)
Arithmetic of Supersingular Koblitz Curves in Characteristic Three (2010) (13)
On the Analysis of an Algorithm to Generate a Random Cyclic Permutation (2002) (13)
On α-greedy expansions of numbers (2007) (12)
Ascending runs of sequences of geometrically distributed random variables: a probabilistic analysis (2001) (12)
Explicit and asymptotic formulae for the expected values of the order statistics of the Cantor distribution (1996) (12)
ASYMMETRIC GENERALIZATIONS OF THE FILBERT MATRIX AND VARIANTS (2014) (12)
A CONTRIBUTION TO THE ANALYSIS OF IN SITU PERMUTATION (2003) (12)
On Some Parameters in Heap Ordered Trees (2004) (12)
The reciprocal super Catalan matrix (2015) (11)
On Two Subclasses of Motzkin Paths and Their Relation to Ternary Trees (2019) (11)
Number of survivors in the presence of a demon (2012) (11)
On a Constant Arising in the Analysis of Bit Comparisons in Quickselect (2008) (11)
Two selection problems revisited (1986) (11)
Asymptotics of the Luria-Delbrück distribution via singularity analysis (1996) (11)
A generating functions proof of a curious identity. (2002) (11)
A generalisation of a Filbert matrix with three additional parameters (2010) (11)
Digital search trees and basic hypergeometric functions (1995) (11)
Combinatorics of geometrically distributed random variables: value and position of large left-to-right maxima (2000) (11)
Moves and displacements of particular elements in Quicksort (2009) (11)
Records in geometrically distributed words: Sum of positions (2008) (11)
IDENTITIES INVOLVING RATIONAL SUMS BY INVERSION AND PARTIAL FRACTION DECOMPOSITION (2008) (10)
Bijections for a class of labeled plane trees (2010) (10)
Computer-free evaluation of an infinite double sum (2005) (10)
On the Height of Derivation Trees (1979) (10)
A q-analogue of a formula of Hernandez obtained by inverting a result of Dilcher (1999) (10)
Bijections for 2-plane trees and ternary trees (2009) (10)
Minimal and maximal plateau lengths in Motzkin paths (2007) (10)
Topologies on Free Monoids Induced by Closure Operators of a Special Type (1980) (10)
The Pills Problem Revisited (2003) (10)
Closed form evaluation of sums containing squares of Fibonomial coefficients (2016) (10)
A Note on Stirling Series (2010) (10)
Descendants and ascendants in binary trees (1997) (10)
On the Number of Partitions of { 1, …, n} into Two Sets of Equal Cardinalities and Equal Sums (1982) (9)
q-ENGEL SERIES EXPANSIONS AND SLATER'S IDENTITIES (2001) (9)
The number of elements close to near-records in geometric samples (2006) (9)
Language Operators Related to Init (1979) (9)
THE HEIGHT OF PLANTED PLANE TREES REVISITED (9)
The generalized Lilbert matrix (2016) (9)
Non-repetitive sequences and gray code (1983) (9)
On the Expansion of Fibonacci and Lucas Polynomials (2009) (9)
The Swedish Leader Election Protocol: Analysis and Variations (2011) (9)
On some continued fraction expansions of the Rogers–Ramanujan type (2011) (9)
Zur Auswertung Gewisser Numerischer Reihen Mit Hilfe Modularer Funktionen (1987) (9)
SUBBLOCK OCCURRENCES IN SIGNED DIGIT REPRESENTATIONS (2003) (9)
Output Sum of Transducers: Limiting Distribution and Periodic Fluctuation (2015) (9)
Binary search tree recursions with harmonic toll functions (2002) (9)
Approximate Counting via the Poisson-Laplace-Mellin Method (2012) (9)
Fountains, histograms, and q-identities (2003) (8)
Congruences Defined by Languages and Filters (1980) (8)
Return statistics of simple random walks (1996) (8)
Lattice Paths, Sampling Without Replacement, and Limiting Distributions (2009) (8)
On Touchard's continued fraction and extensions: combinatorics-free, self-contained proofs (2011) (8)
Analysis of Bidirectional Ballot Sequences and Random Walks Ending in Their Maximum (2015) (8)
Combinatorics of Geometrically Distributed Random Variables: Lenght of Ascending Runs (2000) (8)
Some analytic techniques for the investigation of the asymptotic behaviour of tree parameters (1992) (8)
Moments of level numbers of leaves in binary trees (2002) (8)
On binary representations of integers with digits . (2000) (8)
Staircase words and Chebyshev polynomials (2010) (8)
Bootstrapping and double-exponential limit laws (2015) (8)
Ordered Fibonacci Partitions (1983) (8)
On a Problem of Yekutieli and Mandelbrot about the Bifurcation Ratio of Binary Trees (1997) (8)
The height and width of bargraphs (2015) (8)
The Average Height of a Stack where Three Operations are Allowed and Some Related Problems (2003) (8)
Some Binomial Sums Involving Absolute Values (2014) (8)
Returns, Hills, and t-ary Trees (2016) (7)
Partial Skew Dyck Paths: A Kernel Method Approach (2021) (7)
An Identity Conjectured by Lacasse via the Tree Function (2013) (7)
Moments of distributions related to digital expansions (2006) (7)
On k-Dyck paths with a negative boundary (2019) (7)
On the Recursive Depth of Special Tree Traversal Algorithms (1987) (7)
A Short Proof of Carlitzâ€™s Bernoulli Number Identity (2014) (7)
Protection Number in Plane Trees (2017) (7)
Representations of numbers as ∑k=-nn εkk: A saddle point approach (2009) (6)
A Note on Binomial Recurrences Arising in the Analysis of Algorithms (1993) (6)
Ober Die Ziffernsumme Natorlicher Zahlen Und Verwandte Probleme (1985) (6)
An Asymptotic Study of a Recursion Occurring in the Analysis of an Algorithm on Broadcast Communication (1998) (6)
A generating function approach to random subgraphs of the n-cycle (1997) (6)
On protected nodes in Digital Search Trees (2011) (6)
Generalized Reciprocity Laws for Sums of Harmonic Numbers (2008) (6)
A simple bijection between a subclass of 2-binary trees and ternary trees (2009) (6)
Continued fraction expansions for q-tangent and q-cotangent functions (2010) (6)
On the shape of the fringe of various types of random trees (2009) (6)
q-Enumeration of up-down words by number of rises (2009) (6)
Approximate counting with m counters: A detailed analysis (2012) (6)
Words, Dyck Paths, Trees, and Bijections (2019) (6)
Towards a More Precise Analysis of an Algorithm to Generate Binary Trees: A Tutorial (1998) (6)
The Number of Descents in Samples of Geometric Random Variables (2004) (6)
Formulæ related to the $$q$$q-Dixon formula with applications to Fibonomial sums (2015) (6)
The visibility parameter for words and permutations (2013) (6)
The first descent in samples of geometric random variables and permutations (2006) (5)
PARTIAL FRACTION DECOMPOSITION PROOFS OF SOME q-SERIES IDENTITIES (2013) (5)
Joint Distributions for Movements of Elements in Sattolo's and the Fisher-Yates Algorithm (2008) (5)
External Internal Nodes in Digital Search Trees via Mellin Transforms (1992) (5)
Über Einige Funktionaldifferentialgleichungen Aus Der Analyse Von Algorithmen (1987) (5)
The Asymmetric Leader Election Algorithm with swedish stopping: A probabilistic analysis (2012) (5)
The number of gaps in sequences of geometrically distributed random variables (2005) (5)
Deutsch paths and their enumeration (2020) (5)
A PROOF OF A CONJECTURE OF MELHAM (2010) (5)
Average-Case Analysis of Priority Trees: A Structure for Priority Queue Administration (1998) (5)
Combinatorial Problems Related to Geometrically Distributed Random Variables (1993) (5)
Continued Fractions Related to (t,q)-Tangents and Variants (2011) (5)
(q, δ)-Numeration Systems with Missing Digits (2004) (5)
q-Enumeration of Salié Permutations (2007) (5)
D-records in Geometrically Distributed Random Variables (2006) (5)
Order statistics for the Cantor-Fibonacci distribution (2007) (5)
Combinatorics on lattice paths in strips (2020) (5)
A note on a result of R. Kemp on R-typly rooted planted plane trees (1982) (5)
Measuring Post–Quickselect Disorder (2004) (5)
Counting Zeros in Random Walks on the Integers and Analysis of Optimal Dual-Pivot Quicksort (2016) (5)
On the average hyperoscillations of planted plane trees (1982) (5)
Reductions of binary trees and lattice paths induced by the register function (2016) (5)
Asymptotische Untersuchungen Über Charakteristische Parameter Von SuchbĂumen (1987) (5)
Fringe analysis of plane trees related to cutting and pruning (2017) (5)
Recursion Depth Analysis for Specail Tree Traversal Algorithms (1984) (5)
Further results on a problem of Knödel concerning the analysis of bin-packing (1990) (5)
New Multiple Harmonic Sum Identities (2013) (5)
The Average Height of the Second Highest Leaf of a Planted Plane Tree (1984) (5)
Some Recent Results on the Register Function of a Binary Tree (1987) (5)
Advancing in the presence of a demon (2008) (5)
INTRODUCTION TO PHILIPPE FLAJOLET’S WORK ON THE REGISTER FUNCTION AND RELATED TOPICS (2012) (5)
Evaluation of sums involving products of Gaussian q-binomial coefficients with applications (2017) (4)
The continued fraction expansion of Gauss' hypergeometric function and a new application to the tangent function (2012) (4)
A Combinatorial and Probabilistic Study of Initial and End Heights of Descents in Samples of Geometrically Distributed Random Variables and in Permutations (2007) (4)
The Level Of Nodes In Heap Ordered Trees (1996) (4)
On a generalization of the dyck-language over a two letter alphabet (1979) (4)
Sums of Choi, Zörnig, and Rathie — an elementary approach (2009) (4)
On the moments of a distribution defined by the Gaussian polynomials (2004) (4)
Analysis of a new skip list variant (2006) (4)
On q-Olivier Functions (2002) (4)
Geometric random variables: Descents following maxima (2017) (4)
Über Längste 1-Teilfolgen In 0-1-Folgen (1987) (4)
Words with a generalized restricted growth property (2013) (4)
Enumeration of S-Motzkin paths from left to right and from right to left: a kernel method approach (2020) (4)
A GENERALIZATION OF A CONJECTURE OF MELHAM (2010) (4)
Ascents in Non-Negative Lattice Paths (2018) (4)
The Matrix of Super Patalan Numbers and its Factorizations (2017) (4)
Topologies on Free Monoids Induced by Families of Languages (1983) (4)
Analysis of an Algorithm to Construct Fibonacci Partitions (1984) (4)
THE CANTOR-FIBONACCI DISTRIBUTION (1998) (4)
One-parameter generalizations of Rogers-Ramanujan type identities (2009) (4)
How to Advance on a Stairway by Coin Flippings (1993) (4)
A q -Analogue of the Path Length of Binary Search Trees (1999) (4)
Random 0-1 rectangular matrices: a probabilistic analysis (2003) (4)
Some double binomial sums related with the Fibonacci, Pell and generalized order-$k$ Fibonacci numbers (2013) (4)
Digits and Beyond (2002) (4)
The largest missing value in a composition of an integer and some Allouche-Shallit-type identities (2013) (4)
Philippe Flajolet's Research in Analysis of Algorithms and Combinatorics (1998) (4)
Philippe Flajolet's early work in combinatorics (2021) (4)
The register function for lattice paths (2008) (4)
Identities with squares of binomial coefficients: An elementary and explicit approach (2016) (4)
On Cantor's singular moments (1999) (4)
WORDS CODING SET PARTITIONS (2011) (4)
Asymptotic results for silent elimination (2010) (3)
Die Bestimmung Gewisser Parameter Bei Binären Bäumen Mit Hilfe Analytischer Methoden (1985) (3)
Counting Ascents in Generalized Dyck Paths (2018) (3)
Weighted unary-binary trees, Hex-trees, marked ordered trees, and related structures (2021) (3)
On Ruehr's Identities (2018) (3)
Einige Bemerkungen zu einer Arbeit von W. Knödel über das mittlere Verhalten von on-line-Packungsalgorithmen (1985) (3)
Consecutive records in geometrically distributed words (2012) (3)
Sums of products of generalized Fibonacci and Lucas numbers (2015) (3)
Some Gaussian binomial sum formulæ with applications (2016) (3)
Dual-Pivot Quicksort: Optimality, Analysis and Zeros of Associated Lattice Paths (2016) (3)
Solution of a Problem of Yekutieli and Mandelbrot (1995) (3)
The box parameter for words and permutations (2013) (3)
On some questions by Cameron about ternary paths --- a linear algebra approach (2019) (3)
Asymptotic analysis of a class of functional equations and applications (1993) (3)
The digit generating function of a polynomial (2009) (3)
Factorizations related to the reciprocal Pascal matrix (2015) (3)
Partial Dyck paths with Air Pockets (2022) (3)
A short proof for a partition identity of Hwang and Wei (1984) (3)
Analysis of Summatory Functions of Regular Sequences: Transducer and Pascal's Rhombus (2018) (3)
The -Version of Binary Search Trees: An Average Case Analysis (2013) (3)
Two New Identities Involving the Catalan Numbers: A classical approach (2019) (3)
The scientific works of Rainer Kemp (1949-2004) (2006) (3)
The average height of the d-th highest leaf of a planted plane tree (1986) (3)
The Location of the First Maximum in the First Sojourn of a Dyck Path (2008) (3)
A Note on the Conjecture of Ramirez and Sirvent (2014) (3)
Application of Smirnov Words to Waiting Time Distributions of Runs (2015) (3)
Sums of powers over equally spaced Fibonacci numbers. (2019) (3)
A Bijective Proof of an Identity Concerning Nodes of Fixed Degree in Planted Trees (2000) (3)
Closed form evaluation of Melham's reciprocal sums (2017) (3)
Analysis of complements in Multi-Exponentiation Algorithms Using Signed Digit Representations (2009) (3)
The higher moments of the number of returns of a simple random walk (1994) (3)
q-Enumeration of words by their total variation (2010) (2)
A bijection between phylogenetic trees and plane oriented recursive trees (2017) (2)
A wide class of Combinatorial matrices related with Reciprocal Pascal and Super Catalan matrices (2019) (2)
Logarithms of a binomial series: A Stirling number approach (2018) (2)
Iterative Cutting and Pruning of Planar Trees (2017) (2)
A bijection between ternary trees and a subclass of Motzkin paths. (2018) (2)
On some problems about ternary paths: a linear algebra approach (2020) (2)
Average-Case Analysis of Algorithms - Preface (2001) (2)
Permuting in place: analysis of two stopping rules (2004) (2)
On the Optimality of an Algorithm of Reingold and Supowit (1996) (2)
On Combinatorial Identities of Engbers and Stocker (2017) (2)
A bijection between two subfamilies of Motzkin paths (2020) (2)
Additively irreducibles in alpha-expansions (2012) (2)
Approximate counting with m counters: A probabilistic analysis (2015) (2)
Continued fractions related to Goellnitz' little partition theorem (2013) (2)
On the Variance of the External Path Length in a Binary Digital Trie (1987) (2)
On the Interpolation of D0L-Sequences (1980) (2)
On the order of the recursion relation of Motzkin numbers of higher rank (2008) (2)
SMOOTH WORDS AND CHEBYSHEV POLYNOMIALS (2008) (2)
Complementary Families of the Fibonacci-Lucas Relations (2015) (2)
Set partitions, words, and approximate counting with black holes (2012) (2)
The analysis of Range Quickselect and related problems☆ (2011) (2)
CLOSED FORM EVALUATION OF RESTRICTED SUMS CONTAINING SQUARES OF FIBONOMIAL COEFFICIENTS (2016) (2)
Towards a General Concept of Hypercodes (1983) (2)
A closed formula for the generating function of $p$-Bernoulli numbers: An elementary proof (2018) (2)
- O-l-SEQUENCES WITHOUT LONG ADJACENT IDENTICAL BLOCKS (1979) (2)
Identities and Inequalities for Sums Involving Binomial Coefficients (2020) (2)
BIJECTIONS BETWEEN CERTAIN FAMILIES OF LABELLED AND UNLABELLED d-ARY TREES (2009) (2)
The number of restricted lattice paths revisited (2012) (2)
The Intrinsic Periodic Behaviour of Sequences Related to a Rational Integral (2011) (2)
The q-Catalan Numbers: A Saddle Point Approach (2011) (2)
Digital search trees with m trees: Level polynomials and insertion costs (2011) (2)
Dyck Paths with Parity Restrictions for the Final Runs to the Origin: a Study of the Height (2012) (2)
Do We Really Need to Balance Patricia Trees? (Extended Abstract) (1988) (2)
Do we really need to balance patricia tries (1988) (2)
Convolution identities for Tribonacci numbers via the diagonal of a bivariate generating function (2019) (2)
ON SOME PROBLEMS BY CAMERON ABOUT TERNARY PATHS — A LINEAR ALGEBRA APPROACH (2020) (2)
On the altitude of specified nodes in random trees (1984) (2)
Generating functions related to partition formulæ for Fibonacci numbers. (2008) (2)
Non-decreasing Deutsch paths (2020) (2)
Run Statistics for Geometrically Distributed Random Variables (Extended Abstract) (2000) (2)
Generating functions for a lattice path model introduced by Deutsch (2020) (2)
A coin tossing algorithm for counting large numbers of events (1992) (2)
A combinatorial study of two-periodic random walks (2016) (2)
A PRECISE DESCRIPTION OF THE p-ADIC VALUATION OF THE NUMBER OF ALTERNATING SIGN MATRICES (2009) (2)
ASYMPTOTIC RESULTS FOR THE NUMBER OF PATHS IN A GRID (2011) (1)
Enumeration of partial Lukasiewicz paths (2022) (1)
A walk in my lattice path garden (2021) (1)
Ternary Smirnov Words and Generating Functions (2018) (1)
Words, Permutations, and Representations of Numbers (2001) (1)
Order statistics of the generalised multinomial measure (2014) (1)
BOOTSTRAPPING AND GUMBEL LIMIT LAWS (2011) (1)
Comments on the Analysis of Parameters in a Random Graph Model (1995) (1)
A short and elementary proof for a double sum of Brent and Osburn (2013) (1)
An elementary approach to solve recursions relative to the enumeration of S-Motzkin paths (2020) (1)
Explicit and asymptotic formulae for the expected values of theorder statistics of the Cantor distributionArnold Knopfmachera (1996) (1)
An Asymptotic Comment on a Paper by Analyti and Pramanik (1994) (1)
Continued fraction expansions related to Göllnitz’ little partition theorem (2013) (1)
The inverse Filbert matrix (2015) (1)
Digital Search Trees - Further Results on a Fundamental Data Structure (1989) (1)
Growing and Destroying Catalan-Stanley Trees (2017) (1)
ON A FUNCTIONAL{DIFFERENCE EQUATION OF RUNYON, MORRISON, CARLITZ, AND RIORDAN (2001) (1)
Analysis of carries in signed digit expansions (2016) (1)
Optimal versus randomized search of fixed length binary words (2002) (1)
The Eigenvectors of the Right-Justified Pascal Triangle: A Shorter Proof with Generating Functions (2000) (1)
Skew Dyck Paths With Catastrophes (2022) (1)
Pseudo q-Engel expansions and Rogers-Ramanujan type identities (2012) (1)
The necklace process: A generating function approach (2018) (1)
Analysis of carries in signed digit expansions (2015) (1)
Finite Rogers-Ramanujan type continued fractions (2018) (1)
A new recursion for Bressoud’s polynomials (2020) (1)
A Short Proof of a Series Evaluation in Terms of Harmonic Numbers (2009) (1)
TWO q-IDENTITIES FROM THE THEORY OF FOUNTAINS AND HISTOGRAMS PROVED WITH A TRI-DIAGONAL DETERMINANT (2005) (1)
The Register Function and Reductions of Binary Trees and Lattice Paths (2016) (1)
Counting Palindromes According to r-Runs of Ones Using Generating Functions (2014) (1)
Horizontal runs in domino tilings (2014) (1)
How to sum powers of balancing numbers efficiently (2020) (1)
Asymptotic analysis of the sum of the output of transducers (2014) (1)
A Note on Stirling sums (2010) (1)
Counting ternary trees according to the number of middle edges and factorizing into (3/2)-ary trees (2020) (1)
Additive irreducibles in α-expansions (2011) (1)
Some Polynomials Related to the Fibonacci Polynomials (1994) (1)
Kirkman's hypothesis revisited (2000) (1)
How often do we reject a superior value? (2011) (1)
The height of q-Binary Search Trees (2002) (1)
On a reciprocity law for finite multiple zeta values. (2009) (1)
Probabilistic Modeling of Data Structures on Words: A Reply to Professor Andersson's Letter (1992) (1)
Summations in Bernoulli's Triangles via Generating Functions (2017) (1)
Summing a Family of Generalized Pell Numbers (2020) (1)
Height restricted lattice paths, Elenas, and bijections (2016) (1)
Some Gaussian binomial sum formulæ with applications (2016) (0)
`Average-Case'-Analysis of Algorithms (Dagstuhl Seminar 9527) (2021) (0)
A hypergeometric proof for a binomial identity related to $1/\pi$ (2019) (0)
Integers 5 ( 3 ) , 2005 , A 09 ( electronic ) COUNTING OPTIMAL JOINT DIGIT EXPANSIONS (2005) (0)
Formulæ for multi-parameter Gaussian q-binomial sums with applications (2020) (0)
Additive irreducibles in x-expansions (2012) (0)
Einige Kommentare zu einer bin-packing Aufgabe von W. Knödel (1992) (0)
Closed form evaluation of some reciprocal trigonometric sums via partial fraction decomposition (2020) (0)
STAIRCASE WORDS AND CHEBYSHEV (2010) (0)
On the enumeration of Hoppy's walks (2020) (0)
Returns to the Origin for Random Walks on $\mathbb Z$ Revisited (2005) (0)
Factorizations related to some numerical triangles (2017) (0)
Schur's old determinant proves a brand-new theorem of Garrett-Ismail-Stanton (2000) (0)
The amplitude of Motzkin paths (2021) (0)
Enumeration of Deutsch paths by adding the adding-a-new-slice method and applications (2020) (0)
Partial sums of Horadam sequences: sum-free representations via generating functions (2021) (0)
Number of survivors in the presence of a demon (2012) (0)
The Analysis of Multiple Quickselect (0)
Optimal Versus Randomized Sear h ofFixed Length Binary WordsMay 27 , 2001 (2001) (0)
The number of up-runs of length one in Deutsch paths (2020) (0)
Discrete Structures and Applications Horizontal runs in domino tilings (2015) (0)
Company-Ol-SEQUENCES WITHOUT LONG ADJACENT IDENTICAL BLOCKS (2001) (0)
OCCURRENCES IN SIGNED DIGIT REPRESENTATIONS (2003) (0)
Combinatorics : past and present (2006) (0)
Kn\"odel walks in a B\"ohm-Hornik environment (2021) (0)
Forty years of tree enumeration (2016) (0)
q q-Enumeration of Sali· e Permutations (2007) (0)
On the Recursion Depth of Special Tree (1987) (0)
Contributions to the analysis of approximate counting (2016) (0)
On third-order Pell polynomials (2020) (0)
Optimal versus randomized search of fixed length words (2002) (0)
A Finite Sum of Products of Binomial Coefficients (C. C. Grosjean) (1993) (0)
The height of multiple edge plane trees (2015) (0)
Analysis of a new skip list variant : — Extended Abstract — (2006) (0)
One level summations for powers of Fibonacci and Lucas polynomials (2021) (0)
Multi-edge trees and 3-coloured Motzkin paths: bijective issues (2021) (0)
اندازهگیری بینظمی پساـزودگزین (2004) (0)
Elementary evaluation of a determinant of Kirschenhofer and Thuswaldner (2018) (0)
Lattice paths with infinitely many down steps -- the negative boundary model (2021) (0)
Applicable Analysis and Discrete Mathematics (2009) (0)
A recent identity of Larcombe and Fennessey is derived via a weighted version of Cassini’s identity for Fibonacci numbers (2015) (0)
Formulas for Fibonomial Sums with Fibonacci Coefficients (2011) (0)
نوسانهای دورهای در تحلیل الگوریتمها و حذف آنها (2004) (0)
ONTHEVARIANCEOFTHEEXTERNALPATHLENGTHIN A SYMMETRIC DIGITAL TRlE (1989) (0)
Skew Dyck paths having no peaks at level 1 (2022) (0)
Helmut Prodinger The reciprocal super Catalan matrix (2015) (0)
Motzkin paths with catastrophes and air pockets ( very early version ) (2023) (0)
Analysis of algorithms (2002) (0)
Skew Dyck paths without up–down–left (2022) (0)
Counting edges according to edge-type in $t$-ary trees (2022) (0)
Discrete Structures and Applications Finite Rogers – Ramanujan type continued fractions ∗ (2018) (0)
Analysis of Bidirectional Ballot Sequences and Random Walks Ending in Their Maximum (2016) (0)
A Binomial Summation (Gengzhe Chang and Zun Shan) (1984) (0)
Consecutive records in geometrically distributed words (2011) (0)
Combinatorics Arising from Lax Colimits of Posets (2020) (0)
LATTICE PATHS , SAMPLING WITHOUT REPLACEMENT , AND THE KERNEL METHOD (2008) (0)
Visibility problems related to skip lists (2018) (0)
An online bin-packing problem with an underlying ternary structure (2021) (0)
Deepest Nodes in Marked Ordered Trees (2022) (0)
Continued fraction expansions related to Göllnitz’ little partition theorem (2012) (0)
Evaluation of sums of products of Gaussianq-binomial coefficients with rationalweight functions (2020) (0)
Advanced Problems: 6334-6338 (1981) (0)
A nonsymmetrical matrix and its factorizations (2019) (0)
Complements and signed digit representations: Analysis of a multi-exponentiation-algorithm of Wu, Lou, Lai and Chang (2008) (0)
Enumeration of partial Łukasiewicz paths (2022) (0)
Book reviews (1997) (0)
A new (?) continued fraction expansion for the reciprocal of a $q$-series (2008) (0)
Representations of Numbers as åk=-nn ek k\sum_{k=-n}^n \varepsilon_k k: A Saddle Point Approach (2007) (0)
Schur ' s Determinants and Partition (2000) (0)
Notes on a combinatorial identity (2016) (0)
A matrix with sums of Catalan numbers -- LU-decomposition and determinant (2021) (0)
Sums of products of generalized Fibonacci and Lucas numbers (2014) (0)
Ju n 20 21 WEIGHTED UNARY-BINARY TREES , HEX-TREES , AND HORTON-STRAHLER NUMBERS REVISITED (2021) (0)
The generalized Lilbert matrix (2016) (0)
Batcher's odd-even exchange revisited: A generating functions approach (2016) (0)
Retakh's Motzkin paths and some combinatorial comments (2020) (0)
An elementary proof of a series evaluation in terms of harmonic numbers (2008) (0)
Partial Skew Motzkin Paths (2022) (0)
Flajolet ’ s Early Work in Combinatorics (2021) (0)
MIN-turns and MAX-turns in k-Dyck paths: a pure generating function approach (2021) (0)
"Average-Case"-Analysis of Algorithms (Dagstuhl Seminar 9328) (2021) (0)
`Average-Case'-Analysis of Algorithms (Dagstuhl Seminar 9728) (2021) (0)
The inverse Filbert matrix (2014) (0)
Some comments on a bin-packing problem of W. Kno¨del (1991) (0)
Fringe analysis of plane trees related to cutting and pruning (2018) (0)
Order statistics of the generalised multinomial measure (2014) (0)
Some combinatorial matrices and their LU-decomposition (2019) (0)
Random Generation of Trees - L. Alonso; R. Schott. (1997) (0)
A Tree-Counting Identity: 10781 (2002) (0)
The LU-decomposition of Lehmer's tridiagonal matrix (2018) (0)

This paper list is powered by the following services:

What Schools Are Affiliated With Helmut Prodinger?

Helmut Prodinger is affiliated with the following schools:

Helmut Prodinger's Academic­Influence.com Rankings

Helmut Prodinger's Degrees

Similar Degrees You Can Earn

Why Is Helmut Prodinger Influential?

Helmut Prodinger's Published Works

Published Works

What Schools Are Affiliated With Helmut Prodinger?

Helmut Prodinger's AcademicInfluence.com Rankings