Prodinger, Helmut - Department of Mathematical Sciences, University of Stellenbosch

• A BIJECTION BETWEEN COLOURED TREES AND SET HELMUT PRODINGER
• Explicit Formulae for some Numerical Triangles of Z. W. Trzaska
• ON A PROBLEM OF YEKUTIELI AND MANDELBROT BIFURCATION RATIO OF BINARY TREES \Lambda
• ASYMPTOTISCHE UNTERSUCHUNGEN OBER CHARAKTERISTISCHE PARAMETER VON SUCHBRUMEN
• Ossip Schubin In dem Museum zu Lille, etwas abseits von dem
• THE LOCATION OF THE FIRST MAXIMUM IN THE FIRST SOJOURN OF A DYCK PATH
• A GENERALIZED FILBERT MATRIX EMRAH KILIC AND HELMUT PRODINGER
• A GENERALIZATION OF A CONJECTURE OF MELHAM EMRAH KILIC1, ILKER AKKUS2, AND HELMUT PRODINGER3
• COMPARISONS IN HOARE'S FIND ALGORITHM PETER KIRSCHENHOFER AND HELMUT PRODINGER
• HYPOTHETIC ANALYSES: APPROXIMATE COUNTING IN THE STYLE OF KNUTH,
• COMBINATORICS OF GEOMETRICALLY DISTRIBUTED RANDOM VARIABLES
• SPECIAL ISSUE ON ANALYSIS OF ALGORITHMS ALOIS PANHOLZER AND HELMUT PRODINGER
• ORDER STATISTICS FOR THE CANTOR-FIBONACCI DISTRIBUTION
• JOURNAL OF COMBINATORIAL THEORY, Series A 42, 310-316 (1986) Two Selection Problems Revisited
• CARRY PROPAGATION IN SIGNED DIGIT REPRESENTATIONS CLEMENS HEUBERGER AND HELMUT PRODINGER
• GEOMETRIC DISTRIBUTIONS AND FORBIDDEN SUBWORDS Helmut Prodinger
• This special issue is devoted to the AverageCase Analysis of Algorithms. Analysis of algorithms aims at a precise prediction of the expected performances of algorithms and
• A NOTE ON THE DISTRIBUTION OF THE THREE TYPES OF NODES IN UNIFORM BINARY TREES
• SORTING ALGORITHMS FOR BROADCAST COMMUNICATIONS: MATHEMATICAL ANALYSIS
• MULTIDIMENSIONAL DIGITAL SEARCHING --ALTERNATIVE DATA STRUCTURES
• THE PILLS PROBLEM REVISITED CHARLOTTE A. C. BRENNAN AND HELMUT PRODINGER
• TOWARDS A MORE PRECISE ANALYSIS OF AN ALGORITHM TO GENERATE BINARY TREES : A TUTORIAL
• MATHEMATICAL ANALYSIS OF ALGORITHMS IN EUROPE HELMUT PRODINGER
• AHLPROBLEME BEI B HELMUT PRODINGER (WIEN)
• COMBINATORICS OF GEOMETRICALLY DISTRIBUTED RANDOM VARIABLES
• Discrete Mathematics 28 (1979) 277-289 @ North-Holland Publishing Company
• Wilhelmine von Hillern Die Geier-Wally
• Subblock Occurrences in Positional Number Systems and Gray code Representation
• SCHUR'S OLD DETERMINANT PROVES A BRAND--NEW THEOREM OF GARRETT--ISMAIL--STANTON
• KIRKMAN'S HYPOTHESIS REVISITED ALOIS PANHOLZER y AND HELMUT PRODINGER z
• ON THE ANALYSIS OF AN ALGORITHM TO GENERATE A RANDOM CYCLIC PERMUTATION
• Ludwig Ganghofer Der Ochsenkrieg
• Ludwig Ganghofer [ERSTER BAND]
• Ludwig Ganghofer Schlo Hubertus
• HOW TO SELECT A LOSER Helmut Prodinger
• This special issue is devoted to the AverageCase Analysis of Algorithms and is already the third of its kind appearing in Algorithmica. Analysis of algorithms aims at a precise
• MOMENTS OF LEVEL NUMBERS OF LEAVES IN BINARY TREES ALOIS PANHOLZER AND HELMUT PRODINGER
• Words, Dyck paths, Trees, and Bijections Helmut Prodinger
• E APPROXIMATIONS TO THE LOGARITHM III: ALTERNATIVE METHODS AND ADDITIONAL RESULTS
• MOMENTS OF DISTRIBUTIONS RELATED TO DIGITAL LIGIA L. CRISTEA AND HELMUT PRODINGER y
• SUBBLOCK OCCURRENCES IN SIGNED DIGIT REPRESENTATIONS PETER J. GRABNER y , CLEMENS HEUBERGER z , AND HELMUT PRODINGER
• A q--ANALOGUE OF THE PATH LENGTH OF BINARY SEARCH HELMUT PRODINGER
• Wilhelm Meyer-Frster Heidenstamm
• Jules Verne Herr der Welt
• THE q-PILBERT MATRIX EMRAH KILIC AND HELMUT PRODINGER
• ON THE ANALYSIS OF PROBABILISTIC COUNTING PETER KIRSCHENHOFER AND HELMUT PRODINGER
• Ludwig Ganghofer Der Klosterjger
• Computing 51, 15-27 (1993) Springer-Verlag 1993
• Quelques techniques analytiques pour l''etude asymptotique
• Digits and beyond Helmut Prodinger
• The number of descents in samples of geometric random variables
• AVERAGE CASEANALYSIS OF PRIORITY TREES: A STRUCTURE FOR PRIORITY QUEUE ADMINISTRATION
• AN ASYMPTOTIC COMMENT ON A PAPER BY ANALYTI AND PRAMANIK
• A Multivariate View of Random Bucket Digital Search Trees
• THE FIBONACCI KILLER Peter J. Grabner and Helmut Prodinger
• MORE TERMS OF THE ASYMPTOTIC SOLUTION OF A DIFFERENCE EQUATION CONSIDERED BY RAMANUJAN
• International Journal of Foundations of Computer Science fl World Scientific Publishing Company
• D I S S E R T A T I O N Untersuchungen zur durchschnittlichen Gestalt
• ANALYSIS OF SOME STATISTICS FOR INCREASING TREE FAMILIES ALOIS PANHOLZER AND HELMUT PRODINGER
• MAXIMUM STATISTICS OF N RANDOM VARIABLES DISTRIBUTED BY THE
• THE PILLS PROBLEM REVISITED CHARLOTTE A. C. BRENNAN AND HELMUT PRODINGER y
• Eine Anwendung der Th<'orie der Modulfunktionen in der Informatik
• FORMULAS FOR FIBONOMIAL SUMS WITH GENERALIZED FIBONACCI AND LUCAS COEFFICIENTS
• Combinatorics, Probability and Computing (2004) 13, 677696. c 2004 Cambridge University Press DOI: 10.1017/S0963548304006194 Printed in the United Kingdom
• ON TOUCHARD'S CONTINUED FRACTION AND EXTENSIONS: COMBINATORICS-FREE, SELF-CONTAINED PROOFS
• DESCENDANTS IN HEAP ORDERED TREES A TRIUMPH OF COMPUTER ALGEBRA
• MULTIDIMENSIONAL DIGITAL SEARCHING AND SOME NEW PARAMETERS IN TRIES
• Mergesort, File: msfinal6.tex Date: 25. 1. 1995(678) BOTTOMUP MERGESORT y
• A GENERALIZATION OF A FILBERT MATRIX WITH 3 ADDITIONAL HELMUT PRODINGER
• Math . Slovaca, 42 (1992), No . 5, 531-545 A COIN TOSSING ALGORITHM FOR
• dRECORDS IN GEOMETRICALLY DISTRIBUTED RANDOM HELMUT PRODINGER
• Eduard von Keyserling Der Pastor von Dumala, Erwin Werner, stand an sei-
• Scientific publications of Helmut Prodinger (October 2003) [1] H. Prodinger and F.J. Urbanek. Language operators related to init. Theoretical Computer
• Armand (Friedrich Strubberg) Die Rache des Mestizen
• AN ASYMPTOTIC STUDY OF A RECURSION OCCURRING IN THE ANALYSIS OF AN ALGORITHM ON BROADCAST COMMUNICATION
• EXTERNAL INTERNAL NODES IN DIGITAL SEARCH TREES
• PROBABILISTIC MODELING OF DATA STRUCTURES ON WORDS: A Reply to Professor Andersson's Letter
• DIGITAL SEARCH TREES AGAIN REVISITED: THE INTERNAL PATH LENGTH PERSPECTIVE
• THE NUMBER OF ELEMENTS CLOSE TO NEARRECORDS IN GEOMETRIC SAMPLES
• How to Count Quickly and Accurately: A Unified Analysis of Probabilistic Counting and Other Related Problems
• SUBBLOCK OCCURRENCES IN SIGNED DIGIT REPRESENTATIONS PETER J. GRABNER
• THE ALTERNATING GREEDY EXPANSION AND APPLICATIONS TO LEFTTORIGHT ALGORITHMS IN CRYPTOGRAPHY
• COMBINATORICS OF GEOMETRICALLY DISTRIBUTED RANDOM VARIABLES
• THE KERNEL METHOD: A COLLECTION OF EXAMPLES
• THE PATH LENGTH OF RANDOM SKIP LISTS Peter Kirschenhofer and Helmut Prodinger
• COMPUTER-FREE EVALUATION OF A DOUBLE INFINITE SUM VIA EULER SUMS
• Discrete Mathematics and Theoretical Computer Science DMTCS vol. (subm.), by the authors, 11 Continued fraction expansions for q-tangent
• LETTER TO THE EDITOR SOME COMMENTS ON THE
• Ascending runs of sequences of geometrically distributed random variables
• q--ENUMERATION OF SALI E PERMUTATIONS
• SOME APPLICATIONS OF THE q--RICE FORMULA HELMUT PRODINGER
• Generalized Approximate Counting Revisited Guy Louchard
• A GENERATING FUNCTIONS PROOF OF A CURIOUS IDENTITY Alois Panholzer
• SPANNING TREE SIZE IN RANDOM BINARY SEARCH TREES ALOIS PANHOLZER y AND HELMUT PRODINGER z
• Asymptotics of the Moments of Extremevalue related distribution functions
• ON CARLITZ COMPOSITIONS Arnold Knopfmacher and Helmut Prodinger
• FURTHER RESULTS ON A PROBLEM OF KN THE ANALYSIS OF BINPACKING
• A BIJECTION BETWEEN DIRECTED COLUMN-CONVEX POLYOMINOES AND
• KNUTH'S OLD SUM ---A SURVEY Helmut Prodinger
• ON RAMANUJAN'S Q--FUNCTION y Philippe Flajolet, Peter J. Grabner,
• THE SUMOFDIGITSFUNCTION FOR COMPLEX BASES Peter J. Grabner, Peter Kirschenhofer and Helmut Prodinger
• COMBINATORICA 2 (2) (1982) 177-186 ON THE AVERAGE HYPEROSCILLATIONS
• This special issue is devoted to Analysis of Algorithms. Analysis of algorithms aims at a precise prediction of the expected performances
• ASYMPTOTICS OF THE LURIADELBR UCK DISTRIBUTION
• Measuring post{quickselect disorder Alois Panholzer Helmut Prodinger y Marko Riedel z
• DESCENDANTS AND ASCENDANTS IN BINARY TREES ALOIS PANHOLZER AND HELMUT PRODINGER
• wrap. J. Combinatorics (1984) 5, 351-357 yielding the equation
• BIJECTIONS BETWEEN CERTAIN FAMILIES OF LABELLED AND UNLABELLED d-ARY TREES
• SUMS OF CHOI, ZORNIG, AND RATHIE --AN ELEMENTARY HELMUT PRODINGER
• ON A SUM OF MELHAM AND ITS VARIANTS HELMUT PRODINGER
• ON A RECIPROCITY LAW FOR FINITE MULTIPLE ZETA VALUES MARKUS KUBA AND HELMUT PRODINGER
• One-Parameter Generalizations of Rogers-Ramanujan Type Identities Nancy S. S. Gu1
• A PROOF OF MELHAM'S CONJECTURE EMRAH KILIC1, ILKER AKKUS2, AND HELMUT PRODINGER3
• q-ENUMERATION OF WORDS BY THEIR TOTAL VARIATION LIGIA L. CRISTEA
• IDENTITIES INVOLVING HARMONIC NUMBERS THAT ARE OF INTEREST FOR PHYSICISTS
• THE INTRINSIC PERIODIC BEHAVIOUR OF SEQUENCES RELATED TO A RATIONAL INTEGRAL
• On Redundant -adic Expansions and Non-Adjacent Digit Sets
• THE ANALYSIS OF APPROXIMATE QUICKSELECT AND RELATED PROBLEMS CONRADO MARTINEZ, ALOIS PANHOLZER, AND HELMUT PRODINGER
• ON SOME CONTINUED FRACTION EXPANSIONS OF THE ROGERS-RAMANUJAN TYPE
• DYCK PATHS WITH PARITY RESTRICTIONS FOR THE FINAL RUNS TO THE ORIGIN: A STUDY OF THE HEIGHT
• FPSAC 2011, Reykjavik, Iceland DMTCS proc. (subm.), by the authors, 112 How often do we reject a superior value?
• HOW OFTEN DO WE REJECT A SUPERIOR VALUE? KAMILLA OLIVER AND HELMUT PRODINGER
• Publ. Math. Debrecen Additive irreducibles in -expansions
• ORDER STATISTICS OF THE GENERALISED MULTINOMIAL LIGIA L. CRISTEA
• Theoretical Computer Science 8 (1979) 161-175. @ North-Holland Publishing Company
• Discrete Mathematics 28 (1979) 269-276 @ North-Holland Publishing Company
• Theoretical Computer Science 10 (1980) 107-108 @INorth-Holland Publishing Company
• JOURNAL OF COMBINATORICS, Vol . 5, No. 4, 287-304 (1980)
• COLLOQUIA MATHEMATICA SOCIETATIS JANOS BOLYAI 37. FINITE AND INFINITE SETS, EGER (HUNGARY), 1981 .
• SIAM J. ALG. DISC. METH. Q 1982 Society for Industrial and Applied Mathematics
• DiscreteMathematics43(1983)113-116 North-Hol1rui.dhblishingCompany
• RECURSION DEPTH ANALYSIS FOR SPECIAL TREE TRAVERSAL ALGORITHMS
• SIAM J. COMPUT. Vol. IS, NO.3. August 1986
• SOME FURTHER RESULTS ON DIGITAL SEARCH TREES
• Annals of Discrete Mathematics 33 (1987) 241 -260 Elsevier Science Publishers B. V. Worth-Holland)
• ZUR AUSWERTUNG GEWISSER NUMERISCHER REIHEN MIT HILFE MODULARER FUNKTIONEN
• Theoretical Computer Science 58 (1988) 143-154 North-Holland
• DO WE REALLY NEED TO BALANCE PATRICIA TRIES? (Extended Abstract)
• CONTRIBUTIONS TO GENERAL ALGEBRA 6 Verlag Holder-Pichler-Tempsky, Wien 1988 -Verlag B . G. Teubner, Stuttgart
• Theoretical Computer Science 68 ( 1989) I-17 North-Hcliand
• ON THE MOMENTS OF THE SUM-OF-DIGITS FUNCTION P.J . Grabnert, P . Kirschenhofer, H . Prodinger and R.F . Tichyt
• The Annals of Applied Probability 1996, Vol . 6, No. 2, 687-694
• Discrete Mathematics and Theoretical Computer Science DMTCS vol. (subm.), by the authors, 11 Analysis of a new skip list variant
• SCALAR MULTIPLICATION ON KOBLITZ CURVES USING THE FROBENIUS ENDOMORPHISM
• ON -GREEDY EXPANSIONS OF NUMBERS CLEMENS HEUBERGER
• HAMMING WEIGHT OF THE NON-ADJACENT-FORM UNDER VARIOUS INPUT STATISTICS
• Discrete Mathematics and Theoretical Computer Science DMTCS vol. (subm.), by the authors, 11 A combinatorial and probabilistic study of initial
• The number of gaps in sequences of geometrically distributed random variables
• DOI: 10.2478/s12175-008-0072-5 Math. Slovaca 58 (2008), No. 3, 263276
• Seminaire Lotharingien de Combinatoire xx (200?), Article xxx A CONTINUED FRACTION EXPANSION FOR A q-TANGENT
• POSITIONAL NUMBER SYSTEMS WITH DIGITS FORMING AN ARITHMETIC PROGRESSION
• Der Jger von Fall Eine stille, kalte Dezembernacht lag ber dem Bergdorfe Leng-
• Ludwig Ganghofer Die Trutze von Trutzberg
• Ludwig Ganghofer Das Kasermanndl
• Ludwig Ganghofer Der hohe Schein
• Villafranca Die Kabinete und die Revolutionen.
• Sir John Retcliffe (Hermann Goedsche)
• Adam Mller-Guttenbrunn Meister Jakob und seine Kinder
• Gustav Falke Aus dem Durchschnitt
• Jodokus Donatus Hubertus In einer Brautnacht
• Hugo Bettauer Die Stadt ohne Juden
• Eduard von Keyserling Das Landhaus
• Der Dorfapostel Hochlandsroman
• Der ungelehrte Bchernarr Ich sehe wohl, was du willst, aber das Mittel, wo-
• Eduard Keyserling Bunte Herzen
• Jules Verne Von der Erde zum Mond
• Ole Edward Rlvaag Das Schweigen der Prairie
• Franz Treller Der Knig der Miami
• Nataly von Eschstruth Die Erlknigin
• ON qOLIVIER FUNCTIONS HELMUT PRODINGER AND TUWANI A. TSHIFHUMULO
• The number of inversions in permutations: A saddle point approach
• (q, )-NUMERATION SYSTEMS WITH MISSING DIGITS FREDERIQUE BASSINO
• DISTRIBUTION RESULTS FOR LOW-WEIGHT BINARY REPRESENTATIONS FOR PAIRS OF INTEGERS
• Compositions and Patricia tries: no fluctuations in the variance! Helmut Prodinger
• qIDENTITIES OF FU AND LASCOUX PROVED BY THE qRICE HELMUT PRODINGER
• TWO qIDENTITIES FROM THE THEORY OF FOUNTAINS AND HISTOGRAMS PROVED WITH A TRIDIAGONAL DETERMINANT
• A CURIOUS IDENTITY PROVED BY CAUCHY'S INTEGRAL HELMUT PRODINGER
• ANALYSIS OF LINEAR COMBINATION ALGORITHMS IN CRYPTOGRAPHY
• ANALYSIS OF ALTERNATIVE DIGIT SETS FOR NONADJACENT REPRESENTATIONS
• COMBINATORICS OF GEOMETRICALLY DISTRIBUTED RANDOM VARIABLES
• COMBINATORICS OF GEOMETRICALLY DISTRIBUTED RANDOM VARIABLES
• THE NUMBER OF DISTINCT VALUES IN A GEOMETRICALLY DISTRIBUTED SAMPLE
• COMBINATORICS OF GEOMETRICALLY DISTRIBUTED RANDOM VARIABLES: RUN STATISTICS
• SOME INFORMATION ABOUT THE BINOMIAL TRANSFORM Helmut Prodinger
• SOME POLYNOMIALS RELATED TO THE FIBONACCI POLYNOMIALS
• Der Herrgottschnitzer von Ammergau Die Wiesen, die den Ammerflu auf beiden Ufern auf dessen
• Discrete Mathematics 46 (1983) 205-206 205 North-Holland
• THE LEVEL OF NODES IN INCREASING TREES REVISITED ALOIS PANHOLZER AND HELMUT PRODINGER
• Ludwig Ganghofer Die Martinsklause
• PSEUDO q-ENGEL EXPANSIONS AND ROGERS-RAMANUJAN TYPE IDENTITIES
• ON THE EXPANSION OF FIBONACCI AND LUCAS POLYNOMIALS
• Georg Weerth Leben und Taten
• E APPROXIMATIONS TO THE LOGARITHM II: IDENTITIES, RECURRENCES, AND SYMBOLIC COMPUTATION
• [Typeset by Helmut Prodinger, November 1997] NOTES ON ``OPEN'' ADDRESSING
• Letter to the Editor A Note on Binomial Recurrences Arising in the Analysis of Algorithms
• ASYMPTOTIC ANALYSIS OF A CLASS OF FUNCTIONAL EQUATIONS AND APPLICATIONS
• Two proofs of Filipponi's formula for Lucas numbers of odd index
• Jules Verne Das Land der Pelze
• IDENTITIES INVOLVING RATIONAL SUMS BY INVERSION AND PARTIAL FRACTION DECOMPOSITION
• Jules Verne Die Leiden eines Chinesen in China
• ON THE MOMENTS OF A DISTRIBUTION DEFINED BY THE GAUSSIAN POLYNOMIALS
• EPIDEMICS WITH TWO LEVELS OF MIXING: THE EXACT MOMENTS
• RETURN STATISTICS OF SIMPLE RANDOM WALKS Peter Kirschenhofer and Helmut Prodinger
• MELLIN TRANSFORMS AND ASYMPTOTICS: DIGITAL SUMS Philippe Flajolet 1;2 , Peter Grabner 3 , Peter Kirschenhofer 1 ,
• Explicit and asymptotic formulae for the expected values of the order statistics of the Cantor distribution
• Combinatorial Sums in the Analysis of a General ized van der Pol Equation
• Some Analytic Techniques for the Investigation of the
• HOW TO ADVANCE ON A STAIRWAY BY COIN FLIPPINGS Helmut Prodinger
• Analysis of an Optimized Search Algorithm for Skip Lists \Lambda
• ON q{OLIVIER FUNCTIONS HELMUT PRODINGER AND TUWANI A. TSHIFHUMULO
• PERIODIC OSCILLATIONS IN THE ANALYSIS OF ALGORITHMS HELMUT PRODINGER
• ON THE ANALYSIS OF PROBABILISTIC COUNTING Peter Kirschenhofer and Helmut Prodinger
• PHILIPPE FLAJOLET'S RESEARCH IN ANALYSIS OF ALGORITHMS AND COMBINATORICS
• SECANT AND COSECANT SUMS AND BERNOULLI-NORLUND POLYNOMIALS
• GLASNIK MATEMATICKI Vol. 22 (42) (1987), 269-278.
• On Redundant -Adic Expansions and Non-adjacent Digit Sets
• ON SOME PARAMETERS IN HEAP ORDERED TREES KATE MORRIS, ALOIS PANHOLZER, AND HELMUT PRODINGER
• Robert Mller Das Inselmdchen
• ON SOME APPLICATIONS OF FORMULAE OF RAMANUJAN IN THE ANALYSIS OF ALGORITHMS
• GENERATING FUNCTIONS RELATED TO PARTITION FORMUL FOR FIBONACCI NUMBERS
• James Fenimore Cooper Lederstrumpf
• Returns to the Origin for Random Walks on Z Helmut Prodinger
• A q--ANALOGUE OF A FORMULA OF HERNANDEZ OBTAINED BY INVERTING A RESULT OF DILCHER
• MONOTONE TREE STRUCTURES REVISITED KATHERINE MORRIS AND HELMUT PRODINGER
• COMMENTS ON THE ANALYSIS OF PARAMETERS IN A RANDOM GRAPH MODEL
• Probabilistic Analysis of Carlitz Compositions \Lambda Guy Louchard y and Helmut Prodinger z
• ANALYSIS OF A SPLITTING PROCESS ARISING IN PROBABILISTIC COUNTING AND OTHER RELATED ALGORITHMS \Lambda
• Ernst von Wolzogen 's Meikatel und der Sexack
• THE ASYMPTOTIC BEHAVIOR OF THE GOLDEN NUMBERS Helmut Prodinger
• ON SOME PARAMETERS IN HEAP ORDERED TREES KATE MORRIS, ALOIS PANHOLZER, AND HELMUT PRODINGER
• The number of inversions in permutations: A saddle point approach
• A q--ANALOGUE OF A FORMULA OF HERNANDEZ OBTAINED BY INVERTING A RESULT OF DILCHER
• On the Number of Descendants and Ascendants in Random Search Trees \Lambda
• ON THE MOMENTS OF THE SUMOFDIGITS FUNCTION P.J. Grabner y , P. Kirschenhofer, H. Prodinger and R.F. Tichy y
• THE EIGENVECTORS OF THE RIGHT--JUSTIFIED PASCAL DAVID CALLAN AND HELMUT PRODINGER
• Ernst Eckstein ZUM EINGANG.
• Eduard von Keyserling Die verwitwete Frstin Adelheid von Neustatt-Birken-
• George Hesekiel Faust und Don Juan
• Journal of Statistical Planning and Inference 119 (2004) 237239
• HUMAN PROOFS OF IDENTITIES BY OSBURN AND SCHNEIDER HELMUT PRODINGER
• Villafranca Die Kabinete und die Revolutionen.
• COMPUTERFREE EVALUATION OF A DOUBLE INFINITE SUM VIA EULER SUMS
• AN ANALYTIC APPROACH FOR THE ANALYSIS OF ROTATIONS IN FRINGEBALANCED BINARY SEARCH TREES
• (q; )-NUMERATION SYSTEMS WITH MISSING DIGITS ERIQUE BASSINO y AND HELMUT PRODINGER y
• ON CANTOR'S SINGULAR MOMENTS HELMUT PRODINGER
• ON STIRLING NUMBERS FOR COMPLEX ARGUMENTS AND HANKEL CONTOURS
• Bijections for a class of labeled plane trees Nancy S. S. Gu 1,2,3
• WORDS CODING SET PARTITIONS KAMILLA OLIVER AND HELMUT PRODINGER
• Returns to the Origin for Random Walks on Z Helmut Prodinger
• THE HEIGHT OF PLANTED PLANE TREES REVISITED HELMUT PRODINGER
• Dora Duncker George Sand
• THE KERNEL METHOD: A COLLECTION OF EXAMPLES
• Discrete Mathematics and Theoretical Computer Science DMTCS vol. (subm.), by the authors, 11 Minimal and maximal plateau lengths in Motzkin
• Bijections for 2-Plane Trees and Ternary Trees Nancy S. S. Gu1 and Helmut Prodinger2
• ON MINIMAL EXPANSIONS IN REDUNDANT NUMBER SYSTEMS: ALGORITHMS AND QUANTITATIVE ANALYSIS
• DIGITAL SEARCH TREES AND BASIC HYPERGEOMETRIC FUNCTIONS
• PERMUTING IN PLACE: ANALYSIS OF TWO STOPPING RULES ALOIS PANHOLZER, HELMUT PRODINGER y , AND MARKO RIEDEL
• SOME DOUBLE BINOMIAL SUMS RELATED TO FIBONACCI, PELL AND GENERALIZED ORDER-k FIBONACCI NUMBERS
• NUMBER OF SURVIVORS IN THE PRESENCE OF A DEMON GUY LOUCHARD
• Jules Verne Abenteuer des Kapitn Hatteras
• ON THE ORDER OF THE RECURSION RELATION OF MOTZKIN NUMBERS OF HIGHER RANK
• ADVANCING IN THE PRESENCE OF A DEMON GUY LOUCHARD AND HELMUT PRODINGER
• The digit generating function of a polynomial Helmut Prodinger 1
• Canad. Math. Bull. Vol. 25 (2), 1982 ON THE NUMBER OF PARTITIONS OF {1, . . . , n} INTO
• APPROXIMATE COUNTING WITH m COUNTERS: A DETAILED ANALYSIS
• A NOTE ON STIRLING SERIES MARKUS KUBA AND HELMUT PRODINGER
• SCHUR'S OLD DETERMINANT PROVES A BRAND-NEW THEOREM OF GARRETT-ISMAIL-STANTON
• A COIN TOSSING ALGORITHM FOR COUNTING LARGE NUMBERS OF EVENTS
• A RESULT IN ORDER STATISTICS RELATED TO
• ON STIRLING NUMBERS FOR COMPLEX ARGUMENTS AND HANKEL CONTOURS
• COMMENTS ON THE ANALYSIS OF PARAMETERS IN A RANDOM GRAPH MODEL
• KIRKMAN'S HYPOTHESIS REVISITED ALOIS PANHOLZERy AND HELMUT PRODINGERz
• HOW TO ADVANCE ON A STAIRWAY BY COIN FLIPPINGS Helmut Prodinger
• Quelques techniques analytiques pour l''etude asymptotique
• Explicit Formulae for some Numerical Triangles of Z. W. Trzaska
• THE FIBONACCI KILLER Peter J. Grabner and Helmut Prodinger
• Lecture Notes on the course Combinatorics (Honours)
• A BIJECTION BETWEEN COLOURED TREES AND SET PARTITIONS
• EINIGE KOMMENTARE ZU EINER BIN-PACKING AUFGABE
• NOTE HYPOTHETIC ANALYSES
• A NOTE ON THE DISTRIBUTION OF THE THREE TYPES OF NODES IN UNIFORM BINARY TREES
• ON BINARY REPRESENTATIONS OF INTEGERS WITH DIGITS -1, 0, 1
• APPROXIMATE COUNTING: AN ALTERNATIVE APPROACH
• MAXIMUM STATISTICS OF N RANDOM VARIABLES DISTRIBUTED BY THE
• SHORT COMMUNICATION A GENERATING FUNCTION APPROACH TO RANDOM SUBGRAPHS OF
• SORTING ALGORITHMS FOR BROADCAST COMMUNICATIONS: MATHEMATICAL ANALYSIS
• A BIJECTION BETWEEN DIRECTED COLUMN-CONVEX POLYOMINOES AND
• APPROXIMATE COUNTING VIA EULER TRANSFORM Helmut Prodinger
• THE LEVEL OF NODES IN HEAP ORDERED TREES HELMUT PRODINGER
• SOME IDENTITIES FOR CHEBYSHEV POLYNOMIALS PETER J. GRABNER y AND HELMUT PRODINGER z
• This special issue is devoted to the AverageCase Analysis of Algorithms. Analysis of algorithms aims at a precise prediction of the expected performances of algorithms and
• THE NUMBER OF WINNERS IN A DISCRETE GEOMETRICALLY DISTRIBUTED SAMPLE
• On the Number of Descendants and Ascendants in Random Search Trees \Lambda
• A SIMPLE CARD GUESSING GAME REVISITED Arnold Knopfmacher
• EINIGE KOMMENTARE ZU EINER BIN--PACKING AUFGABE
• A GENERATING FUNCTIONS APPROACH FOR THE ANALYSIS OF GRAND AVERAGES FOR MULTIPLE QUICKSELECT
• APPROXIMATE COUNTING VIA EULER TRANSFORM Helmut Prodinger
• A RESULT IN ORDER STATISTICS PROBABILISTIC COUNTING
• ,-4, IJ _)_ (4 On the Recursion Depth of Special Tree
• SHORT COMMUNICATION A GENERATING FUNCTION APPROACH TO RANDOM SUBGRAPHS OF
• COMBINATORICS OF GEOMETRICALLY DISTRIBUTED RANDOM VARIABLES
• MULTIPLE QUICKSELECT ---HOARE'S FIND ALGORITHM FOR SEVERAL ELEMENTS
• THE HEIGHT OF qBINARY SEARCH TREES MICHAEL DRMOTA AND HELMUT PRODINGER
• On a question of Cooper and Helmut Prodinger
• Optimal Versus Randomized Search of Fixed Length Binary Words
• A COIN TOSSING ALGORITHM FOR COUNTING LARGE NUMBERS OF EVENTS
• ON THE OPTIMALITY OF AN ALGORITHM OF REINGOLD AND SUPOWIT
• COMBINATORIAL PROBLEMS RELATED TO GEOMETRICALLY DISTRIBUTED RANDOM VARIABLES
• BINARY SEARCH TREE RECURSIONS WITH HARMONIC TOLL ALOIS PANHOLZER y AND HELMUT PRODINGER z
• THE CANTOR---FIBONACCI DISTRIBUTION HELMUT PRODINGER
• THE ORTHOGONALITY OF GEGENBAUER POLYNOMIALS C FOR ! \Gamman
• Analysis of Hoare's FIND Algorithm with Median--of--three Partition \Lambda
• The qCatalan numbers: A saddle point approach
• International Mathematical Forum, Vol. x, 200x, no. xx, xxx -xxx Infinitely many Identities for Sums of
• Jules Verne Abenteuer von drei Russen und drei Englndern in Sdafrika
• THE SUM-OF-DIGITS FUNCTION FOR COMPLEX BASES PETER J. GRABNER, PETER KIRSCHENHOFER
• A q-ANALOGUE OF A FORMULA OF HERNANDEZ OBTAINED BY INVERTING A RESULT OF DILCHER
• COMBINATORIAL PROBLEMS RELATED TO GEOMETRICALLY DISTRIBUTED RANDOM VARIABLES
• A BIJECTIVE PROOF OF AN IDENTITY CONCERNING NODES OF FIXED DEGREE IN PLANTED PLANE TREES
• International Journal of Foundations of Computer Science Oc World Scientific Publishing Company
• PROBABILISTIC MODELING OF DATA STRUCTURES ON WORDS: A Reply to Professor Andersson's Letter
• THE EIGENVECTORS OF THE RIGHT-JUSTIFIED PASCAL TRIANGLE
• THE ORTHOGONALITY OF GEGENBAUER POLYNOMIALS C~n(x) FOR ~ < -n
• ANALYSIS OF A SPLITTING PROCESS ARISING IN PROBABILISTIC COUNTING AND OTHER RELATED ALGORITHMS *
• COMBINATORICS OF GEOMETRICALLY DISTRIBUTED RANDOM VARIABLES
• COMPARISONS IN HOARE'S FIND ALGORITHM PETER KIRSCHENHOFER AND HELMUT PRODINGER
• ON THE OPTIMALITY OF AN ALGORITHM OF REINGOLD AND SUPOWIT
• A CURIOUS IDENTITY PROVED BY CAUCHY'S INTEGRAL FORMULA
• ON THE MOMENTS OF THE SUM-OF-DIGITS FUNCTION P.J. Grabnery, P. Kirschenhofer, H. Prodinger and R.F. Tichyy
• GEOMETRIC DISTRIBUTIONS AND FORBIDDEN SUBWORDS Helmut Prodinger
• THE ASYMPTOTIC BEHAVIOR OF THE GOLDEN NUMBERS Helmut Prodinger
• ON THE MOMENTS OF A DISTRIBUTION DEFINED BY THE GAUSSIAN POLYNOMIALS
• COMBINATORICS OF GEOMETRICALLY DISTRIBUTED RANDOM VARIABLES
• How to Count Quickly and Accurately: A Unified Analysis of Probabilistic Counting and Other Related Problems
• THE KERNEL METHOD: A COLLECTION OF EXAMPLES
• RETURN STATISTICS OF SIMPLE RANDOM WALKS Peter Kirschenhofer and Helmut Prodinger
• PERMUTING IN PLACE: ANALYSIS OF TWO STOPPING RULES ALOIS PANHOLZER, HELMUT PRODINGERy, AND MARKO RIEDEL
• Words, Dyck paths, Trees, and Bijections Helmut Prodinger
• BINARY SEARCH TREE RECURSIONS WITH HARMONIC TOLL FUNCTIONS
• COMBINATORICS OF GEOMETRICALLY DISTRIBUTED RANDOM VARIABLES: RUN STATISTICS
• THE CANTOR_FIBONACCI DISTRIBUTION HELMUT PRODINGER
• ON A PROBLEM OF YEKUTIELI AND MANDELBROT ABOUT THE
• ON THE ANALYSIS OF PROBABILISTIC COUNTING Peter Kirschenhofer and Helmut Prodinger
• On a question of Cooper and Kennedy
• NOTE EXTERNAL INTERNAL NODES IN
• MULTIPLE QUICKSELECT _ HOARE'S FIND ALGORITHM FOR SEVERAL ELEMENTS
• SUBBLOCK OCCURRENCES IN SIGNED DIGIT REPRESENTATIONS PETER J. GRABNERy, CLEMENS HEUBERGERz, AND HELMUT PRODINGER
• Combinatorial Sums in the Analysis of a General-ized van der Pol Equation
• Digits and beyond Helmut Prodinger
• Letter to the Editor A Note on Binomial Recurrences Arising in the Analysis of Algorithms
• TOWARDS A MORE PRECISE ANALYSIS OF AN ALGORITHM TO GENERATE BINARY TREES : A TUTORIAL
• ASYMPTOTICS OF THE LURIA-DELBRU"CK DISTRIBUTION Helmut Prodinger
• ON THE ANALYSIS OF AN ALGORITHM TO GENERATE A RANDOM CYCLIC PERMUTATION
• Explicit and asymptotic formulae for the expected values of the order statistics of the Cantor distribution
• MELLIN TRANSFORMS AND ASYMPTOTICS: DIGITAL SUMS Philippe Flajolet1,2, Peter Grabner3, Peter Kirschenhofer1,
• THE PATH LENGTH OF RANDOM SKIP LISTS Peter Kirschenhofer and Helmut Prodinger
• ON q-OLIVIER FUNCTIONS HELMUT PRODINGER AND TUWANI A. TSHIFHUMULO
• ON SOME PARAMETERS IN HEAP ORDERED TREES KATE MORRIS, ALOIS PANHOLZER, AND HELMUT PRODINGER
• Analysis of Hoare's FIND Algorithm with Median-of-three Partition*
• ON CANTOR'S SINGULAR MOMENTS HELMUT PRODINGER
• Two proofs of Filipponi's formula for Lucas numbers of odd index
• FURTHER RESULTS ON A PROBLEM OF KNO"DEL CONCERNING
• LETTER TO THE EDITOR THE HIGHER MOMENTS OF THE NUMBER OF RETURNS
• CONSECUTIVE RECORDS IN GEOMETRICALLY DISTRIBUTED KAMILLA OLIVER AND HELMUT PRODINGER
• ON A FUNCTIONAL--DIFFERENCE EQUATION OF RUNYON, MORRISON, CARLITZ, AND RIORDAN
• THE LEVEL OF NODES IN HEAP ORDERED TREES HELMUT PRODINGER
• A BIJECTIVE PROOF OF AN IDENTITY CONCERNING NODES OF FIXED DEGREE IN PLANTED PLANE TREES
• APPROXIMATE COUNTING: AN ALTERNATIVE APPROACH
• Partial match queries in relaxed multidimensional search trees \Lambda Conrado Mart'inez y Alois Panholzer z Helmut Prodinger z
• WORDS, PERMUTATIONS, AND REPRESENTATIONS HELMUT PRODINGER
• RECORDS IN GEOMETRICALLY DISTRIBUTED WORDS: SUM OF POSITIONS
• CONTINUED FRACTIONS RELATED TO (t, q)-TANGENTS HELMUT PRODINGER
• A SIMPLE BIJECTION BETWEEN A SUBCLASS OF 2-BINARY TREES AND TERNARY TREES
• JOINT DISTRIBUTIONS FOR MOVEMENTS OF ELEMENTS IN SATTOLO'S AND FISHER-YATES' ALGORITHM
• Moves and displacements of particular elements in Quicksort?
• UNFAIR PERMUTATIONS HELMUT PRODINGER, CARSTEN SCHNEIDER, AND STEPHAN WAGNER
• Franz Treller Das Kind der Prairie
• Discrete Applied Mathematics 25 (1989) 129-143 North-Holland
• ON BINARY REPRESENTATIONS OF INTEGERS WITH DIGITS HELMUT PRODINGER
• A note on a paper of G. H. Weiss and M. Dishon Helmut Prodinger
• BIJECTIONS FOR TERNARY TREES AND NON-CROSSING TREES ALOIS PANHOLZER y AND HELMUT PRODINGER z
• Schur's Determinants and Partition Theorems Mourad E. H. Ismail \Lambda , Helmut Prodinger, and Dennis Stanton y
• Ludwig Ganghofer Stutzi, der Pechvogel
• SUMS OF POWERS OF FIBONACCI POLYNOMIALS HELMUT PRODINGER
• COMBINATORICS OF GEOMETRICALLY DISTRIBUTED RANDOM VARIABLES
• DIGITAL SEARCH TREES AGAIN REVISITED: THE INTERNAL PATH LENGTH PERSPECTIVE
• Returns to the Origin for Random Walks on Z Revisited
• SOME IDENTITIES FOR CHEBYSHEV POLYNOMIALS PETER J. GRABNERy AND HELMUT PRODINGERz
• WORDS, PERMUTATIONS, AND REPRESENTATIONS OF NUMBERS
• SPANNING TREE SIZE IN RANDOM BINARY SEARCH TREES ALOIS PANHOLZERy AND HELMUT PRODINGERz
• MULTIDIMENSIONAL DIGITAL SEARCHING AND SOME NEW PARAMETERS IN TRIES
• AN ASYMPTOTIC STUDY OF A RECURSION OCCURRING IN THE ANALYSIS OF AN ALGORITHM ON BROADCAST COMMUNICATION
• q-ENGEL SERIES EXPANSIONS AND SLATER'S IDENTITIES GEORGE E. ANDREWSy, ARNOLD KNOPFMACHER, PETER PAULEz, AND HELMUT
• DESCENDANTS IN HEAP ORDERED TREES OR
• AN ASYMPTOTIC COMMENT ON A PAPER BY ANALYTI AND PRAMANIK
• (q, ffi)-NUMERATION SYSTEMS WITH MISSING DIGITS FR'ED'ERIQUE BASSINOy AND HELMUT PRODINGERy
• ON CARLITZ COMPOSITIONS Arnold Knopfmacher and Helmut Prodinger
• SOME POLYNOMIALS RELATED TO THE FIBONACCI POLYNOMIALS
• A q-ANALOGUE OF THE PATH LENGTH OF BINARY SEARCH TREES
• ON A FUNCTIONAL-DIFFERENCE EQUATION OF RUNYON, MORRISON, CARLITZ, AND RIORDAN
• MULTIDIMENSIONAL DIGITAL SEARCHING -ALTERNATIVE DATA STRUCTURES
• AVERAGE CASE-ANALYSIS OF PRIORITY TREES: A STRUCTURE FOR PRIORITY QUEUE ADMINISTRATION
• SOME INFORMATION ABOUT THE BINOMIAL TRANSFORM Helmut Prodinger
• MOMENTS OF LEVEL NUMBERS OF LEAVES IN BINARY TREES ALOIS PANHOLZER AND HELMUT PRODINGER
• ASYMPTOTIC ANALYSIS OF A CLASS OF FUNCTIONAL EQUATIONS AND APPLICATIONS
• HOW TO SELECT A LOSER Helmut Prodinger
• ON MINIMAL EXPANSIONS IN REDUNDANT NUMBER SYSTEMS: ALGORITHMS AND QUANTITATIVE ANALYSIS
• DESCENDANTS AND ASCENDANTS IN BINARY TREES ALOIS PANHOLZER AND HELMUT PRODINGER
• A note on a paper of G. H. Weiss and M. Dishon Helmut Prodinger
• COMBINATORICS OF GEOMETRICALLY DISTRIBUTED RANDOM VARIABLES
• EPIDEMICS WITH TWO LEVELS OF MIXING: THE EXACT MOMENTS
• A GENERATING FUNCTIONS PROOF OF A CURIOUS IDENTITY Alois Panholzer
• Schur's Determinants and Partition Theorems Mourad E. H. Ismail*, Helmut Prodinger, and Dennis Stantony
• KNUTH'S OLD SUM _ A SURVEY Helmut Prodinger
• COMBINATORICS OF GEOMETRICALLY DISTRIBUTED RANDOM VARIABLES
• LETTER TO THE EDITOR SOME COMMENTS ON THE
• A SIMPLE CARD GUESSING GAME REVISITED Arnold Knopfmacher
• A GENERATING FUNCTIONS APPROACH FOR THE ANALYSIS OF GRAND AVERAGES FOR MULTIPLE QUICKSELECT
• Some Analytic Techniques for the Investigation of the
• DIGITAL SEARCH TREES AND BASIC HYPERGEOMETRIC FUNCTIONS
• THE NUMBER OF WINNERS IN A DISCRETE GEOMETRICALLY DISTRIBUTED SAMPLE
• ON RAMANUJAN'S Q-FUNCTIONy Philippe Flajolet, Peter J. Grabner,
• [Typeset by Helmut Prodinger, November 1997] NOTES ON "OPEN" ADDRESSING
• A q-ANALOGUE OF A FORMULA OF HERNANDEZ OBTAINED BY INVERTING A RESULT OF DILCHER
• ABZA"HLPROBLEME BEI BA"UMEN HELMUT PRODINGER (WIEN)
• SOME APPLICATIONS OF THE q-RICE FORMULA HELMUT PRODINGER
• THE HEIGHT OF q-BINARY SEARCH TREES MICHAEL DRMOTA AND HELMUT PRODINGER
• COMBINATORICS OF GEOMETRICALLY DISTRIBUTED RANDOM VARIABLES
• Discrete Mathematics and Theoretical Computer Science DMTCS vol. (subm.), by the authors, 11 Asymptotic results for silent elimination
• Jules Verne Der Grne Strahl
• Acta Informatica 31, 775-792 (1994) The path length of random skip lists
• q-ENUMERATION OF UP-DOWN WORDS BY NUMBER OF RISES LIGIA L. CRISTEA
• ON A CONSTANT ARISING IN THE ANALYSIS OF BIT COMPARISONS IN QUICKSELECT
• ASYMPTOTIC RESULTS FOR THE NUMBER OF PATHS IN A ALOIS PANHOLZER AND HELMUT PRODINGER
• THE NUMBER OF HUFFMAN CODES, COMPACT TREES, AND SUMS OF UNIT FRACTIONS
• ON PROTECTED NODES IN DIGITAL SEARCH TREES ROSENA R.X. DU AND HELMUT PRODINGER
• PARTIAL FRACTION DECOMPOSITION PROOFS OF SOME q-SERIES IDENTITIES
• THE NUMBER OF RESTRICTED LATTICE PATHS REVISITED HELMUT PRODINGER
• Discrete Mathematics and Theoretical Computer Science DMTCS vol. (subm.), by the authors, 11 Digital search trees with m trees
• BOOTSTRAPPING AND GUMBEL LIMIT LAWS HELMUT PRODINGER AND STEPHAN WAGNER
• AUTOMATIC EVALUATION OF SUMS OF PRODUCTS OF GENERALIZED FIBONACCI AND LUCAS NUMBERS AND NEW
• INFORMATION AND CONTROL 44, 36-46 (1980) Congruences Defined by Languagesand Filters
• VARIANTS OF THE FILBERT MATRIX EMRAH KILIC AND HELMUT PRODINGER
• THE VISIBILITY PARAMETER FOR WORDS AND PERMUTATIONS
• CONTINUED FRACTION EXPANSIONS RELATED TO GOLLNITZ' LITTLE PARTITION THEOREM