2026 Helmut Prodinger: Mathematics Researcher – H-Index, Publications & Awards

Discipline name	D-Index	World Ranking	Current World Ranking	National Ranking	Current National Ranking	Publications	Citations
Mathematics	33	3041	2716	14	14	438	4861
Computer Science	33	12690	12321	7	7	390	4621

Helmut Prodinger publication distribution in Mathematics in 2026

The chart shows the distribution of publications by all Research.com ranked scientists in the field of Mathematics in 2026. The highlighted bar marks where Helmut Prodinger sits on this spectrum.

42 publications 537+

This scientist: 438 publications — 95th percentile

95% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 537 publications or more.

Helmut Prodinger D-index placement in Mathematics in 2026

The chart shows the D-index (discipline H-index) distribution of Mathematics scientists ranked by Research.com in 2026. The highlighted bar marks where Helmut Prodinger sits on this spectrum.

30 D-Index 86+

This scientist: 33 D-Index — 17th percentile

17% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 86 D-Index or more.

Overview

Helmut Prodinger is affiliated with Stellenbosch University in South Africa. Their research spans the fields of Mathematics and Computer Science, with a significant focus on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics, and Geometry and Topology. Other notable subfields include Mathematical Physics and Algebra and Number Theory.

Their recent publications demonstrate continued contributions to combinatorial mathematics. Notable papers include:

Partial Skew Dyck Paths: A Kernel Method Approach (2022), published in Graphs and Combinatorics
Deutsch paths and their enumeration (2021), published in Open Journal of Discrete Applied Mathematics
On \(k\)-Dyck Paths with a Negative Boundary (2024), published in Journal of Combinatorial Mathematics and Combinatorial Computing
Skew Dyck Paths With Catastrophes (2022), published in Discrete Mathematics Letters
Enumeration of S-Motzkin paths from left to right and from right to left: a kernel method approach (2020), published in Pure mathematics and applications

Frequent co-authors collaborating with Prodinger include:

Jean-Luc Baril
Nancy S. S. Gu
Zurab Janelidze
Francois Van Niekerk
Sarah J. Selkirk

Prodinger has published extensively in various venues, with a notable number of contributions to arXiv (Cornell University). Other frequent publication venues are:

Enumerative Combinatorics and Applications
Notes on Number Theory and Discrete Mathematics
Open Journal of Discrete Applied Mathematics
Discrete Mathematics Letters

The main research topics covered by Prodinger reflect an emphasis on advanced and applied combinatorial mathematics. These topics include:

Advanced Combinatorial Mathematics
Stochastic processes and statistical mechanics
Topological and Geometric Data Analysis
Mathematics and Applications
Semigroups and automata theory
Advanced Mathematical Identities
Advanced Mathematical Theories and Applications

Best Publications

Fibonacci numbers of graphs

Helmut Prodinger;Robert Tichy

342
Citations
Mellin transforms and asymptotics: digital sums

Philippe Flajolet;Peter Grabner;Peter Kirschenhofer;Helmut Prodinger

193
Citations
Spanning tree formulas and chebyshev polynomials

Francis T. Boesch;Helmut Prodinger

133
Citations
On Ramanujan's Q -function

Philippe Flajolet;Peter J. Grabner;Peter Kirschenhofer;Helmut Prodinger

118
Citations
How to select a loser

Helmut Prodinger

109
Citations
Combinatorics of geometrically distributed random variables: left-to-right maxima

Helmut Prodinger

92
Citations
The path length of random skip lists

Peter Kirschenhofer;Helmut Prodinger

88
Citations
Level number sequences for trees

P. Flajolet;H. Prodinger

80
Citations
On Carlitz Compositions

A. Knopfmacher;H. Prodinger

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

P. Kirschenhofer;H. Prodinger;W. Szpankowski

71
Citations
Analysis of Hoare's FIND algorithm with median-of-three partition

P. Kirschenhofer;H. Prodinger;C. Martínez

71
Citations
Register allocation for unary binary trees

P. Flajolet;H. Prodinger

67
Citations
Level of nodes in increasing trees revisited

Alois Panholzer;Helmut Prodinger

66
Citations
ON SOME APPLICATIONS OF FORMULAE OF RAMANUJAN IN THE ANALYSIS OF ALGORITHMS

P. Kirschenhofer;H. Prodinger

60
Citations
Some Further Results on Digital Search Trees

Peter Kirschenhofer;Helmut Prodinger

59
Citations
A result in order statistics related to probabilistic counting

Peter Kirschenhofer;Helmut Prodinger

59
Citations
Digital Search Trees Again Revisited: The Internal Path Length Perspective

Peter Kirschenhofer;Helmut Prodinger;Wojciech Szpankowski

58
Citations
Sparse universal graphs for bounded-degree graphs

Noga Alon;Michael Capalbo

56
Citations
The number of winners in a discrete geometrically distributed sample

Peter Kirschenhofer;Helmut Prodinger

54
Citations
Comparisons in Hoare's Find Algorithm

Peter Kirschenhofer;Helmut Prodinger

54
Citations
On the balance property of Patricia tries: external path length viewpoint

Peter Kirschenhofer;H. Prodinger;Wojciech Szpankowski

33
Citations
FIBONACCI NUMBERS OF GRAPHS: II

Peter Kirschenhofer;Helmut Prodinger;Robert F. Tichy

12
Citations

Frequent Co-Authors

Wojciech Szpankowski Purdue University West Lafayette

Philippe Flajolet French Institute for Research in Computer Science and Automation - INRIA

Carsten Schneider Johannes Kepler University of Linz

Richard P. Brent Australian National University

Jeffrey Shallit University of Waterloo

George E. Andrews Pennsylvania State University

Toufik Mansour University of Haifa

External Links

Personal website of Helmut Prodinger Google Scholar page

If you think any of the details on this page are incorrect, let us know.

Related Online Degrees & Career Pathways

Mathematics graduates in the USA often explore various online degree options to enhance their skills and broaden career opportunities. For those interested in blending quantitative expertise with business acumen, pursuing a 1 year mba can provide a fast-track route to leadership roles. These intensive programs build essential management skills without demanding a lengthy time commitment.

Another flexible option is an online mba with transfer credits accepted. This pathway is ideal for students who have already completed graduate coursework and want to leverage those credits, reducing both time and cost of earning an MBA while advancing their analytical careers.

For math majors interested in the growing field of big data, enrolling in a data analytics masters programs offers in-demand skills for interpreting complex datasets. This training is valuable across many industries, from technology to finance.

Lastly, for those seeking more accessible graduate education, the easiest mba to get into provides an option to gain foundational business knowledge with fewer entry barriers, helping mathematicians pivot into diverse career paths. Each pathway supports expanding mathematical expertise into practical, career-enhancing arenas.