default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHelmut Prodinger
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j170]Helmut Prodinger:
An online bin-packing problem with an underlying ternary structure. Ars Math. Contemp. 24(3): 3 (2024)- 2023
- [j169]Helmut Prodinger:
Skew Dyck paths without up-down-left. Art Discret. Appl. Math. 7(1): 1 (2023) - [j168]Zurab Janelidze
, Helmut Prodinger, Francois van Niekerk:
Combinatorics Arising from Lax Colimits of Posets. Order 40(3): 493-524 (2023) - 2022
- [j167]Helmut Prodinger:
Partial Skew Dyck Paths: A Kernel Method Approach. Graphs Comb. 38(5): 135 (2022) - 2021
- [j166]Nancy S. S. Gu, Helmut Prodinger:
Combinatorics on lattice paths in strips. Eur. J. Comb. 94: 103310 (2021) - 2020
- [j165]Horst Alzer, Helmut Prodinger:
Identities and Inequalities for Sums Involving Binomial Coefficients. Integers 20: A9 (2020)
2010 – 2019
- 2019
- [j164]Helmut Prodinger:
Logarithms of a binomial series: A Stirling number approach. Ars Math. Contemp. 17(1): 271-275 (2019) - [j163]Emrah Kiliç, Helmut Prodinger:
A wide class of Combinatorial matrices related with Reciprocal Pascal and Super Catalan matrices. Contributions Discret. Math. 14(1) (2019) - [j162]Martin Aumüller, Martin Dietzfelbinger, Clemens Heuberger, Daniel Krenn, Helmut Prodinger:
Dual-Pivot Quicksort: Optimality, Analysis and Zeros of Associated Lattice Paths. Comb. Probab. Comput. 28(4): 485-518 (2019) - [j161]Ivica Martinjak, Helmut Prodinger:
Complementary Families of the Fibonacci-Lucas Relations. Integers 19: A2 (2019) - 2018
- [j160]Horst Alzer, Helmut Prodinger:
On Ruehr's Identities. Ars Comb. 139: 247-254 (2018) - [j159]Benjamin Hackl, Helmut Prodinger:
Growing and Destroying Catalan-Stanley Trees. Discret. Math. Theor. Comput. Sci. 20(1) (2018) - [j158]Helmut Prodinger:
Ternary Smirnov Words and Generating Functions. Integers 18: A69 (2018) - [j157]Benjamin Hackl, Clemens Heuberger, Helmut Prodinger:
Reductions of binary trees and lattice paths induced by the register function. Theor. Comput. Sci. 705: 31-57 (2018) - [c20]Benjamin Hackl, Clemens Heuberger, Helmut Prodinger:
Counting Ascents in Generalized Dyck Paths. AofA 2018: 26:1-26:15 - [c19]Clemens Heuberger, Daniel Krenn, Helmut Prodinger:
Analysis of Summatory Functions of Regular Sequences: Transducer and Pascal's Rhombus. AofA 2018: 27:1-27:18 - 2017
- [j156]Uta R. Freiberg, Clemens Heuberger, Helmut Prodinger:
Application of Smirnov Words to Waiting Time Distributions of Runs. Electron. J. Comb. 24(3): 3 (2017) - [j155]Horst Alzer, Helmut Prodinger:
On Combinatorial Identities of Engbers and Stocker. Integers 17: A13 (2017) - [j154]Kamilla Oliver, Helmut Prodinger:
Summations in Bernoulli's Triangles via Generating Functions. J. Integer Seq. 20(1): 17.1.3 (2017) - [c18]Benjamin Hackl, Sara Kropf, Helmut Prodinger:
Iterative Cutting and Pruning of Planar Trees. ANALCO 2017: 66-72 - 2016
- [j153]Richard P. Brent, Hideyuki Ohtsuka, Judy-anne H. Osborn, Helmut Prodinger:
Some Binomial Sums Involving Absolute Values. J. Integer Seq. 19(3): 16.3.7 (2016) - [j152]Helmut Prodinger:
Returns, Hills, and t-ary Trees. J. Integer Seq. 19(7): 16.7.2 (2016) - [j151]Emrah Kiliç, Helmut Prodinger:
The generalized Lilbert matrix. Period. Math. Hung. 73(1): 62-72 (2016) - [j150]Helmut Prodinger:
Batcher's odd-even exchange revisited: A generating functions approach. Theor. Comput. Sci. 636: 95-100 (2016) - [i6]Martin Aumüller, Martin Dietzfelbinger, Clemens Heuberger, Daniel Krenn, Helmut Prodinger:
Counting Zeros in Random Walks on the Integers and Analysis of Optimal Dual-Pivot Quicksort. CoRR abs/1602.04031 (2016) - [i5]Martin Aumüller, Martin Dietzfelbinger, Clemens Heuberger, Daniel Krenn, Helmut Prodinger:
Dual-Pivot Quicksort: Optimality, Analysis and Zeros of Associated Lattice Paths. CoRR abs/1611.00258 (2016) - 2015
- [j149]Clemens Heuberger, Sara Kropf, Helmut Prodinger:
Output Sum of Transducers: Limiting Distribution and Periodic Fluctuation. Electron. J. Comb. 22(2): 2 (2015) - [j148]Aubrey Blecher, Charlotte A. C. Brennan, Arnold Knopfmacher, Helmut Prodinger:
The height and width of bargraphs. Discret. Appl. Math. 180: 36-44 (2015) - [j147]Helmut Prodinger, Stephan G. Wagner:
Bootstrapping and double-exponential limit laws. Discret. Math. Theor. Comput. Sci. 17(1): 123-144 (2015) - [j146]Emrah Kiliç, Helmut Prodinger:
Formulæ related to the \(q\) -Dixon formula with applications to Fibonomial sums. Period. Math. Hung. 70(2): 216-226 (2015) - 2014
- [j145]Roberto Tauraso, Helmut Prodinger:
New Multiple Harmonic Sum Identities. Electron. J. Comb. 21(2): 2 (2014) - [j144]Helmut Prodinger:
A Short Proof of Carlitz’s Bernoulli Number Identity. J. Integer Seq. 17(4): 14.4.1 (2014) - [j143]Emrah Kiliç, Helmut Prodinger:
A Note on the Conjecture of Ramirez and Sirvent. J. Integer Seq. 17(5): 14.5.8 (2014) - [j142]Helmut Prodinger:
Counting Palindromes According to r-Runs of Ones Using Generating Functions. J. Integer Seq. 17(6): 14.6.2 (2014) - 2013
- [j141]Helmut Prodinger:
An Identity Conjectured by Lacasse via the Tree Function. Electron. J. Comb. 20(3): 7 (2013) - [j140]Christian Elsholtz, Clemens Heuberger, Helmut Prodinger:
The Number of Huffman Codes, Compact Trees, and Sums of Unit Fractions. IEEE Trans. Inf. Theory 59(2): 1065-1075 (2013) - 2012
- [j139]Helmut Prodinger:
Set partitions, words, and approximate counting with black holes. Australas. J Comb. 54: 303- (2012) - [j138]Rosena R. X. Du, Helmut Prodinger:
Notes on protected nodes in digital search trees. Appl. Math. Lett. 25(6): 1025-1028 (2012) - [j137]Helmut Prodinger, Guy Louchard:
The Asymmetric Leader Election Algorithm with swedish stopping: A probabilistic analysis. Discret. Math. Theor. Comput. Sci. 14(2): 91-128 (2012) - [j136]Helmut Prodinger:
Dyck Paths with Parity Restrictions for the Final Runs to the Origin: a Study of the Height. Fundam. Informaticae 117(1-4): 279-285 (2012) - [j135]Emrah Kiliç, Helmut Prodinger:
The q-Pilbert matrix. Int. J. Comput. Math. 89(10): 1370-1377 (2012) - [j134]Guy Louchard, Helmut Prodinger, Mark Daniel Ward:
Number of survivors in the presence of a demon. Period. Math. Hung. 64(1): 101-117 (2012) - [j133]Helmut Prodinger:
Approximate counting with m counters: A detailed analysis. Theor. Comput. Sci. 439: 58-68 (2012) - 2011
- [j132]Helmut Prodinger:
Continued Fractions Related to (t,q)-Tangents and Variants. Electron. J. Comb. 18(2) (2011) - [j131]Roberto Maria Avanzi, Clemens Heuberger, Helmut Prodinger:
Redundant τ-adic expansions I: non-adjacent digit sets and their applications to scalar multiplication. Des. Codes Cryptogr. 58(2): 173-202 (2011) - [j130]Helmut Prodinger:
Digital search trees with m trees: Level polynomials and insertion costs. Discret. Math. Theor. Comput. Sci. 13(3): 1-8 (2011) - [j129]Helmut Prodinger, Carsten Schneider, Stephan G. Wagner:
Unfair permutations. Eur. J. Comb. 32(8): 1282-1298 (2011) - [j128]Helmut Prodinger:
The Intrinsic Periodic Behaviour of Sequences Related to a Rational Integral. Integers 11: A14 (2011) - [j127]Conrado Martínez, Alois Panholzer, Helmut Prodinger:
The analysis of Range Quickselect and related problems. Theor. Comput. Sci. 412(46): 6537-6555 (2011) - [c17]Guy Louchard, Conrado Martinez, Helmut Prodinger:
The Swedish Leader Election Protocol: Analysis and Variations. ANALCO 2011: 127-134 - [i4]Christian Elsholtz, Clemens Heuberger, Helmut Prodinger:
The number of Huffman codes, compact trees, and sums of unit fractions. CoRR abs/1108.5964 (2011) - 2010
- [j126]Nancy S. S. Gu, Helmut Prodinger:
One-parameter generalizations of Rogers-Ramanujan type identities. Adv. Appl. Math. 45(2): 149-196 (2010) - [j125]Helmut Prodinger:
Continued fraction expansions for q-tangent and q-cotangent functions. Discret. Math. Theor. Comput. Sci. 12(2): 47-64 (2010) - [j124]Guy Louchard, Helmut Prodinger:
Asymptotic results for silent elimination. Discret. Math. Theor. Comput. Sci. 12(2): 185-196 (2010) - [j123]Ligia Loreta Cristea, Helmut Prodinger:
q-Enumeration of words by their total variation. Discret. Math. Theor. Comput. Sci. 12(3): 139-150 (2010) - [j122]Nancy S. S. Gu, Helmut Prodinger, Stephan G. Wagner:
Bijections for a class of labeled plane trees. Eur. J. Comb. 31(3): 720-732 (2010) - [j121]Markus Kuba, Helmut Prodinger:
A Note on Stirling Series. Integers 10: A34 (2010) - [i3]Roberto Avanzi, Clemens Heuberger, Helmut Prodinger:
Arithmetic of Supersingular Koblitz Curves in Characteristic Three. IACR Cryptol. ePrint Arch. 2010: 436 (2010)
2000 – 2009
- 2009
- [j120]Markus Kuba, Alois Panholzer, Helmut Prodinger:
Lattice Paths, Sampling Without Replacement, and Limiting Distributions. Electron. J. Comb. 16(1) (2009) - [j119]Helmut Prodinger:
A simple bijection between a subclass of 2-binary trees and ternary trees. Discret. Math. 309(4): 959-961 (2009) - [j118]Nancy S. S. Gu, Helmut Prodinger:
Bijections for 2-plane trees and ternary trees. Eur. J. Comb. 30(4): 969-985 (2009) - [j117]Clemens Heuberger, Helmut Prodinger:
Analysis of complements in Multi-Exponentiation Algorithms Using Signed Digit Representations. Int. J. Found. Comput. Sci. 20(3): 443-453 (2009) - [j116]Conrado Martínez, Helmut Prodinger:
Moves and displacements of particular elements in Quicksort. Theor. Comput. Sci. 410(21-23): 2279-2284 (2009) - 2008
- [j115]Guy Louchard, Helmut Prodinger:
On gaps and unoccupied urns in sequences of geometrically distributed random variables. Discret. Math. 308(9): 1538-1562 (2008) - [j114]Helmut Prodinger:
The Location of the First Maximum in the First Sojourn of a Dyck Path. Discret. Math. Theor. Comput. Sci. 10(3) (2008) - [j113]Guy Louchard, Helmut Prodinger:
Generalized approximate counting revisited. Theor. Comput. Sci. 391(1-2): 109-125 (2008) - [c16]Conrado Martínez, Alois Panholzer, Helmut Prodinger:
Generating Random Derangements. ANALCO 2008: 234-240 - [i2]Roberto Maria Avanzi, Clemens Heuberger, Helmut Prodinger:
Redundant tau-adic Expansions I: Non-Adjacent Digit Sets and their Applications to Scalar Multiplication. IACR Cryptol. ePrint Arch. 2008: 148 (2008) - 2007
- [j112]Clemens Heuberger, Helmut Prodinger:
On α-greedy expansions of numbers. Adv. Appl. Math. 38(4): 505-525 (2007) - [j111]Arnold Knopfmacher, Helmut Prodinger:
The Last Descent In Samples Of Geometric Random Variables And Permutations. Ars Comb. 83 (2007) - [j110]Helmut Prodinger, Guy Louchard:
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. 9(1) (2007) - [j109]Clemens Heuberger, Helmut Prodinger:
The Hamming weight of the non-adjacent-form under various input statistics. Period. Math. Hung. 55(1): 81-96 (2007) - [j108]Alois Panholzer, Helmut Prodinger:
Level of nodes in increasing trees revisited. Random Struct. Algorithms 31(2): 203-226 (2007) - [c15]Guy Louchard, Helmut Prodinger:
Representations of Numbers as åk=-nn ek k\sum_{k=-n}^n \varepsilon_k k: A Saddle Point Approach. ILC 2007: 87-96 - 2006
- [j107]Roberto Maria Avanzi, Clemens Heuberger, Helmut Prodinger:
Scalar Multiplication on Koblitz Curves Using the Frobenius Endomorphism and Its Combination with Point Halving: Extensions and Mathematical Analysis. Algorithmica 46(3-4): 249-270 (2006) - [j106]Guy Louchard, Helmut Prodinger:
Asymptotics of the Moments of Extreme-Value Related Distribution Functions. Algorithmica 46(3-4): 431-467 (2006) - [j105]Arnold Knopfmacher, Helmut Prodinger:
The first descent in samples of geometric random variables and permutations. Discret. Math. Theor. Comput. Sci. 8(1): 215-234 (2006) - [j104]Helmut Prodinger:
d-records in geometrically distributed random variables. Discret. Math. Theor. Comput. Sci. 8(1): 273-284 (2006) - [j103]Margaret Archibald, Arnold Knopfmacher, Helmut Prodinger:
The number of distinct values in a geometrically distributed sample. Eur. J. Comb. 27(7): 1059-1081 (2006) - [j102]Michael Drmota, Helmut Prodinger:
The register function for t-ary trees. ACM Trans. Algorithms 2(3): 318-334 (2006) - [j101]Philippe Flajolet, Markus E. Nebel, Helmut Prodinger:
The scientific works of Rainer Kemp (1949-2004). Theor. Comput. Sci. 355(3): 371-381 (2006) - [c14]Roberto Maria Avanzi, Clemens Heuberger, Helmut Prodinger:
On Redundant tau -Adic Expansions and Non-adjacent Digit Sets. Selected Areas in Cryptography 2006: 285-301 - 2005
- [j100]Peter J. Grabner, Clemens Heuberger, Helmut Prodinger, Jörg M. Thuswaldner:
Analysis of linear combination algorithms in cryptography. ACM Trans. Algorithms 1(1): 123-142 (2005) - [j99]Clemens Heuberger, Rajendra S. Katti, Helmut Prodinger, Xiaoyu Ruan:
The alternating greedy expansion and applications to computing digit expansions from left-to-right in cryptography. Theor. Comput. Sci. 341(1-3): 55-72 (2005) - [c13]Roberto Maria Avanzi, Clemens Heuberger, Helmut Prodinger:
Minimality of the Hamming Weight of the T-NAF for Koblitz Curves and Improved Combination with Point Halving. Selected Areas in Cryptography 2005: 332-344 - [i1]Roberto Maria Avanzi, Clemens Heuberger, Helmut Prodinger:
Minimality of the Hamming Weight of the \tau-NAF for Koblitz Curves and Improved Combination with Point Halving. IACR Cryptol. ePrint Arch. 2005: 225 (2005) - 2004
- [j98]Kate Morris, Alois Panholzer, Helmut Prodinger:
On Some Parameters in Heap Ordered Trees. Comb. Probab. Comput. 13(4-5): 677-696 (2004) - [j97]Alois Panholzer, Helmut Prodinger:
Analysis of some statistics for increasing tree families. Discret. Math. Theor. Comput. Sci. 6(2): 437-460 (2004) - [j96]Alois Panholzer, Helmut Prodinger, Marko Riedel:
Permuting in place: analysis of two stopping rules. J. Algorithms 51(2): 170-184 (2004) - [j95]Peter J. Grabner, Clemens Heuberger, Helmut Prodinger:
Distribution results for low-weight binary representations for pairs of integers. Theor. Comput. Sci. 319(1-3): 307-331 (2004) - [c12]Helmut Prodinger:
Compositions and Patricia Tries: No Fluctuations in the Variance! ALENEX/ANALC 2004: 211-215 - 2003
- [j94]Peter Paule, Helmut Prodinger:
Fountains, histograms, and q-identities. Discret. Math. Theor. Comput. Sci. 6(1): 101-106 (2003) - [j93]Clemens Heuberger, Helmut Prodinger:
Carry propagation in signed digit representations. Eur. J. Comb. 24(3): 293-320 (2003) - [j92]Guy Louchard, Helmut Prodinger:
Random 0-1 rectangular matrices: a probabilistic analysis. Period. Math. Hung. 47(1-2): 169-193 (2003) - [j91]Peter J. Grabner, Arnold Knopfmacher, Helmut Prodinger:
Combinatorics of geometrically distributed random variables: run statistics. Theor. Comput. Sci. 297(1-3): 261-270 (2003) - [j90]Guy Louchard, Helmut Prodinger:
Ascending runs of sequences of geometrically distributed random variables: a probabilistic analysis. Theor. Comput. Sci. 304(1-3): 59-86 (2003) - [j89]Emeric Deutsch, Helmut Prodinger:
A bijection between directed column-convex polyominoes and ordered trees of height at most three. Theor. Comput. Sci. 307(2): 319-325 (2003) - 2002
- [j88]Helmut Prodinger:
On the Analysis of an Algorithm to Generate a Random Cyclic Permutation. Ars Comb. 65 (2002) - [j87]Alois Panholzer, Helmut Prodinger:
Bijections for ternary trees and non-crossing trees. Discret. Math. 250(1-3): 181-195 (2002) - [j86]Helmut Prodinger:
Combinatorics of geometrically distributed random variables: value and position of large left-to-right maxima. Discret. Math. 254(1-3): 459-471 (2002) - [j85]Guy Louchard, Helmut Prodinger:
Probabilistic Analysis of Carlitz Compositions. Discret. Math. Theor. Comput. Sci. 5(1): 71-96 (2002) - [j84]Michael Drmota, Helmut Prodinger:
The height of q-Binary Search Trees. Discret. Math. Theor. Comput. Sci. 5(1): 97-108 (2002) - [j83]Helmut Prodinger, Brigitte Vallée:
Preface. J. Algorithms 44(1): 1-3 (2002) - [j82]Friedrich Hubalek, Hsien-Kuei Hwang, William Lew, Hosam M. Mahmoud, Helmut Prodinger:
A multivariate view of random bucket digital search trees. J. Algorithms 44(1): 121-158 (2002) - [j81]Leonard Smiley, Helmut Prodinger, Robin Chapman, et al.:
A Tree-Counting Identity: 10781. Am. Math. Mon. 109(3): 300-301 (2002) - [j80]Peter J. Grabner, Helmut Prodinger:
Sorting algorithms for broadcast communications: mathematical analysis. Theor. Comput. Sci. 289(1): 51-67 (2002) - [j79]Helmut Prodinger, Wojciech Szpankowski:
Optimal versus randomized search of fixed length binary words. IEEE Trans. Inf. Theory 48(9): 2614-2621 (2002) - 2001
- [j78]Helmut Prodinger, Wojciech Szpankowski:
Average-Case Analysis of Algorithms - Preface. Algorithmica 29(1): 1-2 (2001) - [j77]Conrado Martinez, Alois Panholzer, Helmut Prodinger:
Partial Match Queries in Relaxed Multidimensional Search Trees. Algorithmica 29(1): 181-204 (2001) - [j76]Helmut Prodinger:
A q-Analogue of the Path Length of Binary Search Trees. Algorithmica 31(3): 433-441 (2001) - [j75]Arnold Knopfmacher, Helmut Prodinger:
A Simple Card Guessing Game Revisited. Electron. J. Comb. 8(2) (2001) - [j74]Clemens Heuberger, Helmut Prodinger:
On Minimal Expansions in Redundant Number Systems: Algorithms and Quantitative Analysis. Computing 66(4): 377-393 (2001) - [j73]Arnold Knopfmacher, Helmut Prodinger:
Combinatorics of geometrically distributed random variables: Value and position of the rth left-to-right maximum. Discret. Math. 226(1-3): 255-267 (2001) - [j72]Guy Louchard, Helmut Prodinger:
Ascending runs of sequences of geometrically distributed random variables: a probabilistic analysis. Electron. Notes Discret. Math. 10: 181-186 (2001) - [j71]Helmut Prodinger:
Some applications of the q-Rice formula. Random Struct. Algorithms 19(3-4): 552-557 (2001) - [c11]Helmut Prodinger:
Words, Dyck Paths, Trees, and Bijections. Words, Semigroups, and Transductions 2001: 369-379 - [c10]Helmut Prodinger:
Words, Permutations, and Representations of Numbers. Developments in Language Theory 2001: 81-99 - 2000
- [j70]Helmut Prodinger:
A q-analogue of a formula of Hernandez obtained by inverting a result of Dilcher. Australas. J Comb. 21: 271-274 (2000) - [j69]John W. Moon, Helmut Prodinger:
A Bijective Proof of an Identity Concerning Nodes of Fixed Degree in Planted Trees. Ars Comb. 55 (2000) - [c9]Peter J. Grabner, Arnold Knopfmacher, Helmut Prodinger:
Run Statistics for Geometrically Distributed Random Variables (Extended Abstract). LATIN 2000: 457-462 - [c8]Helmut Prodinger:
Combinatorics of Geometrically Distributed Random Variables: Lenght of Ascending Runs. LATIN 2000: 473-482
1990 – 1999
- 1999
- [j68]Philippe Flajolet, Helmut Prodinger:
On Stirling Numbers for Complex Arguments and Hankel Contours. SIAM J. Discret. Math. 12(2): 155-159 (1999) - 1998
- [j67]Helmut Prodinger, Wojciech Szpankowski:
Philippe Flajolet's Research in Analysis of Algorithms and Combinatorics. Algorithmica 22(4): 366-387 (1998) - [j66]Alois Panholzer, Helmut Prodinger:
Average-Case Analysis of Priority Trees: A Structure for Priority Queue Administration. Algorithmica 22(4): 600-630 (1998) - [j65]Alois Panholzer, Helmut Prodinger:
Towards a More Precise Analysis of an Algorithm to Generate Binary Trees: A Tutorial. Comput. J. 41(3): 201-204 (1998) - [j64]Conrado Martinez, Alois Panholzer, Helmut Prodinger:
On the Number of Descendants and Ascendants in Random Search Trees. Electron. J. Comb. 5 (1998) - [j63]Peter Kirschenhofer, Helmut Prodinger:
Comparisons in Hoare's Find Algorithm. Comb. Probab. Comput. 7(1): 111-120 (1998) - [j62]Arnold Knopfmacher, Helmut Prodinger:
On Carlitz Compositions. Eur. J. Comb. 19(5): 579-589 (1998) - [j61]Peter J. Grabner, Helmut Prodinger:
An Asymptotic Study of a Recursion Occurring in the Analysis of an Algorithm on Broadcast Communication. Inf. Process. Lett. 65(2): 89-93 (1998) - [j60]Alois Panholzer, Helmut Prodinger:
A generating functions approach for the analysis of grand averages for multiple QUICKSELECT. Random Struct. Algorithms 13(3-4): 189-209 (1998) - 1997
- [j59]Peter J. Grabner, Helmut Prodinger:
Maximum Statistics of N Random Variables Distributed by the Negative Binomial Distribution. Comb. Probab. Comput. 6(2): 179-183 (1997) - [j58]Xavier Gourdon, Helmut Prodinger:
A generating function approach to random subgraphs of the n-cycle. Discret. Math. 169(1-3): 227-232 (1997) - [j57]Alois Panholzer, Helmut Prodinger:
Descendants and ascendants in binary trees. Discret. Math. Theor. Comput. Sci. 1(2): 247-266 (1997) - [j56]Peter Kirschenhofer, Helmut Prodinger, Conrado Martinez:
Analysis of Hoare's FIND algorithm with Median-of-three partition. Random Struct. Algorithms 10(1-2): 143-156 (1997) - [j55]Helmut Prodinger:
On a Problem of Yekutieli and Mandelbrot about the Bifurcation Ratio of Binary Trees. Theor. Comput. Sci. 181(1): 181-194 (1997) - 1996
- [j54]Helmut Prodinger:
Descendants in heap ordered trees or a triumph of computer algebra. Electron. J. Comb. 3(1) (1996) - [j53]Helmut Prodinger:
Combinatorics of geometrically distributed random variables: Left-to-right maxima. Discret. Math. 153(1-3): 253-270 (1996) - [j52]Helmut Prodinger:
Depth and Path Length of Heap Ordered Trees. Int. J. Found. Comput. Sci. 7(3): 293-299 (1996) - [j51]Peter J. Grabner, Helmut Prodinger:
On the Optimality of an Algorithm of Reingold and Supowit. J. Autom. Lang. Comb. 1(1): 5-11 (1996) - [j50]Peter Kirschenhofer, Helmut Prodinger, Wojciech Szpankowski:
Analysis of a splitting process arising in probabilistic counting and other related algorithms. Random Struct. Algorithms 9(4): 379-401 (1996) - 1995
- [j49]Wolfgang Panny, Helmut Prodinger:
Bottom-Up Mergesort - a Detailed Analysis. Algorithmica 14(4): 340-354 (1995) - [j48]Helmut Prodinger:
Digital search trees and basic hypergeometric functions. Bull. EATCS 56 (1995) - [j47]Helmut Prodinger:
Multiple Quickselect - Hoare's Find Algorithm for Several Elements. Inf. Process. Lett. 56(3): 123-129 (1995) - [j46]Helmut Prodinger:
Comments on the Analysis of Parameters in a Random Graph Model. RAIRO Theor. Informatics Appl. 29(3): 245-253 (1995) - [j45]Peter Kirschenhofer, Conrado Martinez, Helmut Prodinger:
Analysis of an Optimized Search Algorithm for Skip Lists. Theor. Comput. Sci. 144(1&2): 199-220 (1995) - [c7]Helmut Prodinger:
Solution of a Problem of Yekutieli and Mandelbrot. LATIN 1995: 461-468 - 1994
- [j44]Peter Kirschenhofer, Helmut Prodinger:
The Path Length of Random Skip Lists. Acta Informatica 31(8): 775-792 (1994) - [j43]Helmut Prodinger:
Some Polynomials Related to the Fibonacci Polynomials. Bull. EATCS 53: 248-250 (1994) - [j42]Helmut Prodinger:
An Asymptotic Comment on a Paper by Analyti and Pramanik. Inf. Process. Lett. 49(6): 327-328 (1994) - [j41]Peter Kirschenhofer, Helmut Prodinger:
Multidimensional Digital Searching-Alternative Data Structures. Random Struct. Algorithms 5(1): 123-134 (1994) - [j40]Peter Kirschenhofer, Helmut Prodinger, Wojciech Szpankowski:
Digital Search Trees Again Revisited: The Internal Path Length Perspective. SIAM J. Comput. 23(3): 598-616 (1994) - [j39]Philippe Flajolet, Peter J. Grabner, Peter Kirschenhofer, Helmut Prodinger, Robert F. Tichy:
Mellin Transforms and Asymptotics: Digital Sums. Theor. Comput. Sci. 123(2): 291-314 (1994) - 1993
- [j38]Peter Kirschenhofer, Helmut Prodinger:
A result in order statistics related to probabilistic counting. Computing 51(1): 15-27 (1993) - [j37]Helmut Prodinger:
How to select a loser. Discret. Math. 120(1-3): 149-159 (1993) - [j36]Peter Kirschenhofer, Helmut Prodinger, Wojciech Szpankowski:
Multidimensional Digital Searching and Some New Parameters in Tries. Int. J. Found. Comput. Sci. 4(1): 69-84 (1993) - [j35]Helmut Prodinger, Wojciech Szpankowski:
A Note on Binomial Recurrences Arising in the Analysis of Algorithms. Inf. Process. Lett. 46(6): 309-311 (1993) - [j34]Philippe Flajolet, Bruno Salvy, Helmut Prodinger:
A Finite Sum of Products of Binomial Coefficients (C. C. Grosjean). SIAM Rev. 35(4): 645-647 (1993) - 1992
- [j33]Helmut Prodinger:
Einige Kommentare zu einer bin-packing Aufgabe von W. Knödel. Computing 47(3-4): 247-254 (1992) - [j32]Helmut Prodinger:
Some analytic techniques for the investigation of the asymptotic behaviour of tree parameters. Bull. EATCS 47: 180-199 (1992) - [j31]Helmut Prodinger:
External Internal Nodes in Digital Search Trees via Mellin Transforms. SIAM J. Comput. 21(6): 1180-1183 (1992) - [j30]Helmut Prodinger:
Hypothetical Analyses: Approximate Counting in the Style of Knuth, Path Length in the Style of Flajolet. Theor. Comput. Sci. 100(1): 243-251 (1992) - [j29]Peter Kirschenhofer, Helmut Prodinger, Wojciech Szpankowski:
Probabilistic Modeling of Data Structures on Words: A Reply to Professor Andersson's Letter. Theor. Comput. Sci. 106(2): 395-400 (1992) - [c6]Peter Kirschenhofer, Helmut Prodinger, Wojciech Szpankowski:
How to Count Quickly and Accurately: A Unified Analysis of Probabilistic Counting and Other Related Problems. ICALP 1992: 211-222 - 1991
- [j28]Peter Kirschenhofer, Helmut Prodinger:
Approximate counting: an alternative approach. RAIRO Theor. Informatics Appl. 25: 43-48 (1991)
1980 – 1989
- 1989
- [j27]Peter Kirschenhofer, Helmut Prodinger, Wojciech Szpankowski:
On the variance of the external path length in a symmetric digital trie. Discret. Appl. Math. 25(1-2): 129-143 (1989) - [j26]Peter Kirschenhofer, Helmut Prodinger, Wojciech Szpankowski:
On the Balance Property of Patricia Tries: External Path Length Viewpoint. Theor. Comput. Sci. 68(1): 1-17 (1989) - [c5]Peter Kirschenhofer, Helmut Prodinger, Wojciech Szpankowski:
Digital Search Trees - Further Results on a Fundamental Data Structure. IFIP Congress 1989: 443-447 - 1988
- [j25]Peter Kirschenhofer, Helmut Prodinger:
Further Results on Digital Search Trees. Theor. Comput. Sci. 58: 143-154 (1988) - [c4]Peter Kirschenhofer, Helmut Prodinger, Wojciech Szpankowski:
Do We Really Need to Balance Patricia Trees? (Extended Abstract). ICALP 1988: 302-316 - 1987
- [j24]Philippe Flajolet, Helmut Prodinger:
Level number sequences for trees. Discret. Math. 65(2): 149-156 (1987) - [j23]Peter Kirschenhofer, Helmut Prodinger:
On the Recursive Depth of Special Tree Traversal Algorithms. Inf. Comput. 74(1): 15-32 (1987) - 1986
- [j22]Francis T. Boesch, Helmut Prodinger:
Spanning tree formulas and chebyshev polynomials. Graphs Comb. 2(1): 191-200 (1986) - [j21]Peter Kirschenhofer, Helmut Prodinger:
Two selection problems revisited. J. Comb. Theory A 42(2): 310-316 (1986) - [j20]Helmut Prodinger:
The average height of the d-th highest leaf of a planted plane tree. Networks 16(1): 67-75 (1986) - [j19]Philippe Flajolet, Helmut Prodinger:
Register Allocation for Unary-Binary Trees. SIAM J. Comput. 15(3): 629-640 (1986) - [c3]Peter Kirschenhofer, Helmut Prodinger:
Some Further Results on Digital Search Trees. ICALP 1986: 177-185 - 1985
- [j18]Helmut Prodinger:
Einige Bemerkungen zu einer Arbeit von W. Knödel über das mittlere Verhalten von on-line-Packungsalgorithmen. J. Inf. Process. Cybern. 21(1/2): 3-7 (1985) - 1984
- [j17]Peter Kirschenhofer, Helmut Prodinger:
A short proof for a partition identity of Hwang and Wei. Discret. Math. 52(2-3): 305-306 (1984) - [j16]Helmut Prodinger:
The Average Height of the Second Highest Leaf of a Planted Plane Tree. Eur. J. Comb. 5(4): 351-357 (1984) - [j15]Helmut Prodinger:
Analysis of an Algorithm to Construct Fibonacci Partitions. RAIRO Theor. Informatics Appl. 18(4): 387-394 (1984) - [j14]Helmut Prodinger:
On the altitude of specified nodes in random trees. J. Graph Theory 8(4): 481-485 (1984) - [c2]Peter Kirschenhofer, Helmut Prodinger:
Recursion Depth Analysis for Specail Tree Traversal Algorithms. ICALP 1984: 303-311 - 1983
- [j13]Helmut Prodinger, Friedrich J. Urbanek:
On monotone functions of tree structures. Discret. Appl. Math. 5(2): 223-239 (1983) - [j12]Helmut Prodinger:
Non-repetitive sequences and gray code. Discret. Math. 43(1): 113-116 (1983) - [j11]Helmut Prodinger:
A correspondence between ordered trees and noncrossing partitions. Discret. Math. 46(2): 205-206 (1983) - [j10]Helmut Prodinger:
Topologies on Free Monoids Induced by Families of Languages. RAIRO Theor. Informatics Appl. 17(3): 285-290 (1983) - [j9]Helmut Prodinger:
On the Number of Combinations without a Fixed Distance. J. Comb. Theory A 35(3): 362-365 (1983) - 1982
- [j8]Peter Kirschenhofer, Helmut Prodinger:
On the average hyperoscillations of planted plane trees. Comb. 2(2): 177-186 (1982) - [j7]Helmut Prodinger:
A note on a result of R. Kemp on R-typly rooted planted plane trees. Computing 28(4): 363-366 (1982) - 1980
- [j6]Helmut Prodinger:
Congruences Defined by Languages and Filters. Inf. Control. 44(1): 36-46 (1980) - [j5]Helmut Prodinger:
Topologies on Free Monoids Induced by Closure Operators of a Special Type. RAIRO Theor. Informatics Appl. 14(2): 225-237 (1980) - [j4]Helmut Prodinger:
On the Interpolation of D0L-Sequences. Theor. Comput. Sci. 10: 107-108 (1980)
1970 – 1979
- 1979
- [j3]Helmut Prodinger:
On a generalization of the dyck-language over a two letter alphabet. Discret. Math. 28(3): 269-276 (1979) - [j2]Helmut Prodinger, Friedrich J. Urbanek:
Infinite 0-1-sequences without long adjacent identical blocks. Discret. Math. 28(3): 277-289 (1979) - [j1]Helmut Prodinger, Friedrich J. Urbanek:
Language Operators Related to Init. Theor. Comput. Sci. 8: 161-175 (1979) - [c1]Werner Kuich, Helmut Prodinger, Friedrich J. Urbanek:
On the Height of Derivation Trees. ICALP 1979: 370-384
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-22 01:10 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
