Helmut Prodinger

196 papers A* 5B 5C 3Journal 176Unranked 7
YearRankTypeTitle / Venue / Authors
2024 J jnl
An online bin-packing problem with an underlying ternary structure.
Ars Math. Contemp.
Helmut Prodinger
2024 J jnl
Prefixes of Stanley's Catalan Paths with Odd Returns to the \(x\)-axis-Standard Version and Skew Catalan-Stanley Paths.
Ars Comb.
Helmut Prodinger
2023 J jnl
Combinatorics Arising from Lax Colimits of Posets.
Order
Zurab Janelidze, Helmut Prodinger, Francois van Niekerk
2023 J jnl
Skew Dyck paths without up-down-left.
Art Discret. Appl. Math.
Helmut Prodinger
2022 J jnl
Partial Skew Dyck Paths: A Kernel Method Approach.
Graphs Comb.
Helmut Prodinger
2021 J jnl
Combinatorics on lattice paths in strips.
Eur. J. Comb.
Nancy S. S. Gu, Helmut Prodinger
2020 J jnl
Identities and Inequalities for Sums Involving Binomial Coefficients.
Integers
Horst Alzer, Helmut Prodinger
2019 J jnl
A wide class of Combinatorial matrices related with Reciprocal Pascal and Super Catalan matrices.
Contributions Discret. Math.
Emrah Kiliç, Helmut Prodinger
2019 J jnl
Complementary Families of the Fibonacci-Lucas Relations.
Integers
Ivica Martinjak, Helmut Prodinger
2019 J jnl
Dual-Pivot Quicksort: Optimality, Analysis and Zeros of Associated Lattice Paths.
Comb. Probab. Comput.
Martin Aumüller, Martin Dietzfelbinger, Clemens Heuberger, Daniel Krenn, Helmut Prodinger
2019 J jnl
Logarithms of a binomial series: A Stirling number approach.
Ars Math. Contemp.
Helmut Prodinger
2018 C conf
Analysis of Summatory Functions of Regular Sequences: Transducer and Pascal's Rhombus.
AofA
Clemens Heuberger, Daniel Krenn, Helmut Prodinger
2018 C conf
Counting Ascents in Generalized Dyck Paths.
AofA
Benjamin Hackl, Clemens Heuberger, Helmut Prodinger
2018 J jnl
Growing and Destroying Catalan-Stanley Trees.
Discret. Math. Theor. Comput. Sci.
Benjamin Hackl, Helmut Prodinger
2018 J jnl
On Ruehr's Identities.
Ars Comb.
Horst Alzer, Helmut Prodinger
2018 J jnl
Reductions of binary trees and lattice paths induced by the register function.
Theor. Comput. Sci.
Benjamin Hackl, Clemens Heuberger, Helmut Prodinger
2018 J jnl
Ternary Smirnov Words and Generating Functions.
Integers
Helmut Prodinger
2017 J jnl
Application of Smirnov Words to Waiting Time Distributions of Runs.
Electron. J. Comb.
Uta R. Freiberg, Clemens Heuberger, Helmut Prodinger
2017 — conf
Iterative Cutting and Pruning of Planar Trees.
ANALCO
Benjamin Hackl, Sara Kropf, Helmut Prodinger
2017 J jnl
On Combinatorial Identities of Engbers and Stocker.
Integers
Horst Alzer, Helmut Prodinger
2017 J jnl
Summations in Bernoulli's Triangles via Generating Functions.
J. Integer Seq.
Kamilla Oliver, Helmut Prodinger
2016 J jnl
Batcher's odd-even exchange revisited: A generating functions approach.
Theor. Comput. Sci.
Helmut Prodinger
2016 J jnl
Counting Zeros in Random Walks on the Integers and Analysis of Optimal Dual-Pivot Quicksort.
CoRR
Martin Aumüller, Martin Dietzfelbinger, Clemens Heuberger, Daniel Krenn, Helmut Prodinger
2016 J jnl
Dual-Pivot Quicksort: Optimality, Analysis and Zeros of Associated Lattice Paths.
CoRR
Martin Aumüller, Martin Dietzfelbinger, Clemens Heuberger, Daniel Krenn, Helmut Prodinger
2016 J jnl
Returns, Hills, and t-ary Trees.
J. Integer Seq.
Helmut Prodinger
2016 J jnl
Some Binomial Sums Involving Absolute Values.
J. Integer Seq.
Richard P. Brent, Hideyuki Ohtsuka, Judy-anne H. Osborn, Helmut Prodinger
2016 J jnl
The generalized Lilbert matrix.
Period. Math. Hung.
Emrah Kiliç, Helmut Prodinger
2015 J jnl
Bootstrapping and double-exponential limit laws.
Discret. Math. Theor. Comput. Sci.
Helmut Prodinger, Stephan G. Wagner
2015 J jnl
Formulæ related to the \(q\) -Dixon formula with applications to Fibonomial sums.
Period. Math. Hung.
Emrah Kiliç, Helmut Prodinger
2015 J jnl
Output Sum of Transducers: Limiting Distribution and Periodic Fluctuation.
Electron. J. Comb.
Clemens Heuberger, Sara Kropf, Helmut Prodinger
2015 J jnl
The height and width of bargraphs.
Discret. Appl. Math.
Aubrey Blecher, Charlotte A. C. Brennan, Arnold Knopfmacher, Helmut Prodinger
2014 J jnl
A Note on the Conjecture of Ramirez and Sirvent.
J. Integer Seq.
Emrah Kiliç, Helmut Prodinger
2014 J jnl
A Short Proof of Carlitz’s Bernoulli Number Identity.
J. Integer Seq.
Helmut Prodinger
2014 J jnl
Counting Palindromes According to r-Runs of Ones Using Generating Functions.
J. Integer Seq.
Helmut Prodinger
2014 J jnl
New Multiple Harmonic Sum Identities.
Electron. J. Comb.
Roberto Tauraso, Helmut Prodinger
2013 J jnl
An Identity Conjectured by Lacasse via the Tree Function.
Electron. J. Comb.
Helmut Prodinger
2013 J jnl
The Number of Huffman Codes, Compact Trees, and Sums of Unit Fractions.
IEEE Trans. Inf. Theory
Christian Elsholtz, Clemens Heuberger, Helmut Prodinger
2012 J jnl
Approximate counting with m counters: A detailed analysis.
Theor. Comput. Sci.
Helmut Prodinger
2012 J jnl
Dyck Paths with Parity Restrictions for the Final Runs to the Origin: a Study of the Height.
Fundam. Informaticae
Helmut Prodinger
2012 J jnl
Notes on protected nodes in digital search trees.
Appl. Math. Lett.
Rosena R. X. Du, Helmut Prodinger
2012 J jnl
Number of survivors in the presence of a demon.
Period. Math. Hung.
Guy Louchard, Helmut Prodinger, Mark Daniel Ward
2012 J jnl
Set partitions, words, and approximate counting with black holes.
Australas. J Comb.
Helmut Prodinger
2012 J jnl
The
Int. J. Comput. Math.
Emrah Kiliç, Helmut Prodinger
2012 J jnl
The Asymmetric Leader Election Algorithm with swedish stopping: A probabilistic analysis.
Discret. Math. Theor. Comput. Sci.
Helmut Prodinger, Guy Louchard
2011 J jnl
Continued Fractions Related to (
Electron. J. Comb.
Helmut Prodinger
2011 J jnl
Digital search trees with m trees: Level polynomials and insertion costs.
Discret. Math. Theor. Comput. Sci.
Helmut Prodinger
2011 J jnl
Redundant
Des. Codes Cryptogr.
Roberto Maria Avanzi, Clemens Heuberger, Helmut Prodinger
2011 J jnl
The Intrinsic Periodic Behaviour of Sequences Related to a Rational Integral.
Integers
Helmut Prodinger
2011 — conf
The Swedish Leader Election Protocol: Analysis and Variations.
ANALCO
Guy Louchard, Conrado Martinez, Helmut Prodinger
2011 J jnl
The analysis of Range Quickselect and related problems.
Theor. Comput. Sci.
Conrado Martínez, Alois Panholzer, Helmut Prodinger
2011 J jnl
The number of Huffman codes, compact trees, and sums of unit fractions
CoRR
Christian Elsholtz, Clemens Heuberger, Helmut Prodinger
2011 J jnl
Unfair permutations.
Eur. J. Comb.
Helmut Prodinger, Carsten Schneider, Stephan G. Wagner
2010 J jnl
A Note on Stirling Series.
Integers
Markus Kuba, Helmut Prodinger
2010 J jnl
Arithmetic of Supersingular Koblitz Curves in Characteristic Three.
IACR Cryptol. ePrint Arch.
Roberto Avanzi, Clemens Heuberger, Helmut Prodinger
2010 J jnl
Asymptotic results for silent elimination.
Discret. Math. Theor. Comput. Sci.
Guy Louchard, Helmut Prodinger
2010 J jnl
Bijections for a class of labeled plane trees.
Eur. J. Comb.
Nancy S. S. Gu, Helmut Prodinger, Stephan G. Wagner
2010 J jnl
Continued fraction expansions for q-tangent and q-cotangent functions.
Discret. Math. Theor. Comput. Sci.
Helmut Prodinger
2010 J jnl
One-parameter generalizations of Rogers-Ramanujan type identities.
Adv. Appl. Math.
Nancy S. S. Gu, Helmut Prodinger
2010 J jnl
q-Enumeration of words by their total variation.
Discret. Math. Theor. Comput. Sci.
Ligia Loreta Cristea, Helmut Prodinger
2009 J jnl
A simple bijection between a subclass of 2-binary trees and ternary trees.
Discret. Math.
Helmut Prodinger
2009 J jnl
Analysis of complements in Multi-Exponentiation Algorithms Using Signed Digit Representations.
Int. J. Found. Comput. Sci.
Clemens Heuberger, Helmut Prodinger
2009 J jnl
Bijections for 2-plane trees and ternary trees.
Eur. J. Comb.
Nancy S. S. Gu, Helmut Prodinger
2009 J jnl
Lattice Paths, Sampling Without Replacement, and Limiting Distributions.
Electron. J. Comb.
Markus Kuba, Alois Panholzer, Helmut Prodinger
2009 J jnl
Moves and displacements of particular elements in Quicksort.
Theor. Comput. Sci.
Conrado Martínez, Helmut Prodinger
2008 J jnl
Generalized approximate counting revisited.
Theor. Comput. Sci.
Guy Louchard, Helmut Prodinger
2008 — conf
Generating Random Derangements.
ANALCO
Conrado Martínez, Alois Panholzer, Helmut Prodinger
2008 J jnl
On gaps and unoccupied urns in sequences of geometrically distributed random variables.
Discret. Math.
Guy Louchard, Helmut Prodinger
2008 J jnl
Redundant tau-adic Expansions I: Non-Adjacent Digit Sets and their Applications to Scalar Multiplication.
IACR Cryptol. ePrint Arch.
Roberto Maria Avanzi, Clemens Heuberger, Helmut Prodinger
2008 J jnl
The Location of the First Maximum in the First Sojourn of a Dyck Path.
Discret. Math. Theor. Comput. Sci.
Helmut Prodinger
2007 J jnl
A Combinatorial and Probabilistic Study of Initial and End Heights of Descents in Samples of Geometrically Distributed Random Variables and in Permutations.
Discret. Math. Theor. Comput. Sci.
Helmut Prodinger, Guy Louchard
2007 J jnl
Level of nodes in increasing trees revisited.
Random Struct. Algorithms
Alois Panholzer, Helmut Prodinger
2007 J jnl
On
Adv. Appl. Math.
Clemens Heuberger, Helmut Prodinger
2007 — conf
Representations of Numbers as å
ILC
Guy Louchard, Helmut Prodinger
2007 J jnl
The Hamming weight of the non-adjacent-form under various input statistics.
Period. Math. Hung.
Clemens Heuberger, Helmut Prodinger
2007 J jnl
The Last Descent In Samples Of Geometric Random Variables And Permutations.
Ars Comb.
Arnold Knopfmacher, Helmut Prodinger
2006 J jnl
Asymptotics of the Moments of Extreme-Value Related Distribution Functions.
Algorithmica
Guy Louchard, Helmut Prodinger
2006 B conf
On Redundant
Selected Areas in Cryptography
Roberto Maria Avanzi, Clemens Heuberger, Helmut Prodinger
2006 J jnl
Scalar Multiplication on Koblitz Curves Using the Frobenius Endomorphism and Its Combination with Point Halving: Extensions and Mathematical Analysis.
Algorithmica
Roberto Maria Avanzi, Clemens Heuberger, Helmut Prodinger
2006 J jnl
The first descent in samples of geometric random variables and permutations.
Discret. Math. Theor. Comput. Sci.
Arnold Knopfmacher, Helmut Prodinger
2006 J jnl
The number of distinct values in a geometrically distributed sample.
Eur. J. Comb.
Margaret Archibald, Arnold Knopfmacher, Helmut Prodinger
2006 J jnl
The register function for
ACM Trans. Algorithms
Michael Drmota, Helmut Prodinger
2006 J jnl
The scientific works of Rainer Kemp (1949-2004).
Theor. Comput. Sci.
Philippe Flajolet, Markus E. Nebel, Helmut Prodinger
2005 J jnl
Analysis of linear combination algorithms in cryptography.
ACM Trans. Algorithms
Peter J. Grabner, Clemens Heuberger, Helmut Prodinger, Jörg M. Thuswaldner
2005 B conf
Minimality of the Hamming Weight of the
Selected Areas in Cryptography
Roberto Maria Avanzi, Clemens Heuberger, Helmut Prodinger
2005 J jnl
Minimality of the Hamming Weight of the \tau-NAF for Koblitz Curves and Improved Combination with Point Halving.
IACR Cryptol. ePrint Arch.
Roberto Maria Avanzi, Clemens Heuberger, Helmut Prodinger
2005 J jnl
The alternating greedy expansion and applications to computing digit expansions from left-to-right in cryptography.
Theor. Comput. Sci.
Clemens Heuberger, Rajendra S. Katti, Helmut Prodinger, Xiaoyu Ruan
2004 J jnl
Analysis of some statistics for increasing tree families.
Discret. Math. Theor. Comput. Sci.
Alois Panholzer, Helmut Prodinger
2004 — conf
Compositions and Patricia Tries: No Fluctuations in the Variance!
ALENEX/ANALC
Helmut Prodinger
2004 J jnl
Distribution results for low-weight binary representations for pairs of integers.
Theor. Comput. Sci.
Peter J. Grabner, Clemens Heuberger, Helmut Prodinger
2004 J jnl
On Some Parameters in Heap Ordered Trees.
Comb. Probab. Comput.
Kate Morris, Alois Panholzer, Helmut Prodinger
2004 J jnl
Permuting in place: analysis of two stopping rules.
J. Algorithms
Alois Panholzer, Helmut Prodinger, Marko Riedel
2003 J jnl
A bijection between directed column-convex polyominoes and ordered trees of height at most three.
Theor. Comput. Sci.
Emeric Deutsch, Helmut Prodinger
2003 J jnl
Ascending runs of sequences of geometrically distributed random variables: a probabilistic analysis.
Theor. Comput. Sci.
Guy Louchard, Helmut Prodinger
2003 J jnl
Carry propagation in signed digit representations.
Eur. J. Comb.
Clemens Heuberger, Helmut Prodinger
2003 J jnl
Combinatorics of geometrically distributed random variables: run statistics.
Theor. Comput. Sci.
Peter J. Grabner, Arnold Knopfmacher, Helmut Prodinger
2003 J jnl
Fountains, histograms, and q-identities.
Discret. Math. Theor. Comput. Sci.
Peter Paule, Helmut Prodinger
2003 J jnl
Random 0-1 rectangular matrices: a probabilistic analysis.
Period. Math. Hung.
Guy Louchard, Helmut Prodinger
2002 J jnl
A Tree-Counting Identity: 10781.
Am. Math. Mon.
Leonard Smiley, Helmut Prodinger, Robin Chapman, et al.
2002 J jnl
A multivariate view of random bucket digital search trees.
J. Algorithms
Friedrich Hubalek, Hsien-Kuei Hwang, William Lew, Hosam M. Mahmoud, Helmut Prodinger
2002 J jnl
Bijections for ternary trees and non-crossing trees.
Discret. Math.
Alois Panholzer, Helmut Prodinger
2002 J jnl
Combinatorics of geometrically distributed random variables: value and position of large left-to-right maxima.
Discret. Math.
Helmut Prodinger
2002 J jnl
On the Analysis of an Algorithm to Generate a Random Cyclic Permutation.
Ars Comb.
Helmut Prodinger
2002 J jnl
Optimal versus randomized search of fixed length binary words.
IEEE Trans. Inf. Theory
Helmut Prodinger, Wojciech Szpankowski
2002 J jnl
Preface.
J. Algorithms
Helmut Prodinger, Brigitte Vallée
2002 J jnl
Probabilistic Analysis of Carlitz Compositions.
Discret. Math. Theor. Comput. Sci.
Guy Louchard, Helmut Prodinger
2002 J jnl
Sorting algorithms for broadcast communications: mathematical analysis.
Theor. Comput. Sci.
Peter J. Grabner, Helmut Prodinger
2002 J jnl
The height of q-Binary Search Trees.
Discret. Math. Theor. Comput. Sci.
Michael Drmota, Helmut Prodinger
2001 J jnl
A Simple Card Guessing Game Revisited.
Electron. J. Comb.
Arnold Knopfmacher, Helmut Prodinger
2001 J jnl
A q-Analogue of the Path Length of Binary Search Trees.
Algorithmica
Helmut Prodinger
2001 J jnl
Ascending runs of sequences of geometrically distributed random variables: a probabilistic analysis.
Electron. Notes Discret. Math.
Guy Louchard, Helmut Prodinger
2001 J jnl
Average-Case Analysis of Algorithms - Preface.
Algorithmica
Helmut Prodinger, Wojciech Szpankowski
2001 J jnl
Combinatorics of geometrically distributed random variables: Value and position of the rth left-to-right maximum.
Discret. Math.
Arnold Knopfmacher, Helmut Prodinger
2001 J jnl
On Minimal Expansions in Redundant Number Systems: Algorithms and Quantitative Analysis.
Computing
Clemens Heuberger, Helmut Prodinger
2001 J jnl
Partial Match Queries in Relaxed Multidimensional Search Trees.
Algorithmica
Conrado Martinez, Alois Panholzer, Helmut Prodinger
2001 J jnl
Some applications of the q-Rice formula.
Random Struct. Algorithms
Helmut Prodinger
2001 — conf
Words, Dyck Paths, Trees, and Bijections.
Words, Semigroups, and Transductions
Helmut Prodinger
2001 C conf
Words, Permutations, and Representations of Numbers.
Developments in Language Theory
Helmut Prodinger
2000 J jnl
A Bijective Proof of an Identity Concerning Nodes of Fixed Degree in Planted Trees.
Ars Comb.
John W. Moon, Helmut Prodinger
2000 J jnl
A q-analogue of a formula of Hernandez obtained by inverting a result of Dilcher.
Australas. J Comb.
Helmut Prodinger
2000 B conf
Combinatorics of Geometrically Distributed Random Variables: Lenght of Ascending Runs.
LATIN
Helmut Prodinger
2000 B conf
Run Statistics for Geometrically Distributed Random Variables (Extended Abstract).
LATIN
Peter J. Grabner, Arnold Knopfmacher, Helmut Prodinger
1999 J jnl
On Stirling Numbers for Complex Arguments and Hankel Contours.
SIAM J. Discret. Math.
Philippe Flajolet, Helmut Prodinger
1998 J jnl
A generating functions approach for the analysis of grand averages for multiple QUICKSELECT.
Random Struct. Algorithms
Alois Panholzer, Helmut Prodinger
1998 J jnl
An Asymptotic Study of a Recursion Occurring in the Analysis of an Algorithm on Broadcast Communication.
Inf. Process. Lett.
Peter J. Grabner, Helmut Prodinger
1998 J jnl
Average-Case Analysis of Priority Trees: A Structure for Priority Queue Administration.
Algorithmica
Alois Panholzer, Helmut Prodinger
1998 J jnl
Comparisons in Hoare's Find Algorithm.
Comb. Probab. Comput.
Peter Kirschenhofer, Helmut Prodinger
1998 J jnl
On Carlitz Compositions.
Eur. J. Comb.
Arnold Knopfmacher, Helmut Prodinger
1998 J jnl
On the Number of Descendants and Ascendants in Random Search Trees.
Electron. J. Comb.
Conrado Martinez, Alois Panholzer, Helmut Prodinger
1998 J jnl
Philippe Flajolet's Research in Analysis of Algorithms and Combinatorics.
Algorithmica
Helmut Prodinger, Wojciech Szpankowski
1998 J jnl
Towards a More Precise Analysis of an Algorithm to Generate Binary Trees: A Tutorial.
Comput. J.
Alois Panholzer, Helmut Prodinger
1997 J jnl
A generating function approach to random subgraphs of the n-cycle.
Discret. Math.
Xavier Gourdon, Helmut Prodinger
1997 J jnl
Analysis of Hoare's FIND algorithm with Median-of-three partition.
Random Struct. Algorithms
Peter Kirschenhofer, Helmut Prodinger, Conrado Martinez
1997 J jnl
Descendants and ascendants in binary trees.
Discret. Math. Theor. Comput. Sci.
Alois Panholzer, Helmut Prodinger
1997 J jnl
Maximum Statistics of N Random Variables Distributed by the Negative Binomial Distribution.
Comb. Probab. Comput.
Peter J. Grabner, Helmut Prodinger
1997 J jnl
On a Problem of Yekutieli and Mandelbrot about the Bifurcation Ratio of Binary Trees.
Theor. Comput. Sci.
Helmut Prodinger
1996 J jnl
Analysis of a splitting process arising in probabilistic counting and other related algorithms.
Random Struct. Algorithms
Peter Kirschenhofer, Helmut Prodinger, Wojciech Szpankowski
1996 J jnl
Combinatorics of geometrically distributed random variables: Left-to-right maxima.
Discret. Math.
Helmut Prodinger
1996 J jnl
Depth and Path Length of Heap Ordered Trees.
Int. J. Found. Comput. Sci.
Helmut Prodinger
1996 J jnl
Descendants in heap ordered trees or a triumph of computer algebra.
Electron. J. Comb.
Helmut Prodinger
1996 J jnl
On the Optimality of an Algorithm of Reingold and Supowit.
J. Autom. Lang. Comb.
Peter J. Grabner, Helmut Prodinger
1995 J jnl
Analysis of an Optimized Search Algorithm for Skip Lists.
Theor. Comput. Sci.
Peter Kirschenhofer, Conrado Martinez, Helmut Prodinger
1995 J jnl
Bottom-Up Mergesort - a Detailed Analysis.
Algorithmica
Wolfgang Panny, Helmut Prodinger
1995 J jnl
Comments on the Analysis of Parameters in a Random Graph Model.
RAIRO Theor. Informatics Appl.
Helmut Prodinger
1995 J jnl
Digital search trees and basic hypergeometric functions.
Bull. EATCS
Helmut Prodinger
1995 J jnl
Multiple Quickselect - Hoare's Find Algorithm for Several Elements.
Inf. Process. Lett.
Helmut Prodinger
1995 B conf
Solution of a Problem of Yekutieli and Mandelbrot.
LATIN
Helmut Prodinger
1994 J jnl
An Asymptotic Comment on a Paper by Analyti and Pramanik.
Inf. Process. Lett.
Helmut Prodinger
1994 J jnl
Digital Search Trees Again Revisited: The Internal Path Length Perspective.
SIAM J. Comput.
Peter Kirschenhofer, Helmut Prodinger, Wojciech Szpankowski
1994 J jnl
Mellin Transforms and Asymptotics: Digital Sums.
Theor. Comput. Sci.
Philippe Flajolet, Peter J. Grabner, Peter Kirschenhofer, Helmut Prodinger, Robert F. Tichy
1994 J jnl
Multidimensional Digital Searching-Alternative Data Structures.
Random Struct. Algorithms
Peter Kirschenhofer, Helmut Prodinger
1994 J jnl
Some Polynomials Related to the Fibonacci Polynomials.
Bull. EATCS
Helmut Prodinger
1994 J jnl
The Path Length of Random Skip Lists.
Acta Informatica
Peter Kirschenhofer, Helmut Prodinger
1993 J jnl
A Finite Sum of Products of Binomial Coefficients (C. C. Grosjean).
SIAM Rev.
Philippe Flajolet, Bruno Salvy, Helmut Prodinger
1993 J jnl
A Note on Binomial Recurrences Arising in the Analysis of Algorithms.
Inf. Process. Lett.
Helmut Prodinger, Wojciech Szpankowski
1993 J jnl
A result in order statistics related to probabilistic counting.
Computing
Peter Kirschenhofer, Helmut Prodinger
1993 J jnl
How to select a loser.
Discret. Math.
Helmut Prodinger
1993 J jnl
Multidimensional Digital Searching and Some New Parameters in Tries.
Int. J. Found. Comput. Sci.
Peter Kirschenhofer, Helmut Prodinger, Wojciech Szpankowski
1992 J jnl
Einige Kommentare zu einer bin-packing Aufgabe von W. Knödel.
Computing
Helmut Prodinger
1992 J jnl
External Internal Nodes in Digital Search Trees via Mellin Transforms.
SIAM J. Comput.
Helmut Prodinger
1992 A* conf
How to Count Quickly and Accurately: A Unified Analysis of Probabilistic Counting and Other Related Problems.
ICALP
Peter Kirschenhofer, Helmut Prodinger, Wojciech Szpankowski
1992 J jnl
Hypothetical Analyses: Approximate Counting in the Style of Knuth, Path Length in the Style of Flajolet.
Theor. Comput. Sci.
Helmut Prodinger
1992 J jnl
Probabilistic Modeling of Data Structures on Words: A Reply to Professor Andersson's Letter.
Theor. Comput. Sci.
Peter Kirschenhofer, Helmut Prodinger, Wojciech Szpankowski
1992 J jnl
Some analytic techniques for the investigation of the asymptotic behaviour of tree parameters.
Bull. EATCS
Helmut Prodinger
1991 J jnl
Approximate counting: an alternative approach.
RAIRO Theor. Informatics Appl.
Peter Kirschenhofer, Helmut Prodinger
1989 — conf
Digital Search Trees - Further Results on a Fundamental Data Structure.
IFIP Congress
Peter Kirschenhofer, Helmut Prodinger, Wojciech Szpankowski
1989 J jnl
On the Balance Property of Patricia Tries: External Path Length Viewpoint.
Theor. Comput. Sci.
Peter Kirschenhofer, Helmut Prodinger, Wojciech Szpankowski
1989 J jnl
On the variance of the external path length in a symmetric digital trie.
Discret. Appl. Math.
Peter Kirschenhofer, Helmut Prodinger, Wojciech Szpankowski
1988 A* conf
Do We Really Need to Balance Patricia Trees? (Extended Abstract).
ICALP
Peter Kirschenhofer, Helmut Prodinger, Wojciech Szpankowski
1988 J jnl
Further Results on Digital Search Trees.
Theor. Comput. Sci.
Peter Kirschenhofer, Helmut Prodinger
1987 J jnl
Level number sequences for trees.
Discret. Math.
Philippe Flajolet, Helmut Prodinger
1987 J jnl
On the Recursive Depth of Special Tree Traversal Algorithms
Inf. Comput.
Peter Kirschenhofer, Helmut Prodinger
1986 J jnl
Register Allocation for Unary-Binary Trees.
SIAM J. Comput.
Philippe Flajolet, Helmut Prodinger
1986 A* conf
Some Further Results on Digital Search Trees.
ICALP
Peter Kirschenhofer, Helmut Prodinger
1986 J jnl
Spanning tree formulas and chebyshev polynomials.
Graphs Comb.
Francis T. Boesch, Helmut Prodinger
1986 J jnl
The average height of the
Networks
Helmut Prodinger
1986 J jnl
Two selection problems revisited.
J. Comb. Theory A
Peter Kirschenhofer, Helmut Prodinger
1985 J jnl
Einige Bemerkungen zu einer Arbeit von W. Knödel über das mittlere Verhalten von on-line-Packungsalgorithmen.
J. Inf. Process. Cybern.
Helmut Prodinger
1984 J jnl
A short proof for a partition identity of Hwang and Wei.
Discret. Math.
Peter Kirschenhofer, Helmut Prodinger
1984 J jnl
Analysis of an Algorithm to Construct Fibonacci Partitions.
RAIRO Theor. Informatics Appl.
Helmut Prodinger
1984 J jnl
On the altitude of specified nodes in random trees.
J. Graph Theory
Helmut Prodinger
1984 A* conf
Recursion Depth Analysis for Specail Tree Traversal Algorithms.
ICALP
Peter Kirschenhofer, Helmut Prodinger
1984 J jnl
The Average Height of the Second Highest Leaf of a Planted Plane Tree.
Eur. J. Comb.
Helmut Prodinger
1983 J jnl
A correspondence between ordered trees and noncrossing partitions.
Discret. Math.
Helmut Prodinger
1983 J jnl
Non-repetitive sequences and gray code.
Discret. Math.
Helmut Prodinger
1983 J jnl
On monotone functions of tree structures.
Discret. Appl. Math.
Helmut Prodinger, Friedrich J. Urbanek
1983 J jnl
On the Number of Combinations without a Fixed Distance.
J. Comb. Theory A
Helmut Prodinger
1983 J jnl
Topologies on Free Monoids Induced by Families of Languages.
RAIRO Theor. Informatics Appl.
Helmut Prodinger
1982 J jnl
A note on a result of R. Kemp on R-typly rooted planted plane trees.
Computing
Helmut Prodinger
1982 J jnl
On the average hyperoscillations of planted plane trees.
Comb.
Peter Kirschenhofer, Helmut Prodinger
1980 J jnl
Congruences Defined by Languages and Filters
Inf. Control.
Helmut Prodinger
1980 J jnl
On the Interpolation of D0L-Sequences.
Theor. Comput. Sci.
Helmut Prodinger
1980 J jnl
Topologies on Free Monoids Induced by Closure Operators of a Special Type.
RAIRO Theor. Informatics Appl.
Helmut Prodinger
1979 J jnl
Infinite 0-1-sequences without long adjacent identical blocks.
Discret. Math.
Helmut Prodinger, Friedrich J. Urbanek
1979 J jnl
Language Operators Related to Init.
Theor. Comput. Sci.
Helmut Prodinger, Friedrich J. Urbanek
1979 J jnl
On a generalization of the dyck-language over a two letter alphabet.
Discret. Math.
Helmut Prodinger
1979 A* conf
On the Height of Derivation Trees.
ICALP
Werner Kuich, Helmut Prodinger, Friedrich J. Urbanek