Helmut Prodinger — Publications

Of course, the older papers are not available as TeX-Files. However, I try to collect as many information on them as I can.
My first TeX-Files are AmSTeX-Files, then I switched to AmSLateX. Some files are Latex-Files. The responsibility for that choice comes from my coauthors.
I did not find the last version in all cases. Also, several graphics are not present.
In case that something does not work, please send me email. I have not tested all the entries.

If you prefer this, you might go to Papers by subjects. However, these lists won't be regularly updated. A list of all the journals in which I published (as of March 1998) is here. A list of all my coauthors (as of March 1998) is here.

Chronological List (-2010)

1979

Language operators related to init H. Prodinger and F.J. Urbanek, Theoretical Computer Science, 8:161-175, 1979. pdf
On a generalization of the Dyck-language over a two letter alphabet H. Prodinger, Discrete Mathematics, 28:269-276, 1979. pdf
Infinite 0-1-sequences without long adjacent identical blocks H. Prodinger and F.J. Urbanek, Discrete Mathematics, 28:277-289, 1979. pdf
On the height of derivation trees W. Kuich, H. Prodinger and F.J. Urbanek, Automata, Languages and Programming, volume 71, pages 370-384, 1979.

1980

On the interpolation of D0L-sequences H. Prodinger, Theoretical Computer Science, 10:107-108, 1980.pdf
Congruences defined by languages and filters H. Prodinger, Information and Control, 44:36-46, 1980.pdf
Topologies on free monoids defined by closure operators of a special type H. Prodinger, RAIRO Theoretical Informatics and Applications, 14:225-237, 1980. pdf
The average height of a stack where three operations are allowed and some related problems H. Prodinger, Journal of Combinatorics, Information and System Sciences, 5:287-304, 1980. pdf

1981

On the number of Fibonacci partitions of a set, H. Prodinger, The Fibonacci Quarterly, 19:463-466, 1981. pdf
On the average height of monotonically labelled binary trees, P. Kirschenhofer and H. Prodinger, Finite and Infinite Sets, volume 37, pages 509-526, North-Holland, 1981, Proceedings of Janos Bolyai Conference on Combinatorics Eger (Hungary). pdf

1982

Generalizing the sum of digits function, H. Prodinger, SIAM Journal on Algebraic and Discrete Methods, 3:35-42, 1982. pdf
Fibonacci numbers of graphs, H. Prodinger and R.F. Tichy, The Fibonacci Quarterly, 9:16-21, 1982. pdf
A note on a result of R. Kemp on r-tuply rooted planted plane trees, H. Prodinger, Computing, 28:363-366, 1982. pdf
On the average oscillation of the contour of monotonically labelled ordered trees P. Kirschenhofer and H. Prodinger, Proceedings of the Second World Conference on Mathematics at the Service of Man (Las Palmas), pages 394-399, 1982. pdf
On the average hyperoscillations of planted plane trees P. Kirschenhofer and H. Prodinger, Combinatorica, 2:177-186, 1982. pdf
On the number of partitions of {1,...,N} into two sets of equal cardinalities and equal sums H. Prodinger, Canadian Mathematical Bulletin, 25:238-241, 1982. pdf

1983

Non-repetitive sequences and Gray code, H. Prodinger, Discrete Mathematics, 43:113-116, 1983. pdf
Ordered Fibonacci partitions, H. Prodinger, Canadian Mathematical Bulletin, 26:312-316, 1983. pdf
Fibonacci numbers of graphs II, P. Kirschenhofer, H. Prodinger and R.F. Tichy, The Fibonacci Quarterly, 21:219-229, 1983. pdf
Topologies over free monoids induced by families of languages, H. Prodinger, ( pdf. ) RAIRO Theoretical Informatics and Applications, 17:285-290, 1983.
Towards a general concept of hypercodes, H. Prodinger and G. Thierrin, Journal of Information and Optimization Sciences, 4:255-268, 1983.
A correspondence between ordered trees and noncrossing partitions, H. Prodinger Discrete Mathematics. 46:205-206, 1983. pdf
On the number of combinations without a fixed distance, H. Prodinger, Journal of Combinatorial Theory, Series A, 35:362-365, 1983. pdf
A subword version of d'Ocagne's formula H. Prodinger, Utilitas Mathematica, 24:125-129, 1983. pdf
An elementary approach to the stack size of regularly distributed binary trees, H. Prodinger, Soochow Journal of Mathematics, 9:193-196, 1983. pdf
The height of planted plane trees revisited H. Prodinger, Ars Combinatoria, 16-B:51-55, 1983. pdf
Abzählprobleme bei Bäumen H. Prodinger, editors: G.Baron and P. Kirschenhofer, Publications de l'IRMA (Strassbourg), pages 167-173, 1983.
Über ein zahlentheoretisches Problem aus der Informatik H. Prodinger and R.F. Tichy, Sitzungsberichte der Österreichischen Akademie der Wissenschaften, Abteilung II, 192:385-396, 1983.
Representations of 0 as a weighted sum of the numbers -n,..,n H. Prodinger, Journal of Combinatorics, Information and System Sciences, 8:271-276, 1983.
Quelques techniques analytiques pour l'etude asymptotique des parametres dans les arbres H. Prodinger, In Sommerschule Ile de R e (Vortragsausarbeitung), English version in EATCS Bulletin, 47 (1992), 180-199, 1983.
On monotone functions of tree structures H. Prodinger and F.J.Urbanek, Discrete Applied Mathematics, 5:223-239, 1983.

1984

Recursion depth analysis for special tree traversal algorithms P. Kirschenhofer and H. Prodinger, editor: J. Paradaens, Automata, Languages and Programming, volume 172 of Lecture Notes in Computer Science, pages 303-311, 1984. pdf
Analysis of an algorithm to construct Fibonacci partitions H. Prodinger, RAIRO Theoretical Informatics and Applications, 18:387-394, 1984.
On the altitude of specified nodes in random trees H. Prodinger, Journal of Graph Theory, 8:481-485, 1984.
The average height of the second highest leaf of a planted plane tree H. Prodinger, European Journal of Combinatorics, 5:351-357, 1984. pdf
A short proof for a partition identity of Hwang and Wei. P. Kirschenhofer and H. Prodinger, Discrete Mathematics, 52:305-306, 1984. pdf
On the number of partitions of {1,...,n} into r sets of equal cardinalities and sums. H. Prodinger, Tamkang Journal of Mathematics, 15:161-164, 1984. pdf
Eine Bemerkung zum asymptotischen Verhalten der höheren Momente der Anzahl der Inversionen. H. Prodinger, Anzeiger der Österreichischen Akademie der Wissenschaften, 121:141-143, 1984. pdf
Subblock occurrences in positional number systems and Gray code representation. P. Kirschenhofer and H. Prodinger, Journal of Information and Optimization Sciences, 5:29-42, 1984. pdf

1985

Die Bestimmung gewisser Parameter von binären Bäumen mit Hilfe analytischer Methoden. H. Prodinger, Zahlentheoretische Analysis, editor: E. Hlawka, of volume 1114 of Lecture Notes in Mathematics, pages 118-133, 1985.
Über die Ziffernsumme natürlicher Zahlen und verwandte Probleme. P. Kirschenhofer, H. Prodinger and R.F. Tichy, Zahlentheoretische Analysis, editor: E. Hlawka, volume 1114 of Lecture Notes in Mathematics, pages 55-65, 1985.
Einige Bemerkungen zu einer Arbeit von W. Knödel über das mittlere Verhalten von on-line Packungsalgorithmen. H. Prodinger, EIK, 21:3-7, 1985. pdf
The number of spanning trees in the square of a cycle. G. Baron, F.T. Boesch, H. Prodinger, R.F. Tichy and J.F. Wang, The Fibonacci Quarterly, 23:258-264, 1985.
The average height of the d-th highest leaf of a planted plane tree. H. Prodinger, Networks, 16:67-75, 1985.
The expected height of paths for several notions of height. W. Panny and H. Prodinger, Studia Scientiarum Mathematicarum Hungarica, 20:119-132, 1985. pdf

1986

Register allocation for unary-binary trees. P. Flajolet and H. Prodinger, SIAM Journal on Computing, 15:629-640, 1986 pdf
Fibonacci numbers of graphs III. P. Kirschenhofer, H. Prodinger and R.F. Tichy, Proceedings of the First International Conference on Fibonacci Numbers and Applications, pages 105-120. D. Reidel, 1986.
Two selection problems revisited. P. Kirschenhofer and H. Prodinger, Journal of Combinatorial Theory Series, A 42:310-316, 1986 pdf
Some further results on digital search trees, P. Kirschenhofer and H. Prodinger, Automata, Languages and Programming, volume 229 of Lecture Notes in Computer Science, pages 177-185, 1986 pdf
Spanning tree formulas and Chebyshev polynomials, F.T. Boesch and H. Prodinger, Graphs and Combinatorics, 2:191-200, 1986.pdf

1987

Some recent results on the register function of a binary tree, H. Prodinger, Annals of Discrete Mathematics, 33:241- 260, 1987 pdf
A contribution to the analysis of in situ permutation, P. Kirschenhofer, H. Prodinger and R.F. Tichy, Glasnik Mathematicki, 22(42):269-278, 1987 pdf
Level number sequences for trees, P. Flajolet and H. Prodinger, Discrete Mathematics, 65:149-156, 1987 pdf
On the recursion depth of special tree traversal algorithms, P. Kirschenhofer and H. Prodinger, Information and Computation, 74:15-32, 1987 pdf
Über längste 1-Teilfolgen in 0-1-Folgen H. Prodinger, Zahlentheoretische Analysis II, editor: E. Hlawka, volume 1262 of Lecture Notes in Mathematics, pages 124-133, 1987. pdf
Asymptotische Untersuchungen über charakteristische Parameter von Suchbäumen, P. Kirschenhofer and H. Prodinger. Zahlentheoretische Analysis II, Ed. Hlawka, editor, volume 1262 of Lecture Notes in Mathematics, pages 93-107, 1987 pdf
Zur Auswertung gewisser numerischer Reihen mit Hilfe modularer Funktionen. P. Kirschenhofer, H. Prodinger und J. Schoissengeier, editor: E. Hlawka, Zahlentheoretische Analysis II, volume 1262 of Lecture Notes in Mathematics, pages 108-110, 1987 pdf
Über einige Funktional-Differentialgleichungen in der Analyse von Algorithmen. P. Kirschenhofer, H. Prodinger and R.F. Tichy, editor: E. Hlawka, Zahlentheoretische Analysis II, volume 1262 of Lecture Notes in Mathematics, pages 111-123, 1987 pdf

1988

Further results on digital search trees. P. Kirschenhofer and H. Prodinger, Theoretical Computer Science, 58:143-154, 1988 pdf
Do we really need to balance Patricia tries? P. Kirschenhofer, H. Prodinger and W. Szpankowski, Lecture Notes in Computer Science, volume 317 of Automata, Languages and Programming, pages 302-316, 1988 pdf
b-tries: a paradigm for the application of numbertheoretic methods in the analysis of algorithms. P. Kirschenhofer and H. Prodinger In Contributions to General Algebra, volume 6, pages 141-153. Hölder-Pichler-Tempsky-Teubner, 1988 pdf
Eine Anwendung der Theorie der Modulfunktionen in der Informatik. P. Kirschenhofer and H. Prodinger. Sitzungsberichte der Österreichischen Akademie der Wissenschaften, 197:339-366, 1988 pdf

1989

On the balance property of patricia tries: External path length view. P. Kirschenhofer, H. Prodinger and W. Szpankowski, Theoretical Computer Science, 68:1-17, 1989 pdf
Digital search trees - further results on a fundamental data structure. P. Kirschenhofer, H. Prodinger and W. Szpankowski, editor: G.X. Ritter, Information Processing 89, 443-447, 1989. pdf
On the variance of the external path length in a symmetric digital trie. P. Kirschenhofer, H. Prodinger and W. Szpankowski, Discrete Applied Mathematics, 25:129-143, 1989pdf

1990

On the analysis of probabilistic counting. P. Kirschenhofer and H. Prodinger, editors: E. Hlawka and R.F. Tichy, Number-theoretic Analysis, volume 1452 of Lecture Notes in Mathematics, pages 117-120, 1990 pdf
Further results on a problem of Knödel concerning the analysis of bin-packing. H. Prodinger, editors: E. Hlawka and R.F. Tichy Number-theoretic Analysis, volume 1452 of Lecture Notes in Mathematics, pages 193-198, 1990.

1991

On some applications of formulae of Ramanujan in the analysis of algorithms. P. Kirschenhofer and H. Prodinger, Mathematika, 38:14-33, 1991 pdf
Approximate counting: An alternative approach. P. Kirschenhofer and H. Prodinger, RAIRO Theoretical Informatics and Applications, 25:43-48, 1991.

1992

Hypothetic analyses: Approximate counting in the style of Knuth, path length in the style of Flajolet. H. Prodinger, Theoretical Computer Science, 100:243-251, 1992.
Einige Bemerkungen zu einer Bin-Packing Aufgabe von W. Knödel. H. Prodinger, Computing, 47:247-254, 1992.
How to count quickly and accurately: A unified analysis of probabilistic counting and other related problems. P. Kirschenhofer, H. Prodinger and W. Szpankowski, editor: W. Kuich, Automata, Languages and Programming, volume 623 of Lecture Notes in Computer Science, pages 211-222, 1992.
Probabilistic modeling of data structures on words. P. Kirschenhofer, H. Prodinger and W. Szpankowski. Theoretical Computer Science, 106:395-400, 1992.
A coin tossing algorithm for counting large numbers of events. P. Kirschenhofer and H. Prodinger, Mathematica Slovaca, 42:531-545, 1992 pdf
External internal nodes in digital search trees via Mellin transforms. H. Prodinger, SIAM Journal on Computing, 21:1180-1183, 1992.

1993

Multidimensional digital searching and some new parameters in tries. P. Kirschenhofer, H. Prodinger and W. Szpankowski, International Journal of Foundations of Computer Science, 4:69-84, 1993.
How to select a loser H. Prodinger, Discrete Mathematics, 120:149-159, 1993.
A result in order statistics related to probabilistic counting. P. Kirschenhofer and H. Prodinger, Computing, 51:15-27, 1993 pdf
How to advance on a stairway by coin flippings. H. Prodinger, Proceedings "Applications of Fibonacci Numbers", volume 5, pages 473-479. Kluwer, 1993.
On the moments of the sum of digits function. P. Grabner, P. Kirschenhofer, H. Prodinger and R. Tichy, Proceedings "Applications of Fibonacci Numbers", volume 5, pages 263-271. Kluwer, 1993pdf
A note on binomial recurrences arising in the analysis of algorithms (letter to the editor). H. Prodinger and W. Szpankowski, Information Processing Letters, 46:309-311, 1993.
Combinatorial problems of geometrically distributed random variables and applications in computer science. H. Prodinger, editors: V. Strehl and R. König, Publications de l'IRMA (Strassbourg), volume 30, pages 87-95, 1993.
Asymptotic analysis of a class of functional equations and applications. P. Grabner, H. Prodinger and R.F. Tichy, Journal de Theorie des Nombres de Bordeaux, 5:365-381, 1993.

1994

Digital search trees again revisited: The internal path length perspective. P. Kirschenhofer, H. Prodinger and W. Szpankowski, SIAM Journal on Computing, 23:598-616, 1994.
The path length of random skip lists. P. Kirschenhofer and H. Prodinger, Acta Informatica, 31:775-792, 1994 pdf
The Fibonacci killer. P.Grabner and H. Prodinger, The Fibonacci Quarterly, 32:389-396, 1994.
Some information about the binomial transform. H. Prodinger, The Fibonacci Quarterly, 32:412-415, 1994.
The higher moments of the number of returns of a simple random walk. P. Kirschenhofer and H. Prodinger, Advances in Applied Probability, 26:561-563, 1994 pdf
An asymptotic comment on a paper by Analyti and Pramanik. H. Prodinger, Information Processing Letters, 49:327-328, 1994.
Mellin transforms and asymptotics: Digital sums P. Flajolet, P. Grabner, P. Kirschenhofer, H. Prodinger and R.F. Tichy, Theoretical Computer Science, 123:291-314, 1994.
Multidimensional searching - alternative data structures, P. Kirschenhofer and H. Prodinger, Random Structures and Algorithms, 5:123-134, 1994.
Some polynomials related to the Fibonacci polynomials, H. Prodinger, EATCS Bulletin, 53:248-250, 1994.
Knuth's old sum - a survey, H. Prodinger, EATCS Bulletin, 54:232-245, 1994.
Approximate counting via Euler transform H. Prodinger, Mathematica Slovaka, 44:569-574, 1994.

1995

On Ramanujan's Q(n)-function. P. Flajolet, P. Grabner, P. Kirschenhofer and H. Prodinger, Journal of Computational and Applied Mathematics, 58:103-116, 1995.
Geometric distributions and forbidden subwords. H. Prodinger, The Fibonacci Quarterly, 33:139-141, 1995.
Comments on the analysis of parameters in a random graph model. H. Prodinger, RAIRO Theoretical Informatics and Applications, 29:245-253, 1995.
Bottom-up mergesort: A detailed analysis. W. Panny and H. Prodinger, Algorithmica, 14:340-354, 1995.
Analysis of an optimized search algorithm for skip lists. P. Kirschenhofer, C. Martinez and H. Prodinger, Theoretical Computer Science, 144:199-220, 1995.
Special volume on the mathematical analysis of algorithms. H. Prodinger and W. Szpankowski (eds.), Theoretical Computer Science, 144, 1995.
Solution of a problem of Yekutieli and Mandelbrot. H. Prodinger, editors: R. Baeza, E. Goles and P. V. Poblete, LATIN 95, volume 911 of, Lecture Notes in Computer Science, pages 461-468, 1995.
Digital search trees and basic hypergeometric functions. H. Prodinger, EATCS Bulletin, 56:112-115, 1995.
Multiple quickselect - Hoare's find algorithm for several elements. H. Prodinger, Information Processing Letters, 56:123-129, 1995.

1996

The asymptotic behavior of the golden numbers. H. Prodinger, The Fibonacci Quarterly 34 (1996), 224-225.
Explicit and asymptotic formulae for average values of order statistics of the Cantor distribution. A. Knopfmacher and H. Prodinger, Statistics and Probability Letters 27 (1996), 189-194.
The number of winners in a discrete geometrically distributed sample. P. Kirschenhofer and H. Prodinger, Annals in Applied Probability 6 (1996), 687-694. Addendum: Annals of Applied Probability 8 (1998), 647 pdf
Asymptotic analysis of the moments of the Cantor distribution. P. Grabner and H. Prodinger, Statistics and Probability Letters 26 (1996), 243-248 .
Combinatorics of geometrically distributed random variables: Left-to-right maxima. H. Prodinger, Discrete Mathematics 153 (1996), 253-270.
Asymptotics of the Luria-Delbrueck distribution via singularity analysis. H. Prodinger, Journal of Applied Probability 33 (1996), 282-283.
Analysis of a splitting process arising in probabilistic counting and other related algorithms. P. Kirschenhofer, H. Prodinger and W. Szpankowski, Random Structures and Algorithms 9 (1996), 379-402 .
Depth and path length of heap ordered trees. H. Prodinger, International Journal of Foundations of Computer Science 7 (1996), 293-299 .
Return statistics of simple random walks. P. Kirschenhofer and H. Prodinger, Statistical Planning and Inference 54 (1996), 67-74. .
The optimality of an algorithm of Reingold and Supowit P.Grabner and H. Prodinger, Journal of automata, languages, and combinatorics 1 (1996), 5-11.
Simplification of two papers of Ferri, Faccio, and D'Amico H. Prodinger, http://www.wits.ac.za/~prodinger/index.htm, 1996.
Explicit Formulae for some Numerical Triangles of Z. W. Trzaska H. Prodinger, http://www.wits.ac.za/~prodinger/index.htm, 1996.
Descendants in heap ordered trees - or - a triumph of computer algebra H. Prodinger, Electronic Journal of Combinatorics 3 (1996), #R29 (9 pages).
A note on the distribution of the three types of nodes in uniform binary trees H. Prodinger, Seminaire Lotharingien de Combinatoire, Vol. 38 (1996), #2, 5 pages.
A bijection between coloured trees and set partitions H. Prodinger, http://www.wits.ac.za/~prodinger/index.htm 1996.
The level of nodes in heap ordered trees H. Prodinger, http://www.wits.ac.za/~prodinger/index.htm 1996.

1997

A generating function approach to random subgraphs of the n-cycle. X. Gourdon and H. Prodinger, Discrete Mathematics 169 (1997), 227-232.
On a question of Cooper and Kennedy. H. Prodinger, The Fibonacci Quarterly 35 (1997),135-136.
Maximum statistics of random variables distributed by the negative binomial distribution. P.Grabner and H. Prodinger, Combinatorics, Probability, and Computing 6 (1997), 179-184.
Analysis of Hoare's find algorithm with median-of-three partition. P. Kirschenhofer, C. Martinez and H. Prodinger, Random Structures and Algorithms 10 (1997), 143-156.
On a problem of Yekutieli and Mandelbrot about the bifurcation ratio of binary trees. H. Prodinger, Theoretical Computer Science 181 (1997), 181-194.
Descendants and ascendants in binary trees A. Panholzer and H. Prodinger, Discrete Mathematics and Theoretical Computer Science 1 (1997), 247-266.

1998

The sum-of-digits function for complex bases. P. Grabner, P. Kirschenhofer and H. Prodinger, J. London Math. Soc. 57 (1998), 20-40pdf
Comparisons in Hoare's Find algorithm. P. Kirschenhofer and H. Prodinger, Combinatorics, Probability, and Computing 7 (1998), 111-120.
The Cantor-Fibonacci distribution. H. Prodinger, Applications of Fibonacci numbers 7(1998), 311-318, Kluwer.
Descendants and ascendants in random search trees. C. Martinez, A. Panholzer, and H. Prodinger, Electronic Journal of Combinatorics 5(1998), R20; 29 pages + Appendix (10 pages).
Combinatorial sums in the analysis of a generalized van der Pol equation. H. Prodinger, Maple Technical Newsletter 5 (1998), 33-36. 1998.
An asymptotic study of a recursion occurring in the analysis of an algorithm on broadcast communication P. Grabner and H. Prodinger, Information Processing Letters 65 (1998), 89-93.
A generating functions approach for the analysis of grand averages for Multiple Quickselect A. Panholzer and H. Prodinger, Random Structures and Algorithms 13 (1998), 189-209 .
On Carlitz compositions A. Knopfmacher and H. Prodinger, European Journal of Combinatorics 19 (1998), 579-589.
Average Case-Analysis of Priority trees: A structure for priority queue administration A. Panholzer and H. Prodinger, Algorithmica 22 (1998),600-630.
Towards a more precise analysis of an algorithm to generate binary trees : A tutorial A. Panholzer and H. Prodinger, The Computer Journal 41 (1998), 201-204.
An analytic approach for the analysis of rotations in fringe-balanced binary search trees A. Panholzer and H. Prodinger, Annals of Combinatorics 2 (1998), 173-184.
Special issue on Average-Case on Algorithms. H. Prodinger and W. Szpankowski, Algorithmica 22 (1998), 363-690. ; Preface: 363-365.
Philippe Flajolet's research in Combinatorics and Analysis of Algorithms H. Prodinger and W. Szpankowski, Algorithmica 22 (1998), 366-387.

1999

On Stirling numbers for complex arguments and Hankel contours. P. Flajolet and H. Prodinger, SIAM Journal on Discrete Mathematics 12 (1999), 155-159.
Epidemics with two levels of mixing: The exact moments H. Prodinger, SADIO 2 (1999), 1-4.

2000

A bijective proof of an identity concerning nodes of fixed degree in planted plane trees J. Moon and H. Prodinger, Ars Combinatoria 55 (2000),91-92. pdf
Two proofs of Filipponi's formula for Lucas numbers of odd index A. Panholzer and H. Prodinger, The Fibonacci Quarterly 38 (2000), 165-166.
Combinatorics of geometrically distributed random variables: Run statistics, P. Grabner, A. Knopfmacher and H. Prodinger, extended abstract in LATIN 2000, Lecture Notes in Computer Science 1776 (2000), 457-462, full version in Theoretical Computer Science.
On Cantor's singular moments, H. Prodinger, Southwest Journal of Pure and Applied Mathematics, 2000, Issue 1 (electronic), http://rattler.cameron.edu/swjpam/vol1-00.html.
A q-analogue of a formula of Hernandez obtained by inverting a result of Dilcher , H. Prodinger, Australasian Journal of Combinatorics 21 (2000), 271-274
Combinatorics of geometrically distributed random variables: Length of ascending runs, H. Prodinger, LATIN 2000, Lecture Notes in Computer Science 1776 (2000), 473-482.
Combinatorics of geometrically distributed random variables: New q-tangent and q-secant numbers, H. Prodinger, International Journal of Mathematics and Mathematical Sciences 24 (2000), 825-838.
On binary representations of integers with digits -1, 0, 1 H. Prodinger, INTEGERS 0 (2000), paper A08 (14 pages).
Schur's determinants and Partition Theorems M. Ismail, H. Prodinger, and D. Stanton Séminaire Lotharingien Combin. 44 (2000), paper B44a, 10 pp.

2001

Kirkman's hypothesis revisited A. Panholzer, and H. Prodinger, INTEGERS 1 (2001), paper A05 (3 pages).
q-Engel Series Expansions and Slater's Identities G. Andrews, A. Knopfmacher, P.Paule, and H. Prodinger, Quaestiones Mathematicae 24 (2001), 403-416.
Special Issue in Algorithmica, Mathematical Analysis of Algorithms, Algorithmica, Volume 29, Number 1/2, 369 pages, H. Prodinger and W. Szpankowski, Preface: Algorithmica 29 (2001), 1-2
Partial match queries in relaxed multidimensional search trees C. Martinez, A. Panholzer, and H. Prodinger, Algorithmica 29 (2001), 181-204.
Combinatorics of geometrically distributed random variables: Value and position of the r-th left-to-right maximum A. Knopfmacher and H. Prodinger, Discrete Mathematics 226(2001), 255-267.
On Minimal Expansions in Redundant Number Systems: Algorithms and Quantitative Analysis C. Heuberger, and H. Prodinger, Computing 66 (2001) , 377-393.
A simple card guessing game revisited A. Knopfmacher and H. Prodinger, Electronic Journal of Combinatorics, 8(2) 2001, paper R13 (9 pages).
Combinatorics of geometrically distributed random variables: Inversions and a parameter of Knuth, H. Prodinger, Annals of Combinatorics 5, 241-250 (2001).
On a functional-difference equation of Runyon, Morrison, Carlitz, and Riordan, H. Prodinger, Séminaire Lotharingien Combin. 46 (2001), paper B46a, 4 pp.
Special Issue in Algorithmica, Mathematical Analysis of Algorithms, Algorithmica, Volume 31 - Number 3, 2001, 237-457, R. Kemp and H. Prodinger. Preface Algorithmica 31 (2001), 237-239.
A q-analogue of the path length in binary search trees, H. Prodinger, Algorithmica 31 (2001), 433-441.
Some applications of the q-Rice formula H. Prodinger, Random Structures and Algorithms, 19 (2001), 552-557.
Words, Dyck Paths, Trees, and Bijections, H. Prodinger, in: WORDS, SEMIGROUPS, AND TRANSDUCTIONS, Festschrift in Honor of Gabriel Thierrin, World Scientific, 2001, 369-379.
Special Issue in Random Structures and Algorithms 19, Issue 3-4, 2001, pages 149-557, Analysis of Algorithms, H. Prodinger and W. Szpankowski.

2002

Moments of level numbers of leaves in binary trees A. Panholzer and H. Prodinger, J. of Statistical Planning and Inference 101 (2002), 267-279.
Words, Permutations, and Representations of Numbers , H. Prodinger, in Lecture Notes in Computer Science 2295 (Ed. W. Kuich, G. Rozenberg, A. Salomaa), Springer, p. 81-99, 2002.
Probabilistic Analysis of Carlitz Compositions, G. Louchard and H. Prodinger, Discrete Mathematics and Theoretical Computer Science 5 (2002), 71-96.
The height of q-binary search trees, M. Drmota and H. Prodinger, Discrete Mathematics and Theoretical Computer Science 5 (2002), 97-108.
Bijections for ternary trees and non-crossing trees A. Panholzer and H. Prodinger, Discrete Mathematics 250 (2002), 181-195.
Binary search tree recursions with harmonic toll functions A. Panholzer, and H. Prodinger, Journal of computational and applied mathematics 142 (2002), 211-225.
Combinatorics of geometrically distributed random variables: Value and position of large left-to-right maxima H. Prodinger, Discrete Mathematics 254 (2002), 459-471.
Optimal Versus Randomized Search of Fixed Length Binary Words , H. Prodinger and W. Szpankowski, IEEE Transactions on Information Theory 48 (2002), 2614-2621.
Sorting algorithms for broadcast communications: Mathematical Analysis P. Grabner and H. Prodinger, Theoretical Computer Science 289 (2002), 51-67.
On q-Olivier functions, H. Prodinger and T.A.Tshifhumulo; Annals of Combinatorics 6 (2002), 181-194.
A generating functions proof of a curious identity A. Panholzer and H. Prodinger. INTEGERS 2 (2002), paper A06 (3 pages).
Digits and beyond, H. Prodinger, Mathematics and Computer Science II, Birkhaeuser Verlag, B. Chauvin, P. Flajolet, D. Gardy, A Mokkadem, eds, 2002, 355-377.
Special Issue: Analysis of Algorithms, Journal of Algorithms 44 (2002), 1-285; forword pages 1-3, H. Prodinger and B. Vallee, editors.
A multivariate view of random bucket digital search trees, F. Hubalek, H.K. Hwang, W. Lew, H. Mahmoud and H. Prodinger, Journal of Algorithms 44 (2002), 121-158.
Some identities for Chebyshev polynomials, P. Grabner and H. Prodinger, Portugalia Mathematicae 59 (2002), 311-314.
On the analysis of an algorithm to generate a random cyclic permutation, H. Prodinger, Ars Combinatoria 65 (2002), 75-78.

2003

Combinatorics of geometrically distributed random variables: Run statistics, P. Grabner, A. Knopfmacher and H. Prodinger, extended abstract in LATIN 2000, Lecture Notes in Computer Science 1776 (2000), 457-462,, full version in Theoretical Computer Science 297 (2003), 261-270.
Carry Propagation in Signed Digit Representations C. Heuberger and H. Prodinger, European Journal on Combinatorics 24 (2003), 293-320.
Inversions in permutations: A saddle point approach. G. Louchard and H. Prodinger, Journal of Integers Sequences 6, 2003, article 3.2.8. (19 pages).
An Involutory Matrix of Eigenvectors D. Callan and H. Prodinger, The Fibonacci Quarterly 38 (2003), 105-107.
Ascending runs of sequences of geometrically distributed random variables: a probabilistic analysis , G. Louchard and H. Prodinger, Theoretical Computer Science 304 (2003), 59-86.
Fountains, histograms, and q-identities P. Paule and H. Prodinger, DMTCS 6 (2003), 101-106.
Subblock occurrences in signed digit representations P. Grabner, C. Heuberger and H. Prodinger, Glasgow Mathematical Journal 45 (2003), 427-440.
A bijection between directed column-convex polyominoes and ordered trees of height at most four , E. Deutsch and H. Prodinger, Theoretical Computer Science 307 (2003), 319-325.
Random 0-1 rectangular matrices: a probabilistic analysis G. Louchard and H. Prodinger, Periodica Mathematica Hungarica 47 (2003), 169-193.
The pills problem revisited, C. Brennan and H. Prodinger, Quaestiones Mathematicae 26 (2003), 427-439.

2004

On the moments of a distribution defined by the Gaussian polynomials, H. Prodinger, J. of Statistical Planning and Inference 119 (2004), 237-239 pdf
(q,delta)-numeration systems with missing digits F. Bassino and H. Prodinger, Monatshefte fuer Mathematik 141 (2004), 89-99.
Spanning tree size in Random Binary Search Trees A. Panholzer and H. Prodinger, Annals of Applied Probability 14 (2004), 718-733.
Permuting in place: Analysis of two stopping rules A. Panholzer, H. Prodinger, and M. Riedel, Journal of Algorithms 51 (2004), 170-184.
The kernel method: a collection of examples, H. Prodinger. Séminaire Lotharingien de Combinatoire, B50f (2004), 19 pp.
Distribution results for low-weight binary representations for pairs of integers, P. Grabner, C. Heuberger, H. Prodinger, Theoretical Computer Science 319 (2004), 307-331.
Compositions and Patricia tries: No fluctuations in the variance! H. Prodinger. Proceedings of the 6th Workshop on ALENEX and the 1st workshop on ANALCO, L. Arge, G. Italiano, R. Sedgewick (editors). SIAM. Pages 211-215, 2004
The number of descents in samples of geometric random variables, A. Knopfmacher and H. Prodinger, Mathematics and Computer Science III: Algorithms, Trees, Combinatorics and Probabilities. Series: Trends in Mathematics (Mathematics, Computer Science). Edited by Drmota, M.; Flajolet, P.; Gardy, D.; Gittenberger, B. 2004, XV, 554 p., Birkhäuser , pages 339-350, 2004.
Some parameters in heap ordered trees K. Morris, A. Panholzer, and H. Prodinger, Combinatorics, Probability, and Computing 13 (2004), 677-696 pdf
Analysis of some statistics for increasing tree families A. Panholzer and H. Prodinger. Discrete Mathematics and Theoretical Computer Science 6 (2004), 437-460.
Measuring post-quickselect disorder , A. Panholzer, H. Prodinger, and M. Riedel, JIRSS 3 (2004), 219-249
Periodic oscillations in the analysis of algorithms, JIRSS 3 (2004) 251-270, H. Prodinger.
q-identities of Fu and Lascoux proved by the q-Rice formula, H. Prodinger. Quaestiones Mathematicae 27 (2004), 391-395.
More terms of the asymptotic solution of a difference equation considered by Ramanujan, H. Prodinger, The Australian Mathematical Gazette 31 (2004), 340-341.
A note on a paper of G. H. Weiss and M. Dishon , H. Prodinger, Fibonacci Quarterly 42 (2004), 290-291.

2005

Two q-identities from the theory of fountains and histograms proved a tri-diagonal determinant H. Prodinger, INTEGERS 5 (2005), #A03, 3 pages.
The number of distinct values of some multiplicity in sequences of geometrically distributed random variables. G. Louchard, H. Prodinger, M. Ward. Discrete Mathematics and Theoretical Computer Science AD (2005), 231-256.
A curious identity proved by Cauchy's integral formula, H. Prodinger, Math. Gazette 89 (2005), 266-267.
Analysis of linear combination algorithms in cryptography, P. Grabner, C. Heuberger, H. Prodinger, and J. Thuswaldner. Transactions on Algorithms 1 (2005), 123-142.
The Alternating Greedy Expansion and Applications to Left-To-Right Algorithms in Cryptography C. Heuberger, R. Katti, H. Prodinger and X. Ruan, Theoretical Computer Science 341 (2005), 55-72.
Counting optimal joint expansions, P. Grabner, C. Heuberger, and H. Prodinger, INTEGERS 5(3) (2005), paper A9, 19 pages.
Computer-free evaluation of a double infinite sum via Euler sums A. Panholzer and H. Prodinger, Seminaire Lotharingien de Combinatoire, B55a (2005), 3 pp.
Returns to the Origin for Random Walks on Z Revisited H. Prodinger, Missouri Journal of the Mathematical Sciences 17 (2005), 140-142.

2006

Moments of distributions related to digital expansions, L.L.Cristea and H. Prodinger, Journal of Mathematical Analysis and Applications 315 (2006), 606-625.
Minimality of the Hamming Weight of the $\tau$-NAF for Koblitz Curves and Improved Combination with Point Halving, Avanzi-Heuberger-Prodinger, SAC conference, Lecture Notes in Computer Science 3897 (2006), 332-344. (pdf).
Analysis of Alternative Digit Sets for Nonadjacent Representations C. Heuberger and H. Prodinger, Monatshefte fuer Mathematik 147 (2006), 219-248.
The scientific works of Rainer Kemp (1949-2004), P. Flajolet, M. Nebel, and H. Prodinger, Theoretical Computer Science 355, 371-381, 2006.
Pade approximations to logarithm II: Identities, Recurrences, and Symbolic Computation, K. Driver, H. Prodinger, C. Schneider, and J.A.C. Weideman. Ramanujan Journal 11 (2006), 139-158.
A. Knopfmacher and H. Prodinger, The first descent in samples of geometric random variables and permutations, DMTCS 8 (2006), 214-234. pdf
Analysis of a new skip list variant, G. Louchard and H. Prodinger, DMTCS, proc. AG (2006), 365-374 (MathInfo conference, Nancy, September 2006). pdf
d-records in geometrically distributed random variables. H. Prodinger. DMTCS 8 (2006), 273-284. pdf
The number of values in a geometrically distributed sample M. Archibald, A. Knopfmacher and H. Prodinger, European Journal of Combinatorics 27 (2006), 1059-1081.
The register function for t-ary trees, M. Drmota and H. Prodinger, Transactions on Algorithms 2 (2006), 318-334.
Pade approximations to logarithm III: Alternative Methods and Additional Results, K. Driver, H. Prodinger, C. Schneider, and J.A.C. Weideman. Ramanujan Journal 12 (2006), 299-314.
The number of elements close to near-records in geometric samples, G. Louchard and H. Prodinger. Quaestiones Mathematicae 29 (2006), 447-470
Scalar multiplication on Koblitz curves using the Frobenius endomorphism and its combination with point halving: extensions and mathematical analysis. Avanzi, Heuberger, Prodinger, Algorithmica 46 (2006), 249-270.
Asymptotics of the Moments of Extreme-value Related Distribution Functions, G. Louchard and H. Prodinger, Algorithmica, 46 (2006), 431-467,

2007

On alpha-greedy expansions of numbers, C. Heuberger and H. Prodinger, Advances in Applied Mathematics, 38 (2007), 505-525.
Secant and cosecant sums and Bernoulli-N"orlund polynomials, Quaestiones Mathematicae, P. Grabner and H. Prodinger, Quaestiones Mathematicae 30 (2007), 159-165.
The last descent in samples of geometric random variables and permutations, A. Knopfmacher and H. Prodinger, Ars Combinatoria 83 (2007), 365--379.
Order statistics for the Cantor-Fibonacci distribution L.L. Cristea and H. Prodinger, Aequationes Mathematicae 73 (2007), 78-91.
The level of nodes in increasing trees revisited A. Panholzer and H. Prodinger, Random Structures and Algorithms 31 (2007), 203-226.
q-Enumeration of Salie permutations, H. Prodinger. Annals of Combinatorics 11 (2007), 213-225.
Hamming weight of the non-adjacent form under various input statistics. C. Heuberger and H. Prodinger, Period. Math. Hungar. 55 (2007), 81-96.
A combinatorial and probabilistic study of initial and end heights of descents in samples of geometrically distributed random variables and in permutations. G. Louchard and H. Prodinger, Discrete Math. Theor. Comput. Sci. 9 (2007), no. 1, 137--170
On Redundant $\tau$-adic Expansions and Non-Adjacent Digit Sets, R. Avanzi, C. Heuberger and H. Prodinger, Proceedings of Selected Areas in Cryptography: 13th International Workshop, SAC 2006, Montreal, QC, Canada, August 17–18, 2006, Lecture Notes in Computer Science 4356, 285-301, Springer, E Biham and A M Youssef, Editors pdf
Minimal and maximal plateau lengths in Motzkin paths. H. Prodinger and S. Wagner. AofA 2007, DMTCS proc. AH 2007, 353-362.

2008

Generalized Approximate Counting Revisited, G. Louchard and H. Prodinger, Theoretical Computer Science 391 (2008), 109-125.
The number of gaps in sequences of geometrically distributed random variables, G. Louchard and H. Prodinger, Discrete Mathematics 308 (2008), 1538-1562.
Human proofs of identities by Osburn and Schneider, H. Prodinger, INTEGERS 8 (2008), paper A10 (8 pages).
Identities involving rational sums by inversion and partial fraction decomposition, H. Prodinger, Applicable Analysis and Discrete Mathematics 2(2008), 65-68.
On the order of the recursion relation of Motzkin numbers of higher rank,The open applied mathematical journal 2008, 2, 14-15, H. Prodinger.
Generalized reciprocity laws for sums of harmonic numbers, M. Kuba, H. Prodinger, and C. Schneider, INTEGERS 8 (2008), paper A17,
Advancing in the presence of a demon,G. Louchard and H. Prodinger, Mathematica Slovaca, 58 (2008), 263-276 .
A continued fraction expansion for a q-tangent function: An elementary proof, H. Prodinger. Seminaire Lotharingien de Combinatoire 60 (2008), paper B60b, 3 pages.
Generating functions related to partition formulae for Fibonacci numbers, H. Prodinger, Journal of Integer Sequences, Vol. 11 (2008), Article 08.1.8
Records in geometrically distributed words: sum of positions, H. Prodinger, Applicable Analysis and Discrete Mathematics 2 (2008), 234-240.
The register function for lattice paths, G. Louchard and H. Prodinger, DMTCS proc. AG (2008), 139-152.
Generating random derangements, C. Martinez, A. Panholzer, H. Prodinger, Proc. of the 10th ACM-SIAM Workshop on Algorithm Engineering and Experiments (ALENEX) and the 5th ACM-SIAM Workshop on Analytic Algorithmics and Combinatorics (ANALCO), 234-240, 2008, I. Munro, R. Sedgewick and W. Szpankowski and D. Wagner (editors).
Joint distributions for movements of elements in Sattolo's and Fisher-Yates' algorithm. G. Louchard, H. Prodinger and S. Wagner, Quaestiones Mathematicae 31 (2008), 307-344.
On a constant arising in the analysis of bit comparisons in quickselect. P Grabner and H. Prodinger, Quaestiones Mathematicae 31 (2008), 303-306.
Positional number systems with digits forming an arithmetic progression. C. Heuberger, H. Prodinger and S. Wagner, Monatshefte fuer Mathematik, 155 (2008), 349-375.
The location of the first maximum in the first sojourn of a Dyck path H. Prodinger, DMTCS 10 (2008), 125–134.

2009

On the Expansion of Fibonacci and Lucas Polynomials, H. Prodinger, Journal of Integer Sequences 12 (2009), Article 09.1.6.
A simple bijection between a subclass of 2-binary trees and ternary trees. H. Prodinger, Discrete Mathematics 309 (2009), 959-961.
Bijections between certain families of labelled and unlabelled d-ary trees, Alois Panholzer and H. Prodinger, Appl. Anal. Discrete Math. 3 (2009), 123–136.
Bijections for 2-Plane Trees and Ternary Trees, Nancy S S Gu and H. Prodinger, European J of Combinatorics 30 (2009), 969-985.
Foreword for special issue in Annals of Combinatorics, A. Panholzer, H. Prodinger, Annals of Combinatorics 12 (2009), 353-355.
The Asymmetric Leader Election Algorithm: another approach, G. Louchard and H. Prodinger, Annals of Combinatorics 12 (2009), 449-478. ps
The digit generating function of a polynomial , H. Prodinger and S. Wagner, Journal of Number Theory 129 (2009), 1325-1337.
Moves and displacements of particular elements in quicksort, C. Martinez and H. Prodinger, Theoretical Computer Science 410 (2009), 2279-2284.
Sums of Choi, Zoernig, and Rathie --- an elementary approach, H. Prodinger, Quaestiones Mathematicae 32 (2009), 265-267.
Lattice Paths, Sampling Without Replacement, and Limiting Distributions , Markus Kuba, Alois Panholzer and H. Prodinger, Electronic Journal of Combinatorics vol 16(1), paper R67, 12 pages.
On the shape of the fringe of various types of random trees, M. Drmota, B. Gittenberger, A. Panholzer, H. Prodinger and M.D.Ward, Mathematical Methods in the Applied Sciences 32 (2009) 1207-1245.
Analysis of complements in multi-exponentiation algorithms using digit representations, Clemens Heuberger and H. Prodinger (Available as report 2008-8.) International Journal of Foundations of Computer Science 20 (2009), 443-453.
q-enumeration of up-down words by number of rises. L.L.Cristea and H. Prodinger, Fibonacci Quarterly 46/47 (2008/2009), 126-134.
On a Sum of Melham and its Variants, H. Prodinger, Fibonacci Quarterly 46/47 (2008/2009), 207-215.
A Short Proof of a Series Evaluation in Terms of Harmonic Numbers, Integers 9 (2009), 491-496 (paper A38), A. Panholzer and H. Prodinger.
Sums of powers of Fibonacci polynomials, Proceedings of the Indian Academy of Sciences Mathematical Sciences 119 (2009), 567-570. H. Prodinger.

2010

Representations of numbers as $\sum_{k=-n}^n\varepsilon_k k$: A saddle point approach, in: LNCS 5489 (Infinity in Logic and Computation), Archibald, M.; Brattka, V.; Goranko, V.F.; Löwe, B. (Eds.) G. Louchard and H. Prodinger, pages 87-96, 2010.
Bijections for a class of labeled plane trees, N. S. S. Gu, H. Prodinger, and S. Wagner, European Journal of Combinatorics 31 (2010), 720-732.
Staircase words and Chebyshev polynomials , A. Knopfmacher, A. Munagi, H. Prodinger, Toufik Mansour, Appl. Anal. Discrete Math. 4 (2010), 81–95.
On a reciprocity law for finite multiple zeta values, M. Kuba and H. Prodinger, "On a Reciprocity Law for Finite Multiple Zeta Values," International Journal of Combinatorics, vol. 2010, Article ID 153621, 13 pages, 2010.
A generalized Filbert Matrix, Emrah Kilic and H. Prodinger, Fibonacci Quarterly 48 (2010), 29-33.
Continued fraction expansions for q-tangent and q-cotangent functions , H. Prodinger, DMTCS 12 (2), 2010, 47-64.
Asymptotic results for silent elimination, G. Louchard and H. Prodinger, DMTCS 12 (2), 2010, 185-196.
One-Parameter Generalizations of Rogers-Ramanujan Type Identities, N. S. S. Gu and H. Prodinger, Advances in Applied Mathematics 45 (2010), 149-196.
A note on Stirling sums, M. Kuba and H. Prodinger, INTEGERS A34 (2010), 393-406.
A proof of Melham's conjecture, Emrah Kilic, Ilker Akkus, and H. Prodinger, Fibonacci Quarterly 48 (2010), 241-248.
q-enumeration of words by their total variation , L.L. Cristea and H. Prodinger, DMTCS 12 (2010), 139-150.
A GENERALIZATION OF A FILBERT MATRIX WITH 3 ADDITIONAL PARAMETERS , H. Prodinger, Transactions of the Royal Society of South Africa 65 (2010), 169-172.
Infinitely many Identities for Sums of Jacobsthal-Lucas Numbers , Journal of Algebra, Number Theory: Advances and Applications, 4 (2010), 49-55. H. Prodinger.
Identities involving harmonic numbers that are of interest for physicists, Utilitas Mathematica 83 (2010), 291-299, H. Prodinger.

(Back to the Homepage)