Helmut Prodinger

According to our database1, Helmut Prodinger authored at least 192 papers between 1979 and 2023.

Collaborative distances:



In proceedings 
PhD thesis 


On csauthors.net:


Combinatorics Arising from Lax Colimits of Posets.
Order, October, 2023

Skew Dyck paths without up-down-left.
Art Discret. Appl. Math., August, 2023

Partial Skew Dyck Paths: A Kernel Method Approach.
Graphs Comb., 2022

Combinatorics on lattice paths in strips.
Eur. J. Comb., 2021

Identities and Inequalities for Sums Involving Binomial Coefficients.
Integers, 2020

Complementary Families of the Fibonacci-Lucas Relations.
Integers, 2019

Dual-Pivot Quicksort: Optimality, Analysis and Zeros of Associated Lattice Paths.
Comb. Probab. Comput., 2019

A wide class of Combinatorial matrices related with Reciprocal Pascal and Super Catalan matrices.
Contributions Discret. Math., 2019

Logarithms of a binomial series: A Stirling number approach.
Ars Math. Contemp., 2019

Reductions of binary trees and lattice paths induced by the register function.
Theor. Comput. Sci., 2018

Ternary Smirnov Words and Generating Functions.
Integers, 2018

Growing and Destroying Catalan-Stanley Trees.
Discret. Math. Theor. Comput. Sci., 2018

On Ruehr's Identities.
Ars Comb., 2018

Analysis of Summatory Functions of Regular Sequences: Transducer and Pascal's Rhombus.
Proceedings of the 29th International Conference on Probabilistic, 2018

Counting Ascents in Generalized Dyck Paths.
Proceedings of the 29th International Conference on Probabilistic, 2018

Summations in Bernoulli's Triangles via Generating Functions.
J. Integer Seq., 2017

On Combinatorial Identities of Engbers and Stocker.
Integers, 2017

Application of Smirnov Words to Waiting Time Distributions of Runs.
Electron. J. Comb., 2017

Iterative Cutting and Pruning of Planar Trees.
Proceedings of the Fourteenth Workshop on Analytic Algorithmics and Combinatorics, 2017

Batcher's odd-even exchange revisited: A generating functions approach.
Theor. Comput. Sci., 2016

The generalized Lilbert matrix.
Period. Math. Hung., 2016

Returns, Hills, and t-ary Trees.
J. Integer Seq., 2016

Some Binomial Sums Involving Absolute Values.
J. Integer Seq., 2016

Counting Zeros in Random Walks on the Integers and Analysis of Optimal Dual-Pivot Quicksort.
CoRR, 2016

Formulæ related to the \(q\) -Dixon formula with applications to Fibonomial sums.
Period. Math. Hung., 2015

Bootstrapping and double-exponential limit laws.
Discret. Math. Theor. Comput. Sci., 2015

The height and width of bargraphs.
Discret. Appl. Math., 2015

Output Sum of Transducers: Limiting Distribution and Periodic Fluctuation.
Electron. J. Comb., 2015

Counting Palindromes According to r-Runs of Ones Using Generating Functions.
J. Integer Seq., 2014

A Short Proof of Carlitz’s Bernoulli Number Identity.
J. Integer Seq., 2014

A Note on the Conjecture of Ramirez and Sirvent.
J. Integer Seq., 2014

New Multiple Harmonic Sum Identities.
Electron. J. Comb., 2014

The Number of Huffman Codes, Compact Trees, and Sums of Unit Fractions.
IEEE Trans. Inf. Theory, 2013

An Identity Conjectured by Lacasse via the Tree Function.
Electron. J. Comb., 2013

Approximate counting with m counters: A detailed analysis.
Theor. Comput. Sci., 2012

Number of survivors in the presence of a demon.
Period. Math. Hung., 2012

The <i>q</i>-Pilbert matrix.
Int. J. Comput. Math., 2012

Dyck Paths with Parity Restrictions for the Final Runs to the Origin: a Study of the Height.
Fundam. Informaticae, 2012

The Asymmetric Leader Election Algorithm with swedish stopping: A probabilistic analysis.
Discret. Math. Theor. Comput. Sci., 2012

Notes on protected nodes in digital search trees.
Appl. Math. Lett., 2012

Set partitions, words, and approximate counting with black holes.
Australas. J Comb., 2012

The analysis of Range Quickselect and related problems.
Theor. Comput. Sci., 2011

The Intrinsic Periodic Behaviour of Sequences Related to a Rational Integral.
Integers, 2011

Unfair permutations.
Eur. J. Comb., 2011

Digital search trees with m trees: Level polynomials and insertion costs.
Discret. Math. Theor. Comput. Sci., 2011

Redundant <i>τ</i>-adic expansions I: non-adjacent digit sets and their applications to scalar multiplication.
Des. Codes Cryptogr., 2011

Continued Fractions Related to (<i>t,q</i>)-Tangents and Variants.
Electron. J. Comb., 2011

The Swedish Leader Election Protocol: Analysis and Variations.
Proceedings of the Eighth Workshop on Analytic Algorithmics and Combinatorics, 2011

A Note on Stirling Series.
Integers, 2010

Arithmetic of Supersingular Koblitz Curves in Characteristic Three.
IACR Cryptol. ePrint Arch., 2010

Bijections for a class of labeled plane trees.
Eur. J. Comb., 2010

Continued fraction expansions for q-tangent and q-cotangent functions.
Discret. Math. Theor. Comput. Sci., 2010

Asymptotic results for silent elimination.
Discret. Math. Theor. Comput. Sci., 2010

q-Enumeration of words by their total variation.
Discret. Math. Theor. Comput. Sci., 2010

One-parameter generalizations of Rogers-Ramanujan type identities.
Adv. Appl. Math., 2010

Moves and displacements of particular elements in Quicksort.
Theor. Comput. Sci., 2009

Analysis of complements in Multi-Exponentiation Algorithms Using Signed Digit Representations.
Int. J. Found. Comput. Sci., 2009

Bijections for 2-plane trees and ternary trees.
Eur. J. Comb., 2009

A simple bijection between a subclass of 2-binary trees and ternary trees.
Discret. Math., 2009

Lattice Paths, Sampling Without Replacement, and Limiting Distributions.
Electron. J. Comb., 2009

Generalized approximate counting revisited.
Theor. Comput. Sci., 2008

Redundant tau-adic Expansions I: Non-Adjacent Digit Sets and their Applications to Scalar Multiplication.
IACR Cryptol. ePrint Arch., 2008

The Location of the First Maximum in the First Sojourn of a Dyck Path.
Discret. Math. Theor. Comput. Sci., 2008

On gaps and unoccupied urns in sequences of geometrically distributed random variables.
Discret. Math., 2008

Generating Random Derangements.
Proceedings of the Fifth Workshop on Analytic Algorithmics and Combinatorics, 2008

Level of nodes in increasing trees revisited.
Random Struct. Algorithms, 2007

The Hamming weight of the non-adjacent-form under various input statistics.
Period. Math. Hung., 2007

A Combinatorial and Probabilistic Study of Initial and End Heights of Descents in Samples of Geometrically Distributed Random Variables and in Permutations.
Discret. Math. Theor. Comput. Sci., 2007

The Last Descent In Samples Of Geometric Random Variables And Permutations.
Ars Comb., 2007

On <i>α</i>-greedy expansions of numbers.
Adv. Appl. Math., 2007

Representations of Numbers as å<sub><i>k</i>=-<i>n</i></sub><sup><i>n</i></sup> e<sub><i>k</i></sub> <i>k</i>\sum_{k=-n}^n \varepsilon_k k: A Saddle Point Approach.
Proceedings of the Infinity in Logic and Computation, International Conference, 2007

The scientific works of Rainer Kemp (1949-2004).
Theor. Comput. Sci., 2006

The register function for <i>t</i>-ary trees.
ACM Trans. Algorithms, 2006

The number of distinct values in a geometrically distributed sample.
Eur. J. Comb., 2006

<i>d</i>-records in geometrically distributed random variables.
Discret. Math. Theor. Comput. Sci., 2006

The first descent in samples of geometric random variables and permutations.
Discret. Math. Theor. Comput. Sci., 2006

Asymptotics of the Moments of Extreme-Value Related Distribution Functions.
Algorithmica, 2006

Scalar Multiplication on Koblitz Curves Using the Frobenius Endomorphism and Its Combination with Point Halving: Extensions and Mathematical Analysis.
Algorithmica, 2006

On Redundant <i>tau</i> -Adic Expansions and Non-adjacent Digit Sets.
Proceedings of the Selected Areas in Cryptography, 13th International Workshop, 2006

The alternating greedy expansion and applications to computing digit expansions from left-to-right in cryptography.
Theor. Comput. Sci., 2005

Analysis of linear combination algorithms in cryptography.
ACM Trans. Algorithms, 2005

Minimality of the Hamming Weight of the \tau-NAF for Koblitz Curves and Improved Combination with Point Halving.
IACR Cryptol. ePrint Arch., 2005

Minimality of the Hamming Weight of the <i>T</i>-NAF for Koblitz Curves and Improved Combination with Point Halving.
Proceedings of the Selected Areas in Cryptography, 12th International Workshop, 2005

Distribution results for low-weight binary representations for pairs of integers.
Theor. Comput. Sci., 2004

Permuting in place: analysis of two stopping rules.
J. Algorithms, 2004

Analysis of some statistics for increasing tree families.
Discret. Math. Theor. Comput. Sci., 2004

On Some Parameters in Heap Ordered Trees.
Comb. Probab. Comput., 2004

Compositions and Patricia Tries: No Fluctuations in the Variance!
Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments and the First Workshop on Analytic Algorithmics and Combinatorics, 2004

Combinatorics of geometrically distributed random variables: run statistics.
Theor. Comput. Sci., 2003

A bijection between directed column-convex polyominoes and ordered trees of height at most three.
Theor. Comput. Sci., 2003

Random 0-1 rectangular matrices: a probabilistic analysis.
Period. Math. Hung., 2003

Carry propagation in signed digit representations.
Eur. J. Comb., 2003

Fountains, histograms, and q-identities.
Discret. Math. Theor. Comput. Sci., 2003

Optimal versus randomized search of fixed length binary words.
IEEE Trans. Inf. Theory, 2002

Sorting algorithms for broadcast communications: mathematical analysis.
Theor. Comput. Sci., 2002

A Tree-Counting Identity: 10781.
Am. Math. Mon., 2002

J. Algorithms, 2002

A multivariate view of random bucket digital search trees.
J. Algorithms, 2002

Probabilistic Analysis of Carlitz Compositions.
Discret. Math. Theor. Comput. Sci., 2002

The height of q-Binary Search Trees.
Discret. Math. Theor. Comput. Sci., 2002

Combinatorics of geometrically distributed random variables: value and position of large left-to-right maxima.
Discret. Math., 2002

Bijections for ternary trees and non-crossing trees.
Discret. Math., 2002

On the Analysis of an Algorithm to Generate a Random Cyclic Permutation.
Ars Comb., 2002

Some applications of the q-Rice formula.
Random Struct. Algorithms, 2001

Ascending runs of sequences of geometrically distributed random variables: a probabilistic analysis.
Electron. Notes Discret. Math., 2001

Combinatorics of geometrically distributed random variables: Value and position of the rth left-to-right maximum.
Discret. Math., 2001

On Minimal Expansions in Redundant Number Systems: Algorithms and Quantitative Analysis.
Computing, 2001

A Simple Card Guessing Game Revisited.
Electron. J. Comb., 2001

Average-Case Analysis of Algorithms - Preface.
Algorithmica, 2001

A q-Analogue of the Path Length of Binary Search Trees.
Algorithmica, 2001

Partial Match Queries in Relaxed Multidimensional Search Trees.
Algorithmica, 2001

Words, Permutations, and Representations of Numbers.
Proceedings of the Developments in Language Theory, 5th International Conference, 2001

Words, Dyck Paths, Trees, and Bijections.
Proceedings of the Words, Semigroups, and Transductions, 2001

A Bijective Proof of an Identity Concerning Nodes of Fixed Degree in Planted Trees.
Ars Comb., 2000

A q-analogue of a formula of Hernandez obtained by inverting a result of Dilcher.
Australas. J Comb., 2000

Combinatorics of Geometrically Distributed Random Variables: Lenght of Ascending Runs.
Proceedings of the LATIN 2000: Theoretical Informatics, 2000

Run Statistics for Geometrically Distributed Random Variables (Extended Abstract).
Proceedings of the LATIN 2000: Theoretical Informatics, 2000

On Stirling Numbers for Complex Arguments and Hankel Contours.
SIAM J. Discret. Math., 1999

A generating functions approach for the analysis of grand averages for multiple QUICKSELECT.
Random Struct. Algorithms, 1998

An Asymptotic Study of a Recursion Occurring in the Analysis of an Algorithm on Broadcast Communication.
Inf. Process. Lett., 1998

On Carlitz Compositions.
Eur. J. Comb., 1998

Comparisons in Hoare's Find Algorithm.
Comb. Probab. Comput., 1998

On the Number of Descendants and Ascendants in Random Search Trees.
Electron. J. Comb., 1998

Towards a More Precise Analysis of an Algorithm to Generate Binary Trees: A Tutorial.
Comput. J., 1998

Philippe Flajolet's Research in Analysis of Algorithms and Combinatorics.
Algorithmica, 1998

Average-Case Analysis of Priority Trees: A Structure for Priority Queue Administration.
Algorithmica, 1998

On a Problem of Yekutieli and Mandelbrot about the Bifurcation Ratio of Binary Trees.
Theor. Comput. Sci., 1997

Analysis of Hoare's FIND algorithm with Median-of-three partition.
Random Struct. Algorithms, 1997

Descendants and ascendants in binary trees.
Discret. Math. Theor. Comput. Sci., 1997

A generating function approach to random subgraphs of the n-cycle.
Discret. Math., 1997

Maximum Statistics of N Random Variables Distributed by the Negative Binomial Distribution.
Comb. Probab. Comput., 1997

Analysis of a splitting process arising in probabilistic counting and other related algorithms.
Random Struct. Algorithms, 1996

On the Optimality of an Algorithm of Reingold and Supowit.
J. Autom. Lang. Comb., 1996

Depth and Path Length of Heap Ordered Trees.
Int. J. Found. Comput. Sci., 1996

Combinatorics of geometrically distributed random variables: Left-to-right maxima.
Discret. Math., 1996

Descendants in heap ordered trees or a triumph of computer algebra.
Electron. J. Comb., 1996

Analysis of an Optimized Search Algorithm for Skip Lists.
Theor. Comput. Sci., 1995

Comments on the Analysis of Parameters in a Random Graph Model.
RAIRO Theor. Informatics Appl., 1995

Multiple Quickselect - Hoare's Find Algorithm for Several Elements.
Inf. Process. Lett., 1995

Digital search trees and basic hypergeometric functions.
Bull. EATCS, 1995

Bottom-Up Mergesort - a Detailed Analysis.
Algorithmica, 1995

Solution of a Problem of Yekutieli and Mandelbrot.
Proceedings of the LATIN '95: Theoretical Informatics, 1995

Mellin Transforms and Asymptotics: Digital Sums.
Theor. Comput. Sci., 1994

Digital Search Trees Again Revisited: The Internal Path Length Perspective.
SIAM J. Comput., 1994

Multidimensional Digital Searching-Alternative Data Structures.
Random Struct. Algorithms, 1994

An Asymptotic Comment on a Paper by Analyti and Pramanik.
Inf. Process. Lett., 1994

Some Polynomials Related to the Fibonacci Polynomials.
Bull. EATCS, 1994

The Path Length of Random Skip Lists.
Acta Informatica, 1994

A Finite Sum of Products of Binomial Coefficients (C. C. Grosjean).
SIAM Rev., 1993

A Note on Binomial Recurrences Arising in the Analysis of Algorithms.
Inf. Process. Lett., 1993

Multidimensional Digital Searching and Some New Parameters in Tries.
Int. J. Found. Comput. Sci., 1993

How to select a loser.
Discret. Math., 1993

A result in order statistics related to probabilistic counting.
Computing, 1993

Hypothetical Analyses: Approximate Counting in the Style of Knuth, Path Length in the Style of Flajolet.
Theor. Comput. Sci., 1992

Probabilistic Modeling of Data Structures on Words: A Reply to Professor Andersson's Letter.
Theor. Comput. Sci., 1992

External Internal Nodes in Digital Search Trees via Mellin Transforms.
SIAM J. Comput., 1992

Some analytic techniques for the investigation of the asymptotic behaviour of tree parameters.
Bull. EATCS, 1992

Einige Kommentare zu einer bin-packing Aufgabe von W. Knödel.
Computing, 1992

How to Count Quickly and Accurately: A Unified Analysis of Probabilistic Counting and Other Related Problems.
Proceedings of the Automata, Languages and Programming, 19th International Colloquium, 1992

Approximate counting: an alternative approach.
RAIRO Theor. Informatics Appl., 1991

On the Balance Property of Patricia Tries: External Path Length Viewpoint.
Theor. Comput. Sci., 1989

On the variance of the external path length in a symmetric digital trie.
Discret. Appl. Math., 1989

Digital Search Trees - Further Results on a Fundamental Data Structure.
Proceedings of the Information Processing 89, Proceedings of the IFIP 11th World Computer Congress, San Francisco, USA, August 28, 1989

Further Results on Digital Search Trees.
Theor. Comput. Sci., 1988

Do We Really Need to Balance Patricia Trees? (Extended Abstract).
Proceedings of the Automata, Languages and Programming, 15th International Colloquium, 1988

On the Recursive Depth of Special Tree Traversal Algorithms
Inf. Comput., July, 1987

Level number sequences for trees.
Discret. Math., 1987

Register Allocation for Unary-Binary Trees.
SIAM J. Comput., 1986

The average height of the <i>d</i>-th highest leaf of a planted plane tree.
Networks, 1986

Two selection problems revisited.
J. Comb. Theory, Ser. A, 1986

Spanning tree formulas and chebyshev polynomials.
Graphs Comb., 1986

Some Further Results on Digital Search Trees.
Proceedings of the Automata, Languages and Programming, 13th International Colloquium, 1986

Einige Bemerkungen zu einer Arbeit von W. Knödel über das mittlere Verhalten von on-line-Packungsalgorithmen.
J. Inf. Process. Cybern., 1985

On the altitude of specified nodes in random trees.
J. Graph Theory, 1984

Analysis of an Algorithm to Construct Fibonacci Partitions.
RAIRO Theor. Informatics Appl., 1984

The Average Height of the Second Highest Leaf of a Planted Plane Tree.
Eur. J. Comb., 1984

A short proof for a partition identity of Hwang and Wei.
Discret. Math., 1984

Recursion Depth Analysis for Specail Tree Traversal Algorithms.
Proceedings of the Automata, 1984

On the Number of Combinations without a Fixed Distance.
J. Comb. Theory, Ser. A, 1983

Topologies on Free Monoids Induced by Families of Languages.
RAIRO Theor. Informatics Appl., 1983

A correspondence between ordered trees and noncrossing partitions.
Discret. Math., 1983

Non-repetitive sequences and gray code.
Discret. Math., 1983

On monotone functions of tree structures.
Discret. Appl. Math., 1983

A note on a result of R. Kemp on R-typly rooted planted plane trees.
Computing, 1982

On the average hyperoscillations of planted plane trees.
Comb., 1982

Congruences Defined by Languages and Filters
Inf. Control., January, 1980

On the Interpolation of D0L-Sequences.
Theor. Comput. Sci., 1980

Topologies on Free Monoids Induced by Closure Operators of a Special Type.
RAIRO Theor. Informatics Appl., 1980

Language Operators Related to Init.
Theor. Comput. Sci., 1979

Infinite 0-1-sequences without long adjacent identical blocks.
Discret. Math., 1979

On a generalization of the dyck-language over a two letter alphabet.
Discret. Math., 1979

On the Height of Derivation Trees.
Proceedings of the Automata, 1979