Bernhard Gittenberger

And/Or Trees Revisited

We consider Boolean functions over

On the Contour of Random Trees

n

A unified presentation of some urn models

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, and many different trees can represent the same function, so that a fundamental question is related to the so-called complexity of a Boolean function:

Associative and commutative tree representations for Boolean functions

L(f):=

On the local time density of the reflecting Brownian bridge.

minimal size of a tree computing

Strata of random mappings – A combinatorial approach☆

f

On the Profile of Random Forests

.The existence of a limiting probability distribution

Extended admissible functions and Gaussian limiting distributions

P(\cdot)

On the number of predecessors in constrained random mappings

on the set of and/or trees was shown by Lefmann and Savický [8]. We give here an alternative proof, which leads to effective computation in simple cases. We also consider the relationship between the probability

On the Number of Unary-Binary Tree-Like Structures with Restrictions on the Unary Height

P(f)