The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Helmut Prodinger: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  106. Representations of Numbers as åk=-nn ek k\sum_{k=-n}^n \varepsilon_k k: A Saddle Point Approach. [Citation Graph (, )][DBLP]


  107. The Last Descent In Samples Of Geometric Random Variables And Permutations. [Citation Graph (, )][DBLP]


  108. On the variance of the external path length in a symmetric digital trie. [Citation Graph (, )][DBLP]


  109. On gaps and unoccupied urns in sequences of geometrically distributed random variables. [Citation Graph (, )][DBLP]


  110. A simple bijection between a subclass of 2-binary trees and ternary trees. [Citation Graph (, )][DBLP]


  111. A Combinatorial and Probabilistic Study of Initial and End Heights of Descents in Samples of Geometrically Distributed Random Variables and in Permutations. [Citation Graph (, )][DBLP]


  112. The Location of the First Maximum in the First Sojourn of a Dyck Path. [Citation Graph (, )][DBLP]


  113. Bijections for a class of labeled plane trees. [Citation Graph (, )][DBLP]


  114. Bijections for 2-plane trees and ternary trees. [Citation Graph (, )][DBLP]


Search in 0.496secs, Finished in 0.499secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002