| 2009 |
|---|
| 112 | EE | Conrado Martínez,
Helmut Prodinger:
Moves and displacements of particular elements in Quicksort.
Theor. Comput. Sci. 410(21-23): 2279-2284 (2009) |
| 2008 |
|---|
| 111 | EE | Guy Louchard,
Helmut Prodinger:
On gaps and unoccupied urns in sequences of geometrically distributed random variables.
Discrete Mathematics 308(9): 1538-1562 (2008) |
| 110 | EE | Guy Louchard,
Helmut Prodinger:
Generalized approximate counting revisited.
Theor. Comput. Sci. 391(1-2): 109-125 (2008) |
| 2007 |
|---|
| 109 | | Arnold Knopfmacher,
Helmut Prodinger:
The Last Descent In Samples Of Geometric Random Variables And Permutations.
Ars Comb. 83: (2007) |
| 108 | EE | Alois Panholzer,
Helmut Prodinger:
Level of nodes in increasing trees revisited.
Random Struct. Algorithms 31(2): 203-226 (2007) |
| 2006 |
|---|
| 107 | EE | Roberto Maria Avanzi,
Clemens Heuberger,
Helmut Prodinger:
On Redundant tau -Adic Expansions and Non-adjacent Digit Sets.
Selected Areas in Cryptography 2006: 285-301 |
| 106 | EE | Michael Drmota,
Helmut Prodinger:
The register function for t-ary trees.
ACM Transactions on Algorithms 2(3): 318-334 (2006) |
| 105 | EE | 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) |
| 104 | EE | Guy Louchard,
Helmut Prodinger:
Asymptotics of the Moments of Extreme-Value Related Distribution Functions.
Algorithmica 46(3-4): 431-467 (2006) |
| 103 | EE | Arnold Knopfmacher,
Helmut Prodinger:
The first descent in samples of geometric random variables and permutations.
Discrete Mathematics & Theoretical Computer Science 8(1): 215-234 (2006) |
| 102 | | Helmut Prodinger:
d-records in geometrically distributed random variables.
Discrete Mathematics & Theoretical Computer Science 8(1): 273-284 (2006) |
| 101 | EE | Margaret Archibald,
Arnold Knopfmacher,
Helmut Prodinger:
The number of distinct values in a geometrically distributed sample.
Eur. J. Comb. 27(7): 1059-1081 (2006) |
| 100 | EE | Philippe Flajolet,
Markus E. Nebel,
Helmut Prodinger:
The scientific works of Rainer Kemp (1949-2004).
Theor. Comput. Sci. 355(3): 371-381 (2006) |
| 2005 |
|---|
| 99 | EE | 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 |
| 98 | EE | Peter J. Grabner,
Clemens Heuberger,
Helmut Prodinger,
Jörg M. Thuswaldner:
Analysis of linear combination algorithms in cryptography.
ACM Transactions on Algorithms 1(1): 123-142 (2005) |
| 97 | EE | 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) |
| 2004 |
|---|
| 96 | | Helmut Prodinger:
Compositions and Patricia Tries: No Fluctuations in the Variance!
ALENEX/ANALC 2004: 211-215 |
| 95 | EE | Kate Morris,
Alois Panholzer,
Helmut Prodinger:
On Some Parameters in Heap Ordered Trees.
Combinatorics, Probability & Computing 13(4-5): 677-696 (2004) |
| 94 | EE | Alois Panholzer,
Helmut Prodinger:
Analysis of some statistics for increasing tree families.
Discrete Mathematics & Theoretical Computer Science 6(2): 437-460 (2004) |
| 93 | EE | Alois Panholzer,
Helmut Prodinger,
Marko Riedel:
Permuting in place: analysis of two stopping rules.
J. Algorithms 51(2): 170-184 (2004) |
| 92 | EE | 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) |
| 2003 |
|---|
| 91 | EE | Peter Paule,
Helmut Prodinger:
Fountains, histograms, and q-identities.
Discrete Mathematics & Theoretical Computer Science 6(1): 101-106 (2003) |
| 90 | EE | Clemens Heuberger,
Helmut Prodinger:
Carry propagation in signed digit representations.
Eur. J. Comb. 24(3): 293-320 (2003) |
| 89 | EE | Guy Louchard,
Helmut Prodinger:
Ascending runs of sequences of geometrically distributed random variables: a probabilistic analysis.
Theor. Comput. Sci. 1-3(304): 59-86 (2003) |
| 88 | EE | Peter J. Grabner,
Arnold Knopfmacher,
Helmut Prodinger:
Combinatorics of geometrically distributed random variables: run statistics.
Theor. Comput. Sci. 297(1-3): 261-270 (2003) |
| 87 | EE | 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 |
|---|
| 86 | | Helmut Prodinger:
On the Analysis of an Algorithm to Generate a Random Cyclic Permutation.
Ars Comb. 65: (2002) |
| 85 | EE | Alois Panholzer,
Helmut Prodinger:
Bijections for ternary trees and non-crossing trees.
Discrete Mathematics 250(1-3): 181-195 (2002) |
| 84 | EE | Helmut Prodinger:
Combinatorics of geometrically distributed random variables: value and position of large left-to-right maxima.
Discrete Mathematics 254(1-3): 459-471 (2002) |
| 83 | EE | Guy Louchard,
Helmut Prodinger:
Probabilistic Analysis of Carlitz Compositions.
Discrete Mathematics & Theoretical Computer Science 5(1): 71-96 (2002) |
| 82 | EE | Michael Drmota,
Helmut Prodinger:
The height of q-Binary Search Trees.
Discrete Mathematics & Theoretical Computer Science 5(1): 97-108 (2002) |
| 81 | | Helmut Prodinger,
Wojciech Szpankowski:
Optimal versus randomized search of fixed length binary words.
IEEE Transactions on Information Theory 48(9): 2614-2621 (2002) |
| 80 | EE | Helmut Prodinger,
Brigitte Vallée:
Preface.
J. Algorithms 44(1): 1-3 (2002) |
| 79 | EE | 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) |
| 78 | | Peter J. Grabner,
Helmut Prodinger:
Sorting algorithms for broadcast communications: mathematical analysis.
Theor. Comput. Sci. 289(1): 51-67 (2002) |
| 2001 |
|---|
| 77 | EE | Helmut Prodinger:
Words, Permutations, and Representations of Numbers.
Developments in Language Theory 2001: 81-99 |
| 76 | | Helmut Prodinger:
Words, Dyck Paths, Trees, and Bijections.
Words, Semigroups, and Transductions 2001: 369-379 |
| 75 | EE | Helmut Prodinger,
Wojciech Szpankowski:
Average-Case Analysis of Algorithms - Preface.
Algorithmica 29(1): 1-2 (2001) |
| 74 | EE | Conrado Martinez,
Alois Panholzer,
Helmut Prodinger:
Partial Match Queries in Relaxed Multidimensional Search Trees.
Algorithmica 29(1): 181-204 (2001) |
| 73 | EE | Helmut Prodinger:
A q-Analogue of the Path Length of Binary Search Trees.
Algorithmica 31(3): 433-441 (2001) |
| 72 | EE | Clemens Heuberger,
Helmut Prodinger:
On Minimal Expansions in Redundant Number Systems: Algorithms and Quantitative Analysis.
Computing 66(4): 377-393 (2001) |
| 71 | EE | Arnold Knopfmacher,
Helmut Prodinger:
Combinatorics of geometrically distributed random variables: Value and position of the rth left-to-right maximum.
Discrete Mathematics 226(1-3): 255-267 (2001) |
| 70 | EE | Arnold Knopfmacher,
Helmut Prodinger:
A Simple Card Guessing Game Revisited.
Electr. J. Comb. 8(2): (2001) |
| 69 | EE | Guy Louchard,
Helmut Prodinger:
Ascending runs of sequences of geometrically distributed random variables: a probabilistic analysis.
Electronic Notes in Discrete Mathematics 10: 181-186 (2001) |
| 68 | | Helmut Prodinger:
Some applications of the q-Rice formula.
Random Struct. Algorithms 19(3-4): 552-557 (2001) |
| 2000 |
|---|
| 67 | | Peter J. Grabner,
Arnold Knopfmacher,
Helmut Prodinger:
Run Statistics for Geometrically Distributed Random Variables (Extended Abstract).
LATIN 2000: 457-462 |
| 66 | | Helmut Prodinger:
Combinatorics of Geometrically Distributed Random Variables: Lenght of Ascending Runs.
LATIN 2000: 473-482 |
| 65 | | John W. Moon,
Helmut Prodinger:
A Bijective Proof of an Identity Concerning Nodes of Fixed Degree in Planted Trees.
Ars Comb. 55: (2000) |
| 1999 |
|---|
| 64 | EE | Philippe Flajolet,
Helmut Prodinger:
On Stirling Numbers for Complex Arguments and Hankel Contours.
SIAM J. Discrete Math. 12(2): 155-159 (1999) |
| 1998 |
|---|
| 63 | EE | Helmut Prodinger,
Wojciech Szpankowski:
Philippe Flajolet's Research in Analysis of Algorithms and Combinatorics.
Algorithmica 22(4): 366-387 (1998) |
| 62 | EE | Alois Panholzer,
Helmut Prodinger:
Average-Case Analysis of Priority Trees: A Structure for Priority Queue Administration.
Algorithmica 22(4): 600-630 (1998) |
| 61 | | Peter Kirschenhofer,
Helmut Prodinger:
Comparisons in Hoare's Find Algorithm.
Combinatorics, Probability & Computing 7(1): 111-120 (1998) |
| 60 | | 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) |
| 59 | EE | Conrado Martinez,
Alois Panholzer,
Helmut Prodinger:
On the Number of Descendants and Ascendants in Random Search Trees.
Electr. J. Comb. 5: (1998) |
| 58 | EE | Arnold Knopfmacher,
Helmut Prodinger:
On Carlitz Compositions.
Eur. J. Comb. 19(5): 579-589 (1998) |
| 57 | EE | 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) |
| 56 | | 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 |
|---|
| 55 | | Peter J. Grabner,
Helmut Prodinger:
Maximum Statistics of N Random Variables Distributed by the Negative Binomial Distribution.
Combinatorics, Probability & Computing 6(2): 179-183 (1997) |
| 54 | EE | Xavier Gourdon,
Helmut Prodinger:
A generating function approach to random subgraphs of the n-cycle.
Discrete Mathematics 169(1-3): 227-232 (1997) |
| 53 | EE | Alois Panholzer,
Helmut Prodinger:
Descendants and ascendants in binary trees.
Discrete Mathematics & Theoretical Computer Science 1(2): 247-266 (1997) |
| 52 | | 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) |
| 51 | EE | 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 |
|---|
| 50 | EE | Helmut Prodinger:
Combinatorics of geometrically distributed random variables: Left-to-right maxima.
Discrete Mathematics 153(1-3): 253-270 (1996) |
| 49 | EE | Helmut Prodinger:
Descendants in heap ordered trees or a triumph of computer algebra.
Electr. J. Comb. 3(1): (1996) |
| 48 | | Helmut Prodinger:
Depth and Path Length of Heap Ordered Trees.
Int. J. Found. Comput. Sci. 7(3): 293-299 (1996) |
| 47 | | Peter J. Grabner,
Helmut Prodinger:
On the Optimality of an Algorithm of Reingold and Supowit.
Journal of Automata, Languages and Combinatorics 1(1): 5-12 (1996) |
| 46 | | 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 |
|---|
| 45 | | Helmut Prodinger:
Solution of a Problem of Yekutieli and Mandelbrot.
LATIN 1995: 461-468 |
| 44 | | Wolfgang Panny,
Helmut Prodinger:
Bottom-Up Mergesort - a Detailed Analysis.
Algorithmica 14(4): 340-354 (1995) |
| 43 | | Helmut Prodinger:
Digital search trees and basic hypergeometric functions.
Bulletin of the EATCS 56: (1995) |
| 42 | | Helmut Prodinger:
Comments on the Analysis of Parameters in a Random Graph Model.
ITA 29(3): 245-253 (1995) |
| 41 | EE | Helmut Prodinger:
Multiple Quickselect - Hoare's Find Algorithm for Several Elements.
Inf. Process. Lett. 56(3): 123-129 (1995) |
| 40 | EE | Peter Kirschenhofer,
Conrado Martinez,
Helmut Prodinger:
Analysis of an Optimized Search Algorithm for Skip Lists.
Theor. Comput. Sci. 144(1&2): 199-220 (1995) |
| 1994 |
|---|
| 39 | | Peter Kirschenhofer,
Helmut Prodinger:
The Path Length of Random Skip Lists.
Acta Inf. 31(8): 775-792 (1994) |
| 38 | | Helmut Prodinger:
Some Polynomials Related to the Fibonacci Polynomials.
Bulletin of the EATCS 53: 248-250 (1994) |
| 37 | | Helmut Prodinger:
An Asymptotic Comment on a Paper by Analyti and Pramanik.
Inf. Process. Lett. 49(6): 327-328 (1994) |
| 36 | | Peter Kirschenhofer,
Helmut Prodinger:
Multidimensional Digital Searching-Alternative Data Structures.
Random Struct. Algorithms 5(1): 123-134 (1994) |
| 35 | | Peter Kirschenhofer,
Helmut Prodinger,
Wojciech Szpankowski:
Digital Search Trees Again Revisited: The Internal Path Length Perspective.
SIAM J. Comput. 23(3): 598-616 (1994) |
| 34 | | 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 |
|---|
| 33 | EE | Helmut Prodinger:
How to select a loser.
Discrete Mathematics 120(1-3): 149-159 (1993) |
| 32 | | Helmut Prodinger,
Wojciech Szpankowski:
A Note on Binomial Recurrences Arising in the Analysis of Algorithms.
Inf. Process. Lett. 46(6): 309-311 (1993) |
| 31 | | 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) |
| 1992 |
|---|
| 30 | | 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 |
| 29 | | Helmut Prodinger:
Some analytic techniques for the investigation of the asymptotic behaviour of tree parameters.
Bulletin of the EATCS 47: 180-199 (1992) |
| 28 | | Helmut Prodinger:
External Internal Nodes in Digital Search Trees via Mellin Transforms.
SIAM J. Comput. 21(6): 1180-1183 (1992) |
| 27 | | 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) |
| 26 | | 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) |
| 1991 |
|---|
| 25 | | Peter Kirschenhofer,
Helmut Prodinger:
Approximate counting: an alternative approach.
ITA 25: 43-48 (1991) |
| 1989 |
|---|
| 24 | | Peter Kirschenhofer,
Helmut Prodinger,
Wojciech Szpankowski:
Digital Search Trees - Further Results on a Fundamental Data Structure.
IFIP Congress 1989: 443-447 |
| 23 | EE | Peter Kirschenhofer,
Helmut Prodinger,
Wojciech Szpankowski:
On the variance of the external path length in a symmetric digital trie.
Discrete Applied Mathematics 25(1-2): 129-143 (1989) |
| 22 | | 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) |
| 1988 |
|---|
| 21 | | Peter Kirschenhofer,
Helmut Prodinger,
Wojciech Szpankowski:
Do We Really Need to Balance Patricia Trees? (Extended Abstract).
ICALP 1988: 302-316 |
| 20 | | Peter Kirschenhofer,
Helmut Prodinger:
Further Results on Digital Search Trees.
Theor. Comput. Sci. 58: 143-154 (1988) |
| 1987 |
|---|
| 19 | EE | Philippe Flajolet,
Helmut Prodinger:
Level number sequences for trees.
Discrete Mathematics 65(2): 149-156 (1987) |
| 18 | | Peter Kirschenhofer,
Helmut Prodinger:
On the Recursive Depth of Special Tree Traversal Algorithms
Inf. Comput. 74(1): 15-32 (1987) |
| 1986 |
|---|
| 17 | | Peter Kirschenhofer,
Helmut Prodinger:
Some Further Results on Digital Search Trees.
ICALP 1986: 177-185 |
| 16 | EE | Peter Kirschenhofer,
Helmut Prodinger:
Two selection problems revisited.
J. Comb. Theory, Ser. A 42(2): 310-316 (1986) |
| 15 | | Philippe Flajolet,
Helmut Prodinger:
Register Allocation for Unary-Binary Trees.
SIAM J. Comput. 15(3): 629-640 (1986) |
| 1985 |
|---|
| 14 | | Helmut Prodinger:
Einige Bemerkungen zu einer Arbeit von W. Knödel über das mittlere Verhalten von on-line-Packungsalgorithmen.
Elektronische Informationsverarbeitung und Kybernetik 21(1/2): 3-7 (1985) |
| 1984 |
|---|
| 13 | | Peter Kirschenhofer,
Helmut Prodinger:
Recursion Depth Analysis for Specail Tree Traversal Algorithms.
ICALP 1984: 303-311 |
| 12 | EE | Peter Kirschenhofer,
Helmut Prodinger:
A short proof for a partition identity of Hwang and Wei.
Discrete Mathematics 52(2-3): 305-306 (1984) |
| 11 | | Helmut Prodinger:
Analysis of an Algorithm to Construct Fibonacci Partitions.
ITA 18(4): 387-394 (1984) |
| 1983 |
|---|
| 10 | EE | Helmut Prodinger:
Non-repetitive sequences and gray code.
Discrete Mathematics 43(1): 113-116 (1983) |
| 9 | EE | Helmut Prodinger:
A correspondence between ordered trees and noncrossing partitions.
Discrete Mathematics 46(2): 205-206 (1983) |
| 8 | | Helmut Prodinger:
Topologies on Free Monoids Induced by Families of Languages.
ITA 17(3): 285-290 (1983) |
| 7 | | Helmut Prodinger:
On the Number of Combinations without a Fixed Distance.
J. Comb. Theory, Ser. A 35(3): 362-365 (1983) |
| 1982 |
|---|
| 6 | | Peter Kirschenhofer,
Helmut Prodinger:
On the average hyperoscillations of planted plane trees.
Combinatorica 2(2): 177-186 (1982) |
| 1980 |
|---|
| 5 | | Helmut Prodinger:
Topologies on Free Monoids Induced by Closure Operators of a Special Type.
ITA 14(2): 225-237 (1980) |
| 4 | | Helmut Prodinger:
Congruences Defined by Languages and Filters
Information and Control 44(1): 36-46 (1980) |
| 3 | | Helmut Prodinger:
On the Interpolation of D0L-Sequences.
Theor. Comput. Sci. 10: 107-108 (1980) |
| 1979 |
|---|
| 2 | | Werner Kuich,
Helmut Prodinger,
Friedrich J. Urbanek:
On the Height of Derivation Trees.
ICALP 1979: 370-384 |
| 1 | | Helmut Prodinger,
Friedrich J. Urbanek:
Language Operators Related to Init.
Theor. Comput. Sci. 8: 161-175 (1979) |
