 | 2012 |
| 14 |  | Hervé Fournier,
Danièle Gardy,
Antoine Genitrini,
Bernhard Gittenberger:
The fraction of large random trees representing a given Boolean function in implicational logic.
Random Struct. Algorithms 40(3): 317-349 (2012) |
| 2010 |
| 13 |  | Michael Drmota,
Bernhard Gittenberger:
The shape of unlabeled rooted random trees.
Eur. J. Comb. 31(8): 2028-2063 (2010) |
| 2009 |
| 12 |  | Michael Drmota,
Bernhard Gittenberger,
Reinhard Kutzelnigg:
Combinatorial Models for Cooperation Networks.
IWOCA 2009: 206-217 |
| 2008 |
| 11 |  | Hervé Fournier,
Danièle Gardy,
Antoine Genitrini,
Bernhard Gittenberger:
Complexity and Limiting Ratio of Boolean Functions over Implication.
MFCS 2008: 347-362 |
| 2006 |
| 10 |  | Bernhard Gittenberger,
Johannes Mandlburger:
Hayman Admissible Functions in Several Variables.
Electr. J. Comb. 13(1): (2006) |
| 9 |  | Bernhard Gittenberger:
Nodes of large degree in random trees and forests.
Random Struct. Algorithms 28(3): 374-385 (2006) |
| 2005 |
| 8 |  | Michael Drmota,
Bernhard Gittenberger,
Thomas Klausner:
Extended admissible functions and Gaussian limiting distributions.
Math. Comput. 74(252): 1953-1966 (2005) |
| 2004 |
| 7 |  | Brigitte Chauvin,
Philippe Flajolet,
Danièle Gardy,
Bernhard Gittenberger:
And/Or Trees Revisited.
Combinatorics, Probability & Computing 13(4-5): 475-497 (2004) |
| 6 |  | Michael Drmota,
Bernhard Gittenberger:
The Width of Galton-Watson Trees Conditioned by the Size.
Discrete Mathematics & Theoretical Computer Science 6(2): 387-400 (2004) |
| 5 |  | Michael Drmota,
Danièle Gardy,
Bernhard Gittenberger:
General urn models with several types of balls and Gaussian limiting fields.
Random Struct. Algorithms 24(1): 75-103 (2004) |
| 2001 |
| 4 |  | Michael Drmota,
Danièle Gardy,
Bernhard Gittenberger:
A Unified Presentation of Some Urn Models.
Algorithmica 29(1): 120-147 (2001) |
| 1999 |
| 3 |  | Bernhard Gittenberger:
On the Contour of Random Trees.
SIAM J. Discrete Math. 12(4): 434-458 (1999) |
| 1998 |
| 2 |  | Bernhard Gittenberger:
Convergence of branching processes to the local time of a Bessel process.
Random Struct. Algorithms 13(3-4): 423-438 (1998) |
| 1997 |
| 1 |  | Michael Drmota,
Bernhard Gittenberger:
On the profile of random trees.
Random Struct. Algorithms 10(4): 421-451 (1997) |