Helmut Prodinger

发表

Minimality of the Hamming Weight of the \tau-NAF for Koblitz Curves and Improved Combination with Point Halving

Roberto Maria Avanzi, Helmut Prodinger, Clemens Heuberger, 2005, IACR Cryptol. ePrint Arch..

Congruences Defined by Languages and Filters

Helmut Prodinger, H. Prodinger, 1980, Inf. Control..

Dyck Paths with Parity Restrictions for the Final Runs to the Origin: a Study of the Height

Helmut Prodinger, H. Prodinger, 2012, Fundam. Informaticae.

Analysis of an Algorithm to Construct Fibonacci Partitions

Helmut Prodinger, 1984, RAIRO Theor. Informatics Appl..

Combinatorics of geometrically distributed random variables: Value and position of the rth left-to-right maximum

Arnold Knopfmacher, Helmut Prodinger, 2001, Discret. Math..

Distribution results for low-weight binary representations for pairs of integers

Helmut Prodinger, Clemens Heuberger, Peter J. Grabner, 2004, Theor. Comput. Sci..

Comparisons in Hoare's Find Algorithm

Helmut Prodinger, Peter Kirschenhofer, H. Prodinger, 1998, Combinatorics, Probability and Computing.

Permuting in place: analysis of two stopping rules

Helmut Prodinger, Alois Panholzer, Marko Riedel, 2004, J. Algorithms.

Representations of Numbers as åk=-nn ek k\sum_{k=-n}^n \varepsilon_k k: A Saddle Point Approach

Guy Louchard, Helmut Prodinger, G. Louchard, 2007, ILC.

On gaps and unoccupied urns in sequences of geometrically distributed random variables

Guy Louchard, Helmut Prodinger, G. Louchard, 2008, Discret. Math..

Analysis of an Optimized Search Algorithm for Skip Lists

Helmut Prodinger, Conrado Martínez, Peter Kirschenhofer, 1995, Theor. Comput. Sci..

Helmut Prodinger, Philippe Flajolet, P. Flajolet, 1986, SIAM J. Comput..

Asymptotics of the Moments of Extreme-Value Related Distribution Functions

Guy Louchard, Helmut Prodinger, G. Louchard, 2006, Algorithmica.

A Note on Binomial Recurrences Arising in the Analysis of Algorithms

Helmut Prodinger, Wojciech Szpankowski, W. Szpankowski, 1993, Inf. Process. Lett..

Analysis of algorithms

Helmut Prodinger, Brigitte Vallée, 2002 .

The Intrinsic Periodic Behaviour of Sequences Related to a Rational Integral

Helmut Prodinger, 2011, Integers.

Probabilistic Modeling of Data Structures on Words: A Reply to Professor Andersson's Letter

Helmut Prodinger, Wojciech Szpankowski, Peter Kirschenhofer, 1992, Theor. Comput. Sci..

Comments on the Analysis of Parameters in a Random Graph Model

Helmut Prodinger, 1995, RAIRO Theor. Informatics Appl..

Combinatorics of geometrically distributed random variables: Left-to-right maxima

Helmut Prodinger, H. Prodinger, 1996, Discret. Math..

Maximum Statistics of N Random Variables Distributed by the Negative Binomial Distribution

Helmut Prodinger, Peter J. Grabner, H. Prodinger, 1997, Combinatorics, Probability and Computing.

Partial match queries in relaxed multidimensional search trees

Helmut Prodinger, Conrado Martínez, Alois Panholzer, 2001, Algorithmica.

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

Helmut Prodinger, H. Prodinger, 2010, Discret. Math. Theor. Comput. Sci..

Asymptotic results for silent elimination

Guy Louchard, Helmut Prodinger, G. Louchard, 2010, Discret. Math. Theor. Comput. Sci..

Approximate counting with m counters: A detailed analysis

Helmut Prodinger, 2012, Theor. Comput. Sci..

A multivariate view of random bucket digital search trees

Helmut Prodinger, Hosam M. Mahmoud, Hsien-Kuei Hwang, 2002, J. Algorithms.

A Note on Stirling Series

Helmut Prodinger, Markus Kuba, H. Prodinger, 2010, Integers.

Do We Really Need to Balance Patricia Trees? (Extended Abstract)

Helmut Prodinger, Wojciech Szpankowski, Peter Kirschenhofer, 1988, International Colloquium on Automata, Languages and Programming.

Generating Random Derangements

Helmut Prodinger, Conrado Martínez, Alois Panholzer, 2008, ANALCO.

A Bijective Proof of an Identity Concerning Nodes of Fixed Degree in Planted Trees

Helmut Prodinger, John W. Moon, 2000, Ars Comb..

On the Interpolation of D0L-Sequences

Helmut Prodinger, 1980, Theor. Comput. Sci..

The Location of the First Maximum in the First Sojourn of a Dyck Path

Helmut Prodinger, H. Prodinger, 2008, Discret. Math. Theor. Comput. Sci..

Analysis of a splitting process arising in probabilistic counting and other related algorithms

Helmut Prodinger, Wojciech Szpankowski, Peter Kirschenhofer, 1996, Random Struct. Algorithms.

q-Enumeration of words by their total variation

Helmut Prodinger, Ligia Loreta Cristea, 2010, Discret. Math. Theor. Comput. Sci..

Bijections for a class of labeled plane trees

Helmut Prodinger, Stephan G. Wagner, Nancy S. S. Gu, 2010, Eur. J. Comb..

Über Längste 1-Teilfolgen In 0-1-Folgen

Helmut Prodinger, H. Prodinger, 1987 .

Identities and Inequalities for Sums Involving Binomial Coefficients

Helmut Prodinger, Horst Alzer, H. Alzer, 2020, Integers.

A correspondence between ordered trees and noncrossing partitions

Helmut Prodinger, 1983, Discret. Math..

Bijections for ternary trees and non-crossing trees

Helmut Prodinger, Alois Panholzer, H. Prodinger, 2002, Discret. Math..

Helmut Prodinger, Emrah Kilic, 2015, Period. Math. Hung..

The Number of Huffman Codes, Compact Trees, and Sums of Unit Fractions

Helmut Prodinger, Clemens Heuberger, Christian Elsholtz, 2013, IEEE Transactions on Information Theory.

Optimal versus randomized search of fixed length binary words

Helmut Prodinger, Wojciech Szpankowski, 2002, IEEE Trans. Inf. Theory.

The Average Height of the Second Highest Leaf of a Planted Plane Tree

Helmut Prodinger, H. Prodinger, 1984, Eur. J. Comb..

Redundant τ-adic expansions I: non-adjacent digit sets and their applications to scalar multiplication

Roberto Maria Avanzi, Helmut Prodinger, Clemens Heuberger, 2008, Des. Codes Cryptogr..

Descendants and ascendants in binary trees

Helmut Prodinger, Alois Panholzer, H. Prodinger, 1997, Discret. Math. Theor. Comput. Sci..

Topologies on Free Monoids Induced by Closure Operators of a Special Type

Helmut Prodinger, H. Prodinger, 1980, RAIRO Theor. Informatics Appl..

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

Helmut Prodinger, H. Prodinger, 1982, Computing.

The number of distinct values in a geometrically distributed sample

Arnold Knopfmacher, Helmut Prodinger, Margaret Archibald, 2006, Eur. J. Comb..

Approximate counting: an alternative approach

Helmut Prodinger, Peter Kirschenhofer, 1991, RAIRO Theor. Informatics Appl..

Counting Palindromes According to r-Runs of Ones Using Generating Functions

Helmut Prodinger, 2014, J. Integer Seq..

Notes on protected nodes in digital search trees

Helmut Prodinger, Rosena R. X. Du, H. Prodinger, 2012, Appl. Math. Lett..

Digital Search Trees Again Revisited: The Internal Path Length Perspective

Helmut Prodinger, Wojciech Szpankowski, Peter Kirschenhofer, 1994, SIAM J. Comput..

On monotone functions of tree structures

Helmut Prodinger, Friedrich J. Urbanek, H. Prodinger, 1983, Discret. Appl. Math..

A Finite Sum of Products of Binomial Coefficients (C. C. Grosjean)

Helmut Prodinger, Philippe Flajolet, Bruno Salvy, 1993, SIAM Rev..

A result in order statistics related to probabilistic counting

Helmut Prodinger, Peter Kirschenhofer, H. Prodinger, 1993, Computing.

Some analytic techniques for the investigation of the asymptotic behaviour of tree parameters

Helmut Prodinger, 1992, Bull. EATCS.

Complementary Families of the Fibonacci-Lucas Relations

Helmut Prodinger, Ivica Martinjak, 2019, Integers.

Spanning tree formulas and chebyshev polynomials

Helmut Prodinger, Francis T. Boesch, F. Boesch, 1986, Graphs Comb..

Topologies on Free Monoids Induced by Families of Languages

Helmut Prodinger, 1983, RAIRO Theor. Informatics Appl..

Combinatorics of geometrically distributed random variables: run statistics

Arnold Knopfmacher, Helmut Prodinger, Peter J. Grabner, 2003, Theor. Comput. Sci..

Average-Case Analysis of Algorithms - Preface

Helmut Prodinger, Wojciech Szpankowski, W. Szpankowski, 2001, Algorithmica.

Set partitions, words, and approximate counting with black holes

Helmut Prodinger, 2012, Australas. J Comb..

On the variance of the external path length in a symmetric digital trie

Helmut Prodinger, Wojciech Szpankowski, Peter Kirschenhofer, 1989, Discret. Appl. Math..

Unfair permutations

Helmut Prodinger, Carsten Schneider, Stephan G. Wagner, 2011, Eur. J. Comb..

A Tree-Counting Identity: 10781

et al., Helmut Prodinger, Leonard Smiley, 2002, Am. Math. Mon..

The generalized Lilbert matrix

Helmut Prodinger, Emrah Kilic, 2016, Period. Math. Hung..

On the Recursive Depth of Special Tree Traversal Algorithms

Helmut Prodinger, Peter Kirschenhofer, H. Prodinger, 1987, Inf. Comput..

On a Problem of Yekutieli and Mandelbrot about the Bifurcation Ratio of Binary Trees

Helmut Prodinger, H. Prodinger, 1997, Theor. Comput. Sci..

A short proof for a partition identity of Hwang and Wei

Helmut Prodinger, Peter Kirschenhofer, 1984, Discret. Math..

D-records in Geometrically Distributed Random Variables

Helmut Prodinger, 2006, Discret. Math. Theor. Comput. Sci..

Depth and Path Length of Heap Ordered Trees

Helmut Prodinger, 1996, Int. J. Found. Comput. Sci..

Some applications of the q-Rice formula

Helmut Prodinger, 2001, Random Struct. Algorithms.

The Swedish Leader Election Protocol: Analysis and Variations

Guy Louchard, Helmut Prodinger, Conrado Martínez, 2011, ANALCO.

Some Further Results on Digital Search Trees

Helmut Prodinger, Peter Kirschenhofer, 1986, ICALP.

Counting Zeros in Random Walks on the Integers and Analysis of Optimal Dual-Pivot Quicksort pdf

Helmut Prodinger, Clemens Heuberger, Martin Dietzfelbinger, 2016, ArXiv.

The Asymmetric Leader Election Algorithm with swedish stopping: A probabilistic analysis

Guy Louchard, Helmut Prodinger, G. Louchard, 2012, Discret. Math. Theor. Comput. Sci..

Returns, Hills, and t-ary Trees

Helmut Prodinger, 2016, J. Integer Seq..

How to Advance on a Stairway by Coin Flippings

Helmut Prodinger, H. Prodinger, 1993 .

On the altitude of specified nodes in random trees

Helmut Prodinger, 1984, J. Graph Theory.

Mellin Transforms and Asymptotics: Digital Sums

Helmut Prodinger, Philippe Flajolet, Robert F. Tichy, 1994, Theor. Comput. Sci..

Asymptotische Untersuchungen Über Charakteristische Parameter Von SuchbĂumen

Helmut Prodinger, P. Kirschenhofer, 1987 .

Analysis of Hoare's FIND algorithm with Median-of-three partition

Helmut Prodinger, Conrado Martínez, Peter Kirschenhofer, 1997, Random Struct. Algorithms.

Dual-Pivot Quicksort: Optimality, Analysis and Zeros of Associated Lattice Paths

Helmut Prodinger, Clemens Heuberger, Martin Dietzfelbinger, 2019, Comb. Probab. Comput..

How to select a loser

Helmut Prodinger, H. Prodinger, 1993, Discret. Math..

On Minimal Expansions in Redundant Number Systems: Algorithms and Quantitative Analysis

Helmut Prodinger, Clemens Heuberger, C. Heuberger, 2001, Computing.

An Asymptotic Comment on a Paper by Analyti and Pramanik

Helmut Prodinger, 1994, Inf. Process. Lett..

Advanced Problems: 6334-6338

Helmut Prodinger, Harley Flanders, R. Daniel Mauldin, 1981 .

Growing and Destroying Catalan-Stanley Trees

Helmut Prodinger, Benjamin Hackl, H. Prodinger, 2017, Discret. Math. Theor. Comput. Sci..

Digital Search Trees - Further Results on a Fundamental Data Structure

Helmut Prodinger, Wojciech Szpankowski, Peter Kirschenhofer, 1989, IFIP Congress.

On the Height of Derivation Trees

Helmut Prodinger, Friedrich J. Urbanek, Werner Kuich, 1979, ICALP.

The q-Pilbert matrix

Helmut Prodinger, Emrah Kilic, 2012, Int. J. Comput. Math..

Philippe Flajolet's Research in Analysis of Algorithms and Combinatorics

Helmut Prodinger, Wojciech Szpankowski, W. Szpankowski, 1998, Algorithmica.

Towards a More Precise Analysis of an Algorithm to Generate Binary Trees: A Tutorial

Helmut Prodinger, Alois Panholzer, H. Prodinger, 1998, Comput. J..

Fountains, histograms, and q-identities

Helmut Prodinger, Peter Paule, 2003, Discret. Math. Theor. Comput. Sci..

On the Optimality of an Algorithm of Reingold and Supowit

Helmut Prodinger, Peter J. Grabner, 1996, J. Autom. Lang. Comb..

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

Helmut Prodinger, H. Prodinger, 1992, Computing.

Analysis of some statistics for increasing tree families

Helmut Prodinger, Alois Panholzer, 2004, Discret. Math. Theor. Comput. Sci..

The register function for t-ary trees

Helmut Prodinger, Michael Drmota, 2006, TALG.

Some Binomial Sums Involving Absolute Values

Helmut Prodinger, Judy-anne H. Osborn, Richard P. Brent, 2014, J. Integer Seq..

On Ruehr's Identities

Helmut Prodinger, Horst Alzer, 2018, Ars Comb..

Multidimensional Digital Searching and Some New Parameters in Tries

Helmut Prodinger, Wojciech Szpankowski, Peter Kirschenhofer, 1993, Int. J. Found. Comput. Sci..

The path length of random skip lists

Helmut Prodinger, Peter Kirschenhofer, H. Prodinger, 1994, Acta Informatica.

Analysis of linear combination algorithms in cryptography

Helmut Prodinger, Clemens Heuberger, Peter J. Grabner, 2005, TALG.

Language Operators Related to Init

Helmut Prodinger, Friedrich J. Urbanek, 1979, Theor. Comput. Sci..

Lattice Paths, Sampling Without Replacement, and Limiting Distributions

Helmut Prodinger, Alois Panholzer, Markus Kuba, 2009, Electron. J. Comb..

An Identity Conjectured by Lacasse via the Tree Function

Helmut Prodinger, H. Prodinger, 2013, Electron. J. Comb..

Multidimensional Digital Searching-Alternative Data Structures

Helmut Prodinger, Peter Kirschenhofer, 1994, Random Struct. Algorithms.

A Note on the Conjecture of Ramirez and Sirvent

Helmut Prodinger, Emrah Kilic, 2014, J. Integer Seq..

Words, Permutations, and Representations of Numbers

Helmut Prodinger, H. Prodinger, 2001, Developments in Language Theory.

- O-l-SEQUENCES WITHOUT LONG ADJACENT IDENTICAL BLOCKS

Helmut Prodinger, Friedrich J. Urbanek, 1979 .

Solution of a Problem of Yekutieli and Mandelbrot

Helmut Prodinger, H. Prodinger, 1995, LATIN.

On the Balance Property of Patricia Tries: External Path Length Viewpoint

Helmut Prodinger, Wojciech Szpankowski, Peter Kirschenhofer, 1989, Theor. Comput. Sci..

On Stirling Numbers for Complex Arguments and Hankel Contours

Helmut Prodinger, Philippe Flajolet, 1999, SIAM J. Discret. Math..

Summations in Bernoulli's Triangles via Generating Functions

Helmut Prodinger, Kamilla Oliver, 2017, J. Integer Seq..

Combinatorics of Geometrically Distributed Random Variables: Lenght of Ascending Runs

Helmut Prodinger, H. Prodinger, 2000, LATIN.

Average-Case Analysis of Priority Trees: A Structure for Priority Queue Administration

Helmut Prodinger, Alois Panholzer, 1998, Algorithmica.

The average height of the d-th highest leaf of a planted plane tree

Helmut Prodinger, 1986, Networks.

Moves and displacements of particular elements in Quicksort

Helmut Prodinger, Conrado Martínez, 2009, Theor. Comput. Sci..

On a generalization of the dyck-language over a two letter alphabet

Helmut Prodinger, 1979, Discret. Math..

Descendants in heap ordered trees or a triumph of computer algebra

Helmut Prodinger, 1996, Electron. J. Comb..

Visibility problems related to skip lists

Helmut Prodinger, 2018 .

Infinite 0-1-sequences without long adjacent identical blocks

Helmut Prodinger, Friedrich J. Urbanek, H. Prodinger, 1979, Discret. Math..

The analysis of Range Quickselect and related problems☆

Helmut Prodinger, Conrado Martínez, Alois Panholzer, 2011, Theor. Comput. Sci..

Two selection problems revisited

Helmut Prodinger, Peter Kirschenhofer, 1986, J. Comb. Theory, Ser. A.

Further Results on Digital Search Trees

Helmut Prodinger, Peter Kirschenhofer, 1988, Theor. Comput. Sci..

Recursion Depth Analysis for Specail Tree Traversal Algorithms

Helmut Prodinger, Peter Kirschenhofer, H. Prodinger, 1984, ICALP.

Arithmetic of Supersingular Koblitz Curves in Characteristic Three

Roberto Maria Avanzi, Helmut Prodinger, Clemens Heuberger, 2010, IACR Cryptol. ePrint Arch..

On the Analysis of an Algorithm to Generate a Random Cyclic Permutation

Helmut Prodinger, 2002, Ars Comb..

Reductions of binary trees and lattice paths induced by the register function

Helmut Prodinger, Clemens Heuberger, Benjamin Hackl, 2016, Theor. Comput. Sci..

On the analysis of probabilistic counting

Helmut Prodinger, Peter Kirschenhofer, H. Prodinger, 1990 .

A q-analogue of a formula of Hernandez obtained by inverting a result of Dilcher

Helmut Prodinger, H. Prodinger, 1999, Australas. J Comb..

On Redundant tau -Adic Expansions and Non-adjacent Digit Sets

Roberto Maria Avanzi, Helmut Prodinger, Clemens Heuberger, 2006, Selected Areas in Cryptography.

A generating functions approach for the analysis of grand averages for multiple QUICKSELECT

Helmut Prodinger, Alois Panholzer, H. Prodinger, 1998, Random Struct. Algorithms.

Level number sequences for trees

Helmut Prodinger, Philippe Flajolet, P. Flajolet, 1987, Discret. Math..

The -Version of Binary Search Trees: An Average Case Analysis

Helmut Prodinger, H. Prodinger, 2013 .

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

Roberto Maria Avanzi, Helmut Prodinger, Clemens Heuberger, 2006, Algorithmica.

Number of survivors in the presence of a demon

Guy Louchard, Helmut Prodinger, Mark Daniel Ward, 2012, Period. Math. Hung..

A bijection between directed column-convex polyominoes and ordered trees of height at most three

Helmut Prodinger, Emeric Deutsch, Emeric Deutsch, 2003, Theor. Comput. Sci..

A generating function approach to random subgraphs of the n-cycle

Helmut Prodinger, Xavier Gourdon, 1997, Discret. Math..

Sorting algorithms for broadcast communications: mathematical analysis

Helmut Prodinger, Peter J. Grabner, H. Prodinger, 2002, Theor. Comput. Sci..

Carry propagation in signed digit representations

Helmut Prodinger, Clemens Heuberger, C. Heuberger, 2003, Eur. J. Comb..

On the average hyperoscillations of planted plane trees

Helmut Prodinger, Peter Kirschenhofer, H. Prodinger, 1982, Comb..

External Internal Nodes in Digital Search Trees via Mellin Transforms

Helmut Prodinger, 1992, SIAM J. Comput..

Iterative Cutting and Pruning of Planar Trees

Helmut Prodinger, Benjamin Hackl, Sara Kropf, 2017, ANALCO.

Ascending runs of sequences of geometrically distributed random variables: a probabilistic analysis

Guy Louchard, Helmut Prodinger, G. Louchard, 2001, Electron. Notes Discret. Math..

A Simple Card Guessing Game Revisited

Arnold Knopfmacher, Helmut Prodinger, A. Knopfmacher, 2000, Electron. J. Comb..

Combinatorics of geometrically distributed random variables: value and position of large left-to-right maxima

Helmut Prodinger, 2002, Discret. Math..

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

Helmut Prodinger, H. Prodinger, 2011, Discret. Math. Theor. Comput. Sci..

Random 0-1 rectangular matrices: a probabilistic analysis

Guy Louchard, Helmut Prodinger, 2003, Period. Math. Hung..

Level of nodes in increasing trees revisited

Helmut Prodinger, Alois Panholzer, 2007, Random Struct. Algorithms.

Non-repetitive sequences and gray code

Helmut Prodinger, 1983, Discret. Math..

The height of q-Binary Search Trees

Helmut Prodinger, Michael Drmota, 2002, Discret. Math. Theor. Comput. Sci..

The Hamming weight of the non-adjacent-form under various input statistics

Helmut Prodinger, Clemens Heuberger, C. Heuberger, 2007, Period. Math. Hung..

Multiple Quickselect - Hoare's Find Algorithm for Several Elements

Helmut Prodinger, H. Prodinger, 1995, Inf. Process. Lett..

Hypothetical Analyses: Approximate Counting in the Style of Knuth, Path Length in the Style of Flajolet

Helmut Prodinger, 1992, Theor. Comput. Sci..

The height and width of bargraphs

Arnold Knopfmacher, Helmut Prodinger, Charlotte A. C. Brennan, 2015, Discret. Appl. Math..

Continued Fractions Related to (t,q)-Tangents and Variants

Helmut Prodinger, 2011, Electron. J. Comb..

New Multiple Harmonic Sum Identities

Helmut Prodinger, Roberto Tauraso, 2014, Electron. J. Comb..

Application of Smirnov Words to Waiting Time Distributions of Runs

Helmut Prodinger, Clemens Heuberger, Uta R. Freiberg, 2015, Electron. J. Comb..

Bootstrapping and double-exponential limit laws

Helmut Prodinger, Stephan G. Wagner, H. Prodinger, 2015, Discret. Math. Theor. Comput. Sci..

Representations of numbers as ∑k=-nn εkk: A saddle point approach

Guy Louchard, Helmut Prodinger, 2009 .

On the Number of Combinations without a Fixed Distance

Helmut Prodinger, H. Prodinger, 1983, J. Comb. Theory, Ser. A.

Run Statistics for Geometrically Distributed Random Variables (Extended Abstract)

Arnold Knopfmacher, Helmut Prodinger, Peter J. Grabner, 2000, LATIN.

The scientific works of Rainer Kemp (1949-2004)

Helmut Prodinger, Philippe Flajolet, Markus E. Nebel, 2006, Theor. Comput. Sci..

A q -Analogue of the Path Length of Binary Search Trees

Helmut Prodinger, 2001, Algorithmica.

Batcher's odd-even exchange revisited: A generating functions approach

Helmut Prodinger, H. Prodinger, 2016, Theor. Comput. Sci..

ONTHEVARIANCEOFTHEEXTERNALPATHLENGTHIN A SYMMETRIC DIGITAL TRlE

Helmut Prodinger, Wojciech Szpankowski, Peter Kirschenhofer, 1989 .

Ternary Smirnov Words and Generating Functions

Helmut Prodinger, 2018, Integers.

Generalized approximate counting revisited

Guy Louchard, Helmut Prodinger, 2008, Theor. Comput. Sci..

Probabilistic Analysis of Carlitz Compositions

Guy Louchard, Helmut Prodinger, G. Louchard, 2002, Discret. Math. Theor. Comput. Sci..

Words, Dyck Paths, Trees, and Bijections

Helmut Prodinger, H. Prodinger, 2019, Words, Semigroups, and Transductions.

Einige Bemerkungen zu einer Arbeit von W. Knödel über das mittlere Verhalten von on-line-Packungsalgorithmen

Helmut Prodinger, 1985, J. Inf. Process. Cybern..

On Carlitz Compositions

Arnold Knopfmacher, Helmut Prodinger, 1998, Eur. J. Comb..

How to Count Quickly and Accurately: A Unified Analysis of Probabilistic Counting and Other Related Problems

Helmut Prodinger, Wojciech Szpankowski, Peter Kirschenhofer, 1992, ICALP.

Output Sum of Transducers: Limiting Distribution and Periodic Fluctuation

Helmut Prodinger, Clemens Heuberger, Sara Kropf, 2015, Electron. J. Comb..

On the Number of Descendants and Ascendants in Random Search Trees

Helmut Prodinger, Conrado Martínez, Alois Panholzer, 1998, Electron. J. Comb..

The alternating greedy expansion and applications to computing digit expansions from left-to-right in cryptography

Helmut Prodinger, Clemens Heuberger, Xiaoyu Ruan, 2005, Theor. Comput. Sci..

On Combinatorial Identities of Engbers and Stocker

Helmut Prodinger, Horst Alzer, 2017, Integers.

Some Polynomials Related to the Fibonacci Polynomials

Helmut Prodinger, 1994, Bull. EATCS.

Analysis of Summatory Functions of Regular Sequences: Transducer and Pascal's Rhombus

Helmut Prodinger, Clemens Heuberger, Daniel Krenn, 2018, AofA.

On α-greedy expansions of numbers

Helmut Prodinger, Clemens Heuberger, C. Heuberger, 2007, Adv. Appl. Math..

A simple bijection between a subclass of 2-binary trees and ternary trees

Helmut Prodinger, 2009, Discret. Math..

A Short Proof of Carlitzâ€™s Bernoulli Number Identity

Helmut Prodinger, H. Prodinger, 2014, J. Integer Seq..

Bijections for 2-plane trees and ternary trees

Helmut Prodinger, Nancy S. S. Gu, H. Prodinger, 2009, Eur. J. Comb..

Bottom-up mergesort — A detailed analysis

Helmut Prodinger, Wolfgang Panny, H. Prodinger, 1995, Algorithmica.

An Asymptotic Study of a Recursion Occurring in the Analysis of an Algorithm on Broadcast Communication

Helmut Prodinger, Peter J. Grabner, H. Prodinger, 1998, Inf. Process. Lett..

Digital search trees and basic hypergeometric functions

Helmut Prodinger, 1995, Bull. EATCS.

Counting Ascents in Generalized Dyck Paths

Helmut Prodinger, Clemens Heuberger, Benjamin Hackl, 2018, AofA.

A Combinatorial and Probabilistic Study of Initial and End Heights of Descents in Samples of Geometrically Distributed Random Variables and in Permutations

Guy Louchard, Helmut Prodinger, G. Louchard, 2007, Discret. Math. Theor. Comput. Sci..

On Some Parameters in Heap Ordered Trees

Helmut Prodinger, Alois Panholzer, Kate Morris, 2004, Comb. Probab. Comput..

The first descent in samples of geometric random variables and permutations

Arnold Knopfmacher, Helmut Prodinger, A. Knopfmacher, 2006, Discret. Math. Theor. Comput. Sci..

An online bin-packing problem with an underlying ternary structure

Helmut Prodinger, 2021 .

`Average-Case'-Analysis of Algorithms (Dagstuhl Seminar 9527)

Helmut Prodinger, Philippe Flajolet, Robert Sedgewick, 2021 .

"Average-Case"-Analysis of Algorithms (Dagstuhl Seminar 9328)

Helmut Prodinger, Philippe Flajolet, Rainer Kemp, 2021 .

Combinatorics on lattice paths in strips

Helmut Prodinger, Nancy S. S. Gu, Nancy S.S. Gu, 2020, Eur. J. Comb..

`Average-Case'-Analysis of Algorithms (Dagstuhl Seminar 9728)

Helmut Prodinger, Philippe Flajolet, Hosam M. Mahmoud, 2021 .

Partial sums of Horadam sequences: sum-free representations via generating functions

Helmut Prodinger, 2021 .

Skew Dyck paths with catastrophes

Helmut Prodinger, 2022 .

Lattice paths with infinitely many down steps -- the negative boundary model

Helmut Prodinger, 2021 .

One level summations for powers of Fibonacci and Lucas polynomials

Helmut Prodinger, 2021 .

Multi-edge trees and 3-coloured Motzkin paths: bijective issues

Helmut Prodinger, 2021 .

Skew Dyck paths having no peaks at level 1

Helmut Prodinger, 2022 .

Kn\"odel walks in a B\"ohm-Hornik environment

Helmut Prodinger, 2021 .

A matrix with sums of Catalan numbers -- LU-decomposition and determinant

Helmut Prodinger, 2021 .

A walk in my lattice path garden

Helmut Prodinger, H. Prodinger, 2021, 2111.14797.

Philippe Flajolet's early work in combinatorics

Helmut Prodinger, H. Prodinger, 2021, Enumerative Combinatorics and Applications.

Partial skew Dyck paths---a kernel method approach

Helmut Prodinger, 2021 .

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

Helmut Prodinger, 2021 .

Weighted unary-binary trees, Hex-trees, marked ordered trees, and related structures

Helmut Prodinger, H. Prodinger, 2021, 2106.14782.

Counting ternary trees according to the number of middle edges and factorizing into (3/2)-ary trees

Helmut Prodinger, 2022, Asian-European Journal of Mathematics.

The amplitude of Motzkin paths

Helmut Prodinger, 2021 .

A bijection between two subfamilies of Motzkin paths

Helmut Prodinger, Nancy S.S. Gu, 2021, Applicable Analysis and Discrete Mathematics.

Binary search tree recursions with harmonic toll functions

Helmut Prodinger, Alois Panholzer, H. Prodinger, 2002 .

Variants of the Filbert Matrix

Helmut Prodinger, Emrah Kilic, 2013 .

Positional number systems with digits forming an arithmetic progression

Helmut Prodinger, Clemens Heuberger, Stephan Wagner, 2008 .

On a Constant Arising in the Analysis of Bit Comparisons in Quickselect

Helmut Prodinger, Peter J. Grabner, 2008 .

Asymptotic analysis of the moments of the Cantor distribution

Helmut Prodinger, Peter J. Grabner, H. Prodinger, 1996 .

The Matrix of Super Patalan Numbers and its Factorizations

Helmut Prodinger, Emrah Kilic, H. Prodinger, 2017 .

Representing derivatives of Chebyshev polynomials by Chebyshev polynomials and related questions

Helmut Prodinger, H. Prodinger, 2016, 1609.01898.

Do we really need to balance patricia tries

Helmut Prodinger, Wojciech Szpankowski, Peter Kirschenhofer, 1988 .

A generalisation of a Filbert matrix with three additional parameters

Helmut Prodinger, 2010 .

Zur Auswertung Gewisser Numerischer Reihen Mit Hilfe Modularer Funktionen

Helmut Prodinger, H. Prodinger, Peter Kirschenhofer, 1987 .

Analysis of a splitting process arising in probabilistic counting and other related algorithms

Helmut Prodinger, Wojciech Szpankowski, Peter Kirschenhofer, 1996 .

The Pills Problem Revisited

Helmut Prodinger, Charlotte Brennan, 2003 .

ASYMMETRIC GENERALIZATIONS OF THE FILBERT MATRIX AND VARIANTS

Helmut Prodinger, Emrah Kilic, 2014 .

On the Variance of the External Path Length in a Binary Digital Trie

Helmut Prodinger, Wojciech Szpankowski, Peter Kirschenhofer, 1987 .

On the shape of the fringe of various types of random trees

Helmut Prodinger, Michael Drmota, Alois Panholzer, 2009 .

On the Number of Partitions of { 1, …, n} into Two Sets of Equal Cardinalities and Equal Sums

Helmut Prodinger, 1982, Canadian Mathematical Bulletin.

Fringe analysis of plane trees related to cutting and pruning

Helmut Prodinger, Clemens Heuberger, Benjamin Hackl, 2017, Aequationes mathematicae.

Spanning tree size in random binary search trees

Helmut Prodinger, Alois Panholzer, H. Prodinger, 2004, math/0405292.

Über Einige Funktionaldifferentialgleichungen Aus Der Analyse Von Algorithmen

Helmut Prodinger, H. Prodinger, Peter Kirschenhofer, 1987 .

Computer-free evaluation of an infinite double sum

Helmut Prodinger, Alois Panholzer, H. Prodinger, 2005 .

The Asymmetric Leader Election Algorithm: Another Approach

Guy Louchard, Helmut Prodinger, 2009 .

Order statistics for the Cantor-Fibonacci distribution

Helmut Prodinger, Ligia-Loretta Cristea, 2007 .

Records in geometrically distributed words: Sum of positions

Helmut Prodinger, 2008 .

Asymptotic analysis of a class of functional equations and applications

Helmut Prodinger, Robert F. Tichy, Peter J. Grabner, 1993 .

THE HIGHER MOMENTS OF THE NUMBER OF RETURNS OF A SIMPLE RANDOM WALK

Helmut Prodinger, Peter Kirschenhofer, 1994 .

Ordered Fibonacci Partitions

Helmut Prodinger, 1983, Canadian Mathematical Bulletin.

The Number of Inversions in Permutations: A Saddle Point Approach

Guy Louchard, Helmut Prodinger, John Knopfmacher, 2003 .

Analysis of Alternative Digit Sets for Nonadjacent Representations

Helmut Prodinger, Clemens Heuberger, C. Heuberger, 2006 .

The reciprocal super Catalan matrix

Helmut Prodinger, 2015 .

FIBONACCI NUMBERS OF GRAPHS: II

Helmut Prodinger, Robert F. Tichy, Peter Kirschenhofer, 1983 .

The generalized q-Pilbert matrix

Helmut Prodinger, Emrah Kiliç, 2014 .

The largest missing value in a composition of an integer and some Allouche-Shallit-type identities

Guy Louchard, Helmut Prodinger, G. Louchard, 2013 .

Padé approximations to the logarithm II: Identities, recurrences, and symbolic computation

Helmut Prodinger, Carsten Schneider, Kathy Driver, 2006 .

A generating functions approach for the analysis of grand averages for multiple QUICKSELECT

Helmut Prodinger, Alois Panholzer, 1998 .

Subblock Occurrences in Positional Number Systems and Gray code Representation

Helmut Prodinger, Peter Kirschenhofer, H. Prodinger, 1984 .

Ober Die Ziffernsumme Natorlicher Zahlen Und Verwandte Probleme

Helmut Prodinger, Peter Kirschenhofer, Robert F. Tichy, 1985 .

Minimal and maximal plateau lengths in Motzkin paths

Helmut Prodinger, Stephan G. Wagner, Stephan Wagner, 2007 .

A Generalized Filbert Matrix

Helmut Prodinger, Emrah Kilic, 2010 .

Counting optimal joint digit expansions.

Helmut Prodinger, Clemens Heuberger, Peter J. Grabner, 2005 .

An analytic approach for the analysis of rotations in fringe-balanced binary search trees

Helmut Prodinger, Alois Panholzer, H. Prodinger, 1998 .

Formulas for Fibonomial sums with generalized Fibonacci and Lucas coefficients

Helmut Prodinger, Emrah Kilic, Hideyuki Ohtsuka, 2011 .

Fibonacci Numbers of Graphs III: Planted Plane Trees

Helmut Prodinger, Robert F. Tichy, Peter Kirschenhofer, 1986 .

ON BINARY REPRESENTATIONS OF INTEGERS WITH DIGITS-1 , 0 , 1

Helmut Prodinger, 2000 .

A coin tossing algorithm for counting large numbers of events

Helmut Prodinger, Peter Kirschenhofer, 1992 .

Generalized Reciprocity Laws for Sums of Harmonic Numbers

Helmut Prodinger, Carsten Schneider, Markus Kuba, 2008 .

Padé approximations to the logarithm III: Alternative methods and additional results

Helmut Prodinger, Carsten Schneider, Kathy Driver, 2006 .

The number of elements close to near-records in geometric samples

Guy Louchard, Helmut Prodinger, 2006 .

89.44 A curious identity proved by Cauchy’s integral formula*

Helmut Prodinger, H. Prodinger, 2005, The Mathematical Gazette.

Advancing in the presence of a demon

Guy Louchard, Helmut Prodinger, G. Louchard, 2008 .

On binary representations of integers with digits .

Helmut Prodinger, 2000 .

Moments of distributions related to digital expansions

Helmut Prodinger, Ligia L. Cristea, H. Prodinger, 2006 .