Bernhard Gittenberger

According to our database, Bernhard Gittenberger authored at least 40 papers between 1997 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2022

Compaction for two models of logarithmic-depth trees: Analysis and experiments.

Olivier Bodini, Antoine Genitrini, Bernhard Gittenberger, Isabella Larcher, Mehdi Naima

Random Struct. Algorithms, 2022

Counting Embeddings of Rooted Trees into Families of Rooted Trees.

Bernhard Gittenberger, Zbigniew Golebiewski, Isabella Larcher, Malgorzata Sulkowska

Electron. J. Comb., 2022

2020

Asymptotic enumeration of compacted binary trees of bounded right height.

Antoine Genitrini, Bernhard Gittenberger, Manuel Kauers, Michael Wallner

J. Comb. Theory, Ser. A, 2020

Threshold functions for small subgraphs in simple graphs and multigraphs.

Gwendal Collet, Élie de Panafieu, Danièle Gardy, Bernhard Gittenberger, Vlady Ravelomanana

Eur. J. Comb., 2020

On the number of increasing trees with label repetitions.

Olivier Bodini, Antoine Genitrini, Bernhard Gittenberger, Stephan Wagner

Discret. Math., 2020

Analytic Combinatorics of Lattice Paths with Forbidden Patterns, the Vectorial Kernel Method, and Generating Functions for Pushdown Automata.

Andrei Asinowski, Axel Bacher, Cyril Banderier, Bernhard Gittenberger

Algorithmica, 2020

2019

Distribution of Variables in Lambda-Terms with Restrictions on De Bruijn Indices and De Bruijn Levels.

Bernhard Gittenberger, Isabella Larcher

Electron. J. Comb., 2019

Counting phylogenetic networks with few reticulation vertices: tree-child and normal networks.

Michael Fuchs, Bernhard Gittenberger, Marefatollah Mansouri

Australas. J Comb., 2019

2018

On the shape of random Pólya structures.

Bernhard Gittenberger, Emma Yu Jin, Michael Wallner

Discret. Math., 2018

Enumerating lambda terms by weighted length of their De Bruijn representation.

Olivier Bodini, Bernhard Gittenberger, Zbigniew Golebiewski

Discret. Appl. Math., 2018

Analytic Combinatorics of Lattice Paths with Forbidden Patterns: Enumerative Aspects.

Andrei Asinowski, Axel Bacher, Cyril Banderier, Bernhard Gittenberger

Proceedings of the Language and Automata Theory and Applications, 2018

On the Number of Variables in Special Classes of Random Lambda-Terms.

Bernhard Gittenberger, Isabella Larcher

Proceedings of the 29th International Conference on Probabilistic, 2018

Analytic Combinatorics of Lattice Paths with Forbidden Patterns: Asymptotic Aspects and Borges's Theorem.

Andrei Asinowski, Axel Bacher, Cyril Banderier, Bernhard Gittenberger

Proceedings of the 29th International Conference on Probabilistic, 2018

2017

Threshold functions for small subgraphs: an analytic approach.

Gwendal Collet, Elie de Panafieu, Danièle Gardy, Bernhard Gittenberger, Vlady Ravelomanana

Electron. Notes Discret. Math., 2017

Asymptotic Enumeration of Compacted Binary Trees.

Antoine Genitrini, Bernhard Gittenberger, Manuel Kauers, Michael Wallner

CoRR, 2017

A note on the scaling limits of random Pólya trees.

Bernhard Gittenberger, Emma Yu Jin, Michael Wallner

Proceedings of the Fourteenth Workshop on Analytic Algorithmics and Combinatorics, 2017

2016

2-Xor Revisited: Satisfiability and Probabilities of Functions.

Elie de Panafieu, Danièle Gardy, Bernhard Gittenberger, Markus Kuba

Algorithmica, 2016

On the Number of Lambda Terms With Prescribed Size of Their De Bruijn Representation.

Bernhard Gittenberger, Zbigniew Golebiewski

Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016

2015

Associative and commutative tree representations for Boolean functions.

Antoine Genitrini, Bernhard Gittenberger, Veronika Kraus, Cécile Mailler

Theor. Comput. Sci., 2015

2014

Probabilities of 2-Xor Functions.

Elie de Panafieu, Danièle Gardy, Bernhard Gittenberger, Markus Kuba

Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

On the asymptotic number of <i>BCK</i>(2)-terms.

Olivier Bodini, Bernhard Gittenberger

Proceedings of the 2014 Proceedings of the Eleventh Workshop on Analytic Algorithmics and Combinatorics, 2014

2013

Enumeration of Generalized BCI Lambda-terms.

Olivier Bodini, Danièle Gardy, Bernhard Gittenberger, Alice Jacquot

Electron. J. Comb., 2013

2012

The fraction of large random trees representing a given Boolean function in implicational logic.

Hervé Fournier, Danièle Gardy, Antoine Genitrini, Bernhard Gittenberger

Random Struct. Algorithms, 2012

The degree profile of random Pólya trees.

Bernhard Gittenberger, Veronika Kraus

J. Comb. Theory, Ser. A, 2012

Probabilities of Boolean Functions given by Random Implicational Formulas.

Antoine Genitrini, Bernhard Gittenberger, Veronika Kraus, Cécile Mailler

Electron. J. Comb., 2012

2011

Lambda-terms of Bounded Unary Height.

Olivier Bodini, Danièle Gardy, Bernhard Gittenberger

Proceedings of the Eighth Workshop on Analytic Algorithmics and Combinatorics, 2011

2010

The shape of unlabeled rooted random trees.

Michael Drmota, Bernhard Gittenberger

Eur. J. Comb., 2010

2009

Combinatorial Models for Cooperation Networks.

Michael Drmota, Bernhard Gittenberger, Reinhard Kutzelnigg

Proceedings of the Combinatorial Algorithms, 20th International Workshop, 2009

2008

Complexity and Limiting Ratio of Boolean Functions over Implication.

Hervé Fournier, Danièle Gardy, Antoine Genitrini, Bernhard Gittenberger

Proceedings of the Mathematical Foundations of Computer Science 2008, 2008

2006

Nodes of large degree in random trees and forests.

Bernhard Gittenberger

Random Struct. Algorithms, 2006

Hayman Admissible Functions in Several Variables.

Bernhard Gittenberger, Johannes Mandlburger

Electron. J. Comb., 2006

2005

Extended admissible functions and Gaussian limiting distributions.

Michael Drmota, Bernhard Gittenberger, Thomas Klausner

Math. Comput., 2005

2004

General urn models with several types of balls and Gaussian limiting fields.

Michael Drmota, Danièle Gardy, Bernhard Gittenberger

Random Struct. Algorithms, 2004

The Width of Galton-Watson Trees Conditioned by the Size.

Michael Drmota, Bernhard Gittenberger

Discret. Math. Theor. Comput. Sci., 2004

And/Or Trees Revisited.

Brigitte Chauvin, Philippe Flajolet, Danièle Gardy, Bernhard Gittenberger

Comb. Probab. Comput., 2004

2001

A Unified Presentation of Some Urn Models.

Michael Drmota, Danièle Gardy, Bernhard Gittenberger

Algorithmica, 2001

1999

On the Contour of Random Trees.

Bernhard Gittenberger

SIAM J. Discret. Math., 1999

The distribution of nodes of given degree in random trees.

Michael Drmota, Bernhard Gittenberger

J. Graph Theory, 1999

1998

Convergence of branching processes to the local time of a Bessel process.

Bernhard Gittenberger

Random Struct. Algorithms, 1998

1997

On the profile of random trees.

Michael Drmota, Bernhard Gittenberger

Random Struct. Algorithms, 1997