Bernhard Gittenberger

According to our database1, Bernhard Gittenberger authored at least 39 papers between 1997 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2020
Asymptotic enumeration of compacted binary trees of bounded right height.
J. Comb. Theory, Ser. A, 2020

Threshold functions for small subgraphs in simple graphs and multigraphs.
Eur. J. Comb., 2020

On the number of increasing trees with label repetitions.
Discret. Math., 2020

Counting embeddings of rooted trees into families of rooted trees.
CoRR, 2020

Compaction for two models of logarithmic-depth trees: Analysis and Experiments.
CoRR, 2020

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

2019
Distribution of Variables in Lambda-Terms with Restrictions on De Bruijn Indices and De Bruijn Levels.
Electron. J. Comb., 2019

2018
On the shape of random Pólya structures.
Discret. Math., 2018

Enumerating lambda terms by weighted length of their De Bruijn representation.
Discret. Appl. Math., 2018

Analytic Combinatorics of Lattice Paths with Forbidden Patterns: Enumerative Aspects.
Proceedings of the Language and Automata Theory and Applications, 2018

On the Number of Variables in Special Classes of Random Lambda-Terms.
Proceedings of the 29th International Conference on Probabilistic, 2018

Analytic Combinatorics of Lattice Paths with Forbidden Patterns: Asymptotic Aspects and Borges's Theorem.
Proceedings of the 29th International Conference on Probabilistic, 2018

2017
Threshold functions for small subgraphs: an analytic approach.
Electron. Notes Discret. Math., 2017

Asymptotic Enumeration of Compacted Binary Trees.
CoRR, 2017

A note on the scaling limits of random Pólya trees.
Proceedings of the Fourteenth Workshop on Analytic Algorithmics and Combinatorics, 2017

2016
2-Xor Revisited: Satisfiability and Probabilities of Functions.
Algorithmica, 2016

On the Number of Lambda Terms With Prescribed Size of Their De Bruijn Representation.
Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016

2015
Associative and commutative tree representations for Boolean functions.
Theor. Comput. Sci., 2015

2014
Probabilities of 2-Xor Functions.
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.
Proceedings of the 2014 Proceedings of the Eleventh Workshop on Analytic Algorithmics and Combinatorics, 2014

2013
Enumeration of Generalized BCI Lambda-terms.
Electron. J. Comb., 2013

2012
The fraction of large random trees representing a given Boolean function in implicational logic.
Random Struct. Algorithms, 2012

The degree profile of random Pólya trees.
J. Comb. Theory, Ser. A, 2012

Probabilities of Boolean Functions given by Random Implicational Formulas.
Electron. J. Comb., 2012

2011
Lambda-terms of Bounded Unary Height.
Proceedings of the Eighth Workshop on Analytic Algorithmics and Combinatorics, 2011

2010
The shape of unlabeled rooted random trees.
Eur. J. Comb., 2010

2009
Combinatorial Models for Cooperation Networks.
Proceedings of the Combinatorial Algorithms, 20th International Workshop, 2009

2008
Complexity and Limiting Ratio of Boolean Functions over Implication.
Proceedings of the Mathematical Foundations of Computer Science 2008, 2008

2006
Nodes of large degree in random trees and forests.
Random Struct. Algorithms, 2006

Hayman Admissible Functions in Several Variables.
Electron. J. Comb., 2006

2005
Extended admissible functions and Gaussian limiting distributions.
Math. Comput., 2005

2004
General urn models with several types of balls and Gaussian limiting fields.
Random Struct. Algorithms, 2004

The Width of Galton-Watson Trees Conditioned by the Size.
Discret. Math. Theor. Comput. Sci., 2004

And/Or Trees Revisited.
Comb. Probab. Comput., 2004

2001
A Unified Presentation of Some Urn Models.
Algorithmica, 2001

1999
On the Contour of Random Trees.
SIAM J. Discret. Math., 1999

The distribution of nodes of given degree in random trees.
J. Graph Theory, 1999

1998
Convergence of branching processes to the local time of a Bessel process.
Random Struct. Algorithms, 1998

1997
On the profile of random trees.
Random Struct. Algorithms, 1997


  Loading...