- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| j125 |      | Christian Elsholtz, Clemens Heuberger, Helmut Prodinger: The Number of Huffman Codes, Compact Trees, and Sums of Unit Fractions. IEEE Transactions on Information Theory 59(2): 1065-1075 (2013) |
| 2012 | ||
| j124 | | Rosena R. X. Du, Helmut Prodinger: Notes on protected nodes in digital search trees. Appl. Math. Lett. 25(6): 1025-1028 (2012) |
| j123 | | Helmut Prodinger, Guy Louchard: The Asymmetric Leader Election Algorithm with swedish stopping: A probabilistic analysis. Discrete Mathematics & Theoretical Computer Science 14(2): 91-128 (2012) |
| j122 | | Helmut Prodinger: Dyck Paths with Parity Restrictions for the Final Runs to the Origin: a Study of the Height. Fundam. Inform. 117(1-4): 279-285 (2012) |
| j121 | | |
| j120 | | Guy Louchard, Helmut Prodinger, Mark Daniel Ward: Number of survivors in the presence of a demon. Periodica Mathematica Hungarica 64(1): 101-117 (2012) |
| j119 | | Helmut Prodinger: Approximate counting with m counters: A detailed analysis. Theor. Comput. Sci. 439: 58-68 (2012) |
| 2011 | ||
| j118 | | Helmut Prodinger: Continued Fractions Related to (t,q)-Tangents and Variants. Electr. J. Comb. 18(2) (2011) |
| j117 | | Roberto Maria Avanzi, Clemens Heuberger, Helmut Prodinger: Redundant τ-adic expansions I: non-adjacent digit sets and their applications to scalar multiplication. Des. Codes Cryptography 58(2): 173-202 (2011) |
| j116 | | Helmut Prodinger: Digital search trees with m trees: Level polynomials and insertion costs. Discrete Mathematics & Theoretical Computer Science 13(3): 1-8 (2011) |
| j115 | | Helmut Prodinger, Carsten Schneider, Stephan G. Wagner: Unfair permutations. Eur. J. Comb. 32(8): 1282-1298 (2011) |
| j114 | | 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 | ||
| j113 | | Helmut Prodinger: Continued fraction expansions for q-tangent and q-cotangent functions. Discrete Mathematics & Theoretical Computer Science 12(2): 47-64 (2010) |
| j112 | | Guy Louchard, Helmut Prodinger: Asymptotic results for silent elimination. Discrete Mathematics & Theoretical Computer Science 12(2): 185-196 (2010) |
| j111 | | Ligia Loreta Cristea, Helmut Prodinger: q-Enumeration of words by their total variation. Discrete Mathematics & Theoretical Computer Science 12(3): 139-150 (2010) |
| j110 | | 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) |
| i3 | | Roberto Avanzi, Clemens Heuberger, Helmut Prodinger: Arithmetic of Supersingular Koblitz Curves in Characteristic Three. IACR Cryptology ePrint Archive 2010: 436 (2010) |
| 2009 | ||
| j109 | | Markus Kuba, Alois Panholzer, Helmut Prodinger: Lattice Paths, Sampling Without Replacement, and Limiting Distributions. Electr. J. Comb. 16(1) (2009) |
| j108 | | Helmut Prodinger: A simple bijection between a subclass of 2-binary trees and ternary trees. Discrete Mathematics 309(4): 959-961 (2009) |
| j107 | | Nancy S. S. Gu, Helmut Prodinger: Bijections for 2-plane trees and ternary trees. Eur. J. Comb. 30(4): 969-985 (2009) |
| j106 | | 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) |
| j105 | | Conrado Martínez, Helmut Prodinger: Moves and displacements of particular elements in Quicksort. Theor. Comput. Sci. 410(21-23): 2279-2284 (2009) |
| 2008 | ||
| j104 | | Guy Louchard, Helmut Prodinger: On gaps and unoccupied urns in sequences of geometrically distributed random variables. Discrete Mathematics 308(9): 1538-1562 (2008) |
| j103 | | Helmut Prodinger: The Location of the First Maximum in the First Sojourn of a Dyck Path. Discrete Mathematics & Theoretical Computer Science 10(3) (2008) |
| j102 | | 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 Cryptology ePrint Archive 2008: 148 (2008) |
| 2007 | ||
| j101 |  | Arnold Knopfmacher, Helmut Prodinger: The Last Descent In Samples Of Geometric Random Variables And Permutations. Ars Comb. 83 (2007) |
| j100 | | 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. Discrete Mathematics & Theoretical Computer Science 9(1) (2007) |
| j99 | | Clemens Heuberger, Helmut Prodinger: The Hamming weight of the non-adjacent-form under various input statistics. Periodica Mathematica Hungarica 55(1): 81-96 (2007) |
| j98 | | 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 | ||
| j97 | | 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) |
| j96 | | Guy Louchard, Helmut Prodinger: Asymptotics of the Moments of Extreme-Value Related Distribution Functions. Algorithmica 46(3-4): 431-467 (2006) |
| j95 | | 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) |
| j94 | | Helmut Prodinger: d-records in geometrically distributed random variables. Discrete Mathematics & Theoretical Computer Science 8(1): 273-284 (2006) |
| j93 | | Margaret Archibald, Arnold Knopfmacher, Helmut Prodinger: The number of distinct values in a geometrically distributed sample. Eur. J. Comb. 27(7): 1059-1081 (2006) |
| j92 | | Michael Drmota, Helmut Prodinger: The register function for t-ary trees. ACM Transactions on Algorithms 2(3): 318-334 (2006) |
| j91 | | 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 | ||
| j90 | | 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) |
| j89 | | 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 Cryptology ePrint Archive 2005: 225 (2005) |
| 2004 | ||
| j88 | | Kate Morris, Alois Panholzer, Helmut Prodinger: On Some Parameters in Heap Ordered Trees. Combinatorics, Probability & Computing 13(4-5): 677-696 (2004) |
| j87 | | Alois Panholzer, Helmut Prodinger: Analysis of some statistics for increasing tree families. Discrete Mathematics & Theoretical Computer Science 6(2): 437-460 (2004) |
| j86 | | Alois Panholzer, Helmut Prodinger, Marko Riedel: Permuting in place: analysis of two stopping rules. J. Algorithms 51(2): 170-184 (2004) |
| j85 | | 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 | ||
| j84 | | Peter Paule, Helmut Prodinger: Fountains, histograms, and q-identities. Discrete Mathematics & Theoretical Computer Science 6(1): 101-106 (2003) |
| j83 | | Clemens Heuberger, Helmut Prodinger: Carry propagation in signed digit representations. Eur. J. Comb. 24(3): 293-320 (2003) |
| j82 | | Guy Louchard, Helmut Prodinger: Random 0-1 rectangular matrices: a probabilistic analysis. Periodica Mathematica Hungarica 47(1-2): 169-193 (2003) |
| j81 | | 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) |
| j80 | | Peter J. Grabner, Arnold Knopfmacher, Helmut Prodinger: Combinatorics of geometrically distributed random variables: run statistics. Theor. Comput. Sci. 297(1-3): 261-270 (2003) |
| j79 | | 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 | ||
| j78 | | Helmut Prodinger: On the Analysis of an Algorithm to Generate a Random Cyclic Permutation. Ars Comb. 65 (2002) |
| j77 | | Alois Panholzer, Helmut Prodinger: Bijections for ternary trees and non-crossing trees. Discrete Mathematics 250(1-3): 181-195 (2002) |
| j76 | | 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) |
| j75 | | Guy Louchard, Helmut Prodinger: Probabilistic Analysis of Carlitz Compositions. Discrete Mathematics & Theoretical Computer Science 5(1): 71-96 (2002) |
| j74 | | Michael Drmota, Helmut Prodinger: The height of q-Binary Search Trees. Discrete Mathematics & Theoretical Computer Science 5(1): 97-108 (2002) |
| j73 | | |
| j72 | | 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) |
| j71 | | Leonard Smiley, Helmut Prodinger, Robin Chapman, et al.: A Tree-Counting Identity: 10781. The American Mathematical Monthly 109(3): 300-301 (2002) |
| j70 | | Peter J. Grabner, Helmut Prodinger: Sorting algorithms for broadcast communications: mathematical analysis. Theor. Comput. Sci. 289(1): 51-67 (2002) |
| j69 | | Helmut Prodinger, Wojciech Szpankowski: Optimal versus randomized search of fixed length binary words. IEEE Transactions on Information Theory 48(9): 2614-2621 (2002) |
| 2001 | ||
| j68 | | Helmut Prodinger, Wojciech Szpankowski: Average-Case Analysis of Algorithms - Preface. Algorithmica 29(1): 1-2 (2001) |
| j67 | | Conrado Martinez, Alois Panholzer, Helmut Prodinger: Partial Match Queries in Relaxed Multidimensional Search Trees. Algorithmica 29(1): 181-204 (2001) |
| j66 | | Helmut Prodinger: A q-Analogue of the Path Length of Binary Search Trees. Algorithmica 31(3): 433-441 (2001) |
| j65 | | Arnold Knopfmacher, Helmut Prodinger: A Simple Card Guessing Game Revisited. Electr. J. Comb. 8(2) (2001) |
| j64 | | Clemens Heuberger, Helmut Prodinger: On Minimal Expansions in Redundant Number Systems: Algorithms and Quantitative Analysis. Computing 66(4): 377-393 (2001) |
| j63 | | 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) |
| j62 | | 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) |
| j61 | | 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 | ||
| j60 | | 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 |
| 1999 | ||
| j59 | | Philippe Flajolet, Helmut Prodinger: On Stirling Numbers for Complex Arguments and Hankel Contours. SIAM J. Discrete Math. 12(2): 155-159 (1999) |
| 1998 | ||
| j58 | | Helmut Prodinger, Wojciech Szpankowski: Philippe Flajolet's Research in Analysis of Algorithms and Combinatorics. Algorithmica 22(4): 366-387 (1998) |
| j57 | | Alois Panholzer, Helmut Prodinger: Average-Case Analysis of Priority Trees: A Structure for Priority Queue Administration. Algorithmica 22(4): 600-630 (1998) |
| j56 | | 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) |
| j55 | | Conrado Martinez, Alois Panholzer, Helmut Prodinger: On the Number of Descendants and Ascendants in Random Search Trees. Electr. J. Comb. 5 (1998) |
| j54 | | Peter Kirschenhofer, Helmut Prodinger: Comparisons in Hoare's Find Algorithm. Combinatorics, Probability & Computing 7(1): 111-120 (1998) |
| j53 | | |
| j52 | | 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) |
| j51 | | 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 | ||
| j50 | | 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) |
| j49 | | Xavier Gourdon, Helmut Prodinger: A generating function approach to random subgraphs of the n-cycle. Discrete Mathematics 169(1-3): 227-232 (1997) |
| j48 | | Alois Panholzer, Helmut Prodinger: Descendants and ascendants in binary trees. Discrete Mathematics & Theoretical Computer Science 1(2): 247-266 (1997) |
| j47 | | 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) |
| j46 | | 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 | ||
| j45 | | Helmut Prodinger: Descendants in heap ordered trees or a triumph of computer algebra. Electr. J. Comb. 3(1) (1996) |
| j44 | | Helmut Prodinger: Combinatorics of geometrically distributed random variables: Left-to-right maxima. Discrete Mathematics 153(1-3): 253-270 (1996) |
| j43 | | Helmut Prodinger: Depth and Path Length of Heap Ordered Trees. Int. J. Found. Comput. Sci. 7(3): 293-299 (1996) |
| j42 | | 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) |
| j41 | | 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 | ||
| j40 | | Wolfgang Panny, Helmut Prodinger: Bottom-Up Mergesort - a Detailed Analysis. Algorithmica 14(4): 340-354 (1995) |
| j39 | | Helmut Prodinger: Digital search trees and basic hypergeometric functions. Bulletin of the EATCS 56 (1995) |
| j38 | | Helmut Prodinger: Multiple Quickselect - Hoare's Find Algorithm for Several Elements. Inf. Process. Lett. 56(3): 123-129 (1995) |
| j37 | | Helmut Prodinger: Comments on the Analysis of Parameters in a Random Graph Model. ITA 29(3): 245-253 (1995) |
| j36 | | 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 | | |
| 1994 | ||
| j35 | | Peter Kirschenhofer, Helmut Prodinger: The Path Length of Random Skip Lists. Acta Inf. 31(8): 775-792 (1994) |
| j34 | | Helmut Prodinger: Some Polynomials Related to the Fibonacci Polynomials. Bulletin of the EATCS 53: 248-250 (1994) |
| j33 | | Helmut Prodinger: An Asymptotic Comment on a Paper by Analyti and Pramanik. Inf. Process. Lett. 49(6): 327-328 (1994) |
| j32 | | Peter Kirschenhofer, Helmut Prodinger: Multidimensional Digital Searching-Alternative Data Structures. Random Struct. Algorithms 5(1): 123-134 (1994) |
| j31 | | Peter Kirschenhofer, Helmut Prodinger, Wojciech Szpankowski: Digital Search Trees Again Revisited: The Internal Path Length Perspective. SIAM J. Comput. 23(3): 598-616 (1994) |
| j30 | | 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 | ||
| j29 | | |
| j28 | | 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) |
| j27 | | Helmut Prodinger, Wojciech Szpankowski: A Note on Binomial Recurrences Arising in the Analysis of Algorithms. Inf. Process. Lett. 46(6): 309-311 (1993) |
| 1992 | ||
| j26 | | Helmut Prodinger: Some analytic techniques for the investigation of the asymptotic behaviour of tree parameters. Bulletin of the EATCS 47: 180-199 (1992) |
| j25 | | Helmut Prodinger: External Internal Nodes in Digital Search Trees via Mellin Transforms. SIAM J. Comput. 21(6): 1180-1183 (1992) |
| j24 | | 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) |
| j23 | | 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 | ||
| j22 | | Peter Kirschenhofer, Helmut Prodinger: Approximate counting: an alternative approach. ITA 25: 43-48 (1991) |
| 1989 | ||
| j21 | | 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) |
| j20 | | 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 | ||
| j19 | | 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 | ||
| j18 | | Philippe Flajolet, Helmut Prodinger: Level number sequences for trees. Discrete Mathematics 65(2): 149-156 (1987) |
| j17 | | Peter Kirschenhofer, Helmut Prodinger: On the Recursive Depth of Special Tree Traversal Algorithms. Inf. Comput. 74(1): 15-32 (1987) |
| 1986 | ||
| j16 | | Francis T. Boesch, Helmut Prodinger: Spanning tree formulas and chebyshev polynomials. Graphs and Combinatorics 2(1): 191-200 (1986) |
| j15 | | Peter Kirschenhofer, Helmut Prodinger: Two selection problems revisited. J. Comb. Theory, Ser. A 42(2): 310-316 (1986) |
| j14 | | Helmut Prodinger: The average height of the d-th highest leaf of a planted plane tree. Networks 16(1): 67-75 (1986) |
| j13 | | 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 | ||
| j12 | | 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 | ||
| j11 | | Peter Kirschenhofer, Helmut Prodinger: A short proof for a partition identity of Hwang and Wei. Discrete Mathematics 52(2-3): 305-306 (1984) |
| j10 | | Helmut Prodinger: Analysis of an Algorithm to Construct Fibonacci Partitions. ITA 18(4): 387-394 (1984) |
| c2 | | Peter Kirschenhofer, Helmut Prodinger: Recursion Depth Analysis for Specail Tree Traversal Algorithms. ICALP 1984: 303-311 |
| 1983 | ||
| j9 | | Helmut Prodinger: Non-repetitive sequences and gray code. Discrete Mathematics 43(1): 113-116 (1983) |
| j8 | | Helmut Prodinger: A correspondence between ordered trees and noncrossing partitions. Discrete Mathematics 46(2): 205-206 (1983) |
| j7 | | Helmut Prodinger: Topologies on Free Monoids Induced by Families of Languages. ITA 17(3): 285-290 (1983) |
| j6 | | Helmut Prodinger: On the Number of Combinations without a Fixed Distance. J. Comb. Theory, Ser. A 35(3): 362-365 (1983) |
| 1982 | ||
| j5 | | Peter Kirschenhofer, Helmut Prodinger: On the average hyperoscillations of planted plane trees. Combinatorica 2(2): 177-186 (1982) |
| 1980 | ||
| j4 | | Helmut Prodinger: Congruences Defined by Languages and Filters. Information and Control 44(1): 36-46 (1980) |
| j3 | | Helmut Prodinger: Topologies on Free Monoids Induced by Closure Operators of a Special Type. ITA 14(2): 225-237 (1980) |
| j2 | | |
| 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 |
Colors in the list of coauthors
Last update Sun May 26 10:55:22 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page