31 citations · 34 across the 4 of their papers we have counts for
4 papers
The relation between tree size complexity and probability for Boolean functions generated by uniform random trees
Antoine Genitrini, Bernhard Gittenberger, Veronika Kraus +1
We consider a probability distribution on the set of Boolean functions in n variables which is induced by random Boolean expressions. Such an expression is a random rooted plane tr…
Associative and commutative tree representations for Boolean functions
Antoine Genitrini, Bernhard Gittenberger, Veronika Kraus +1
Since the 90's, several authors have studied a probability distribution on the set of Boolean functions on variables induced by some probability distributions on formulas built…
The degree profile of Pólya trees
Bernhard Gittenberger, Veronika Kraus
We investigate the profile of random Pólya trees of size when only nodes of degree are counted in each level. It is shown that, as in the case where all nodes contribute to…
Asymptotic study of subcritical graph classes
Michael Drmota, Éric Fusy, Mihyun Kang +2
We present a unified general method for the asymptotic study of graphs from the so-called "subcritical" graph classes, which include the classes of cacti graphs, outerplanar gra…