Fibonacci numbers of graphs H Prodinger, R Tichy The Fibonacci Quarterly 20 (1), 16-21, 1982 | 284 | 1982 |

Mellin transforms and asymptotics: digital sums P Flajolet, P Grabner, P Kirschenhofer, H Prodinger, RF Tichy Theoretical Computer Science 123 (2), 291-314, 1994 | 174 | 1994 |

A Tutte polynomial for signed graphs LH Kauffman Discrete Applied Mathematics 25 (1-2), 105-127, 1989 | 152 | 1989 |

Spanning tree formulas and Chebyshev polynomials FT Boesch, H Prodinger Graphs and Combinatorics 2 (1), 191-200, 1986 | 104 | 1986 |

How to select a loser H Prodinger Discrete Mathematics 120 (1-3), 149-159, 1993 | 101 | 1993 |

On Ramanujan's Q-function P Flajolet, PJ Grabner, P Kirschenhofer, H Prodinger Journal of Computational and Applied Mathematics 58 (1), 103-116, 1995 | 100 | 1995 |

Combinatorics of geometrically distributed random variables: Left-to-right maxima H Prodinger Discrete Mathematics 153 (1-3), 253-270, 1996 | 80 | 1996 |

The path length of random skip lists P Kirschenhofer, H Prodinger Acta Informatica 31 (8), 775-792, 1994 | 77 | 1994 |

On the variance of the external path length in a symmetric digital trie P Kirschenhofer, H Prodinger, W Szpankowski Discrete Applied Mathematics 25 (1-2), 129-143, 1989 | 69 | 1989 |

On Carlitz compositions A Knopfmacher, H Prodinger European Journal of Combinatorics 19 (5), 579-589, 1998 | 64 | 1998 |

Analysis of Hoare's FIND algorithm with Median‐of‐three partition P Kirschenhofer, H Prodinger, C Martinez Random Structures & Algorithms 10 (1‐2), 143-156, 1997 | 64 | 1997 |

Level number sequences for trees P Flajolet, H Prodinger Discrete mathematics 65 (2), 149-156, 1987 | 64 | 1987 |

The kernel method: a collection of examples H Prodinger Sém. Lothar. Combin 50, B50f, 2004 | 62 | 2004 |

Some information about the binomial transform H Proctinger CiteSeerX, 1993 | 60 | 1993 |

Digital search trees again revisited: The internal path length perspective P Kirschenhofer, H Prodinger, W Szpankowski SIAM Journal on Computing 23 (3), 598-616, 1994 | 57 | 1994 |

Register allocation for unary–binary trees P Flajolet, H Prodinger SIAM Journal on Computing 15 (3), 629-640, 1986 | 57 | 1986 |

A result in order statistics related to probabilistic counting P Kirschenhofer, H Prodinger Computing 51 (1), 15-27, 1993 | 55 | 1993 |

On some applications of formulae of Ramanujan in the analysis of algorithms P Kirschenhofer, H Prodinger Mathematika 38 (1), 14-33, 1991 | 54 | 1991 |

Level of nodes in increasing trees revisited A Panholzer, H Prodinger Random Structures & Algorithms 31 (2), 203-226, 2007 | 52 | 2007 |

Comparisons in Hoare's Find algorithm P Kirschenhofer, H Prodinger Combinatorics, Probability and Computing 7 (1), 111-120, 1998 | 51 | 1998 |