#### Filter Results:

- Full text PDF available (43)

#### Publication Year

1997

2018

- This year (6)
- Last 5 years (16)
- Last 10 years (29)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Michael Drmota, Bernhard Gittenberger
- Random Struct. Algorithms
- 1997

Abstract. Let T be a plane rooted tree with n nodes which is regarded as family tree of a Galton-Watson branching process conditioned on the total progeny. The profile of the tree may be described by… (More)

where the γi are again continuous fluctuations of period 1. All these results can be extended to so-called canonical number systems. We recall the definition of these number systems: Definition 1.1.… (More)

We analyze a fringe tree parameter w in a variety of settings, utilizing a variety of methods from the analysis of algorithms and data structures. Given a tree t and one of its leaves a, the w(t,a)… (More)

- Gwendal Collet, Elie de Panafieu, Danièle Gardy, Bernhard Gittenberger, Vlady Ravelomanana
- Electronic Notes in Discrete Mathematics
- 2017

We revisit the problem of counting the number of copies of a fixed graph in a random graph or multigraph, including the case of constrained degrees. Our approach relies heavily on analytic… (More)

- Brigitte Chauvin, Philippe Flajolet, Danièle Gardy, Bernhard Gittenberger
- Combinatorics, Probability & Computing
- 2004

We consider boolean functions over n variables. Any such function can be represented (and computed) by a complete binary tree with and or or in the internal nodes and a literal in the external nodes,… (More)

- Michael Drmota, Bernhard Gittenberger
- Journal of Graph Theory
- 1999

Let Tn denote the set of unrooted unlabeled trees of size n and let k ≥ 1 be given. By assuming that every tree of Tn is equally likely it is shown that the limiting distribution of the number of… (More)

- Olivier Bodini, Danièle Gardy, Bernhard Gittenberger
- ANALCO
- 2011

We aim at the asymptotic enumeration of lambda-terms of a given size where the order of nesting of abstractions is bounded whereas the size is tending to infinity. This is done by means of a… (More)

- Hervé Fournier, Danièle Gardy, Antoine Genitrini, Bernhard Gittenberger
- Random Struct. Algorithms
- 2012

We consider the logical system of Boolean expressions built on the single connector of implication and on positive literals. Assuming all expressions of a given size to be equally likely, we prove… (More)

This paper tackles the enumeration and asymptotics of the area below directed lattice paths (walks on N, with a finite set of jumps). It is a nice surprise (obtained via the “kernel method”) that the… (More)

- Michael Drmota, Bernhard Gittenberger
- Discrete Mathematics & Theoretical Computer…
- 2004

HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and… (More)