The following pages link to Bernhard Gittenberger (Q396959):
Displayed 50 items.
- Enumeration of generalized BCI lambda-terms (Q396960) (← links)
- Probabilities of Boolean functions given by random implicational formulas (Q426921) (← links)
- The degree profile of random Pólya trees (Q439063) (← links)
- The shape of unlabeled rooted random trees (Q710724) (← links)
- 2-Xor revisited: satisfiability and probabilities of functions (Q727973) (← links)
- Hayman admissible functions in several variables (Q870027) (← links)
- On the number of predecessors in constrained random mappings (Q1375862) (← links)
- A note on ``State spaces of the snake and its tour: convergence of the discrete snake'' by J.-F. Marckert and A. Mokkadem (Q1426863) (← links)
- On the local time density of the reflecting Brownian bridge (Q1580050) (← links)
- Asymptotic normality of \(b\)-additive functions on polynomial sequences in the Gaussian number field (Q1590270) (← links)
- Strata of random mappings---a combinatorial approach (Q1613609) (← links)
- Analytic combinatorics of lattice paths with forbidden patterns: enumerative aspects (Q1647701) (← links)
- Threshold functions for small subgraphs: an analytic approach (Q1689924) (← links)
- On the shape of random Pólya structures (Q1699530) (← links)
- Enumerating lambda terms by weighted length of their de Bruijn representation (Q1706116) (← links)
- On the number of unary-binary tree-like structures with restrictions on the unary height (Q1745901) (← links)
- Reflected Brownian bridge local time conditioned on its local time at the origin (Q1770063) (← links)
- (Q1840505) (redirect page) (← links)
- A unified presentation of some urn models (Q1840506) (← links)
- Counting embeddings of rooted trees into families of rooted trees (Q2088692) (← links)
- Threshold functions for small subgraphs in simple graphs and multigraphs (Q2189830) (← links)
- Analytic combinatorics of lattice paths with forbidden patterns, the vectorial kernel method, and generating functions for pushdown automata (Q2292858) (← links)
- Asymptotic enumeration of compacted binary trees of bounded right height (Q2299626) (← links)
- Associative and commutative tree representations for Boolean functions (Q2514128) (← links)
- (Q2789548) (← links)
- The fraction of large random trees representing a given Boolean function in implicational logic (Q2884007) (← links)
- (Q2906546) (← links)
- (Q2920851) (← links)
- (Q2920877) (← links)
- (Q2959859) (← links)
- (Q2959913) (← links)
- (Q3575006) (← links)
- Complexity and Limiting Ratio of Boolean Functions over Implication (Q3599140) (← links)
- On the shape of the fringe of various types of random trees (Q3634637) (← links)
- Combinatorial Models for Cooperation Networks (Q3651547) (← links)
- (Q4218057) (← links)
- The distribution of nodes of given degree in random trees (Q4256093) (← links)
- The Moments of the Sum-Of-Digits Function in Number Fields (Q4262167) (← links)
- On the profile of random trees (Q4345362) (← links)
- (Q4428914) (← links)
- General urn models with several types of balls and Gaussian limiting fields (Q4446879) (← links)
- (Q4524569) (← links)
- On the number of lambda terms with prescribed size of their De Bruijn representation (Q4601892) (← links)
- (Q4667613) (← links)
- And/Or Trees Revisited (Q4670353) (← links)
- On the Contour of Random Trees (Q4699170) (← links)
- (Q4705340) (← links)
- The Brownian excursion multi-dimensional local time density (Q4935332) (← links)
- (Q4946947) (← links)
- (Q4993532) (← links)