Publication | Date of Publication | Type |
---|
Threshold functions for small subgraphs in simple graphs and multigraphs | 2020-06-16 | Paper |
When is it worthwhile to propagate a constraint? A probabilistic analysis of A<scp>ll</scp>D<scp>ifferent</scp> | 2019-09-17 | Paper |
Balanced And/Or trees and linear threshold functions | 2019-09-16 | Paper |
Lambda terms of bounded unary height | 2019-09-16 | Paper |
The growing tree distribution on Boolean functions. | 2019-09-16 | Paper |
Trees for algorithmics | 2018-07-24 | Paper |
On the number of unary-binary tree-like structures with restrictions on the unary height | 2018-04-18 | Paper |
Threshold functions for small subgraphs: an analytic approach | 2018-01-18 | Paper |
Dynamic analysis of the sizes of relations | 2017-12-04 | Paper |
2-Xor revisited: satisfiability and probabilities of functions | 2016-12-21 | Paper |
B-urns | 2016-07-19 | Paper |
A sprouting tree model for random boolean functions | 2016-01-07 | Paper |
https://portal.mardi4nfdi.de/entity/Q2920860 | 2014-09-29 | Paper |
Enumeration of generalized BCI lambda-terms | 2014-08-14 | Paper |
Probabilities of 2-Xor Functions | 2014-03-31 | Paper |
Asymptotics and random sampling for BCI and BCK lambda terms | 2014-01-10 | Paper |
Boys-and-girls Birthdays and Hadamard Products | 2012-07-11 | Paper |
The fraction of large random trees representing a given Boolean function in implicational logic | 2012-05-14 | Paper |
Tautologies over implication with negative literals | 2010-08-18 | Paper |
https://portal.mardi4nfdi.de/entity/Q3575996 | 2010-07-28 | Paper |
Classical and Intuitionistic Logic Are Asymptotically Identical | 2009-03-05 | Paper |
Complexity and Limiting Ratio of Boolean Functions over Implication | 2009-02-03 | Paper |
https://portal.mardi4nfdi.de/entity/Q5485333 | 2006-08-29 | Paper |
And/Or Trees Revisited | 2005-04-18 | Paper |
General urn models with several types of balls and Gaussian limiting fields | 2004-02-03 | Paper |
The permutation-path coloring problem on trees. | 2003-08-17 | Paper |
Occupancy urn models in the analysis of algorithms | 2002-05-15 | Paper |
Generating functions for generating trees | 2002-05-15 | Paper |
Enumeration of some Davenport-Schinzel sequences | 2001-11-07 | Paper |
A unified presentation of some urn models | 2001-10-02 | Paper |
https://portal.mardi4nfdi.de/entity/Q4508388 | 2001-08-06 | Paper |
An urn model from learning theory | 1997-10-01 | Paper |
Dynamic analysis of some relational databases parameters | 1997-02-28 | Paper |
https://portal.mardi4nfdi.de/entity/Q4886135 | 1996-08-22 | Paper |
Some results on the asymptotic behaviour of coefficients of large powers of functions | 1995-11-26 | Paper |
Join sizes, urn models and normal limiting distributions | 1995-04-03 | Paper |
https://portal.mardi4nfdi.de/entity/Q4028888 | 1993-03-28 | Paper |
Birthday paradox, coupon collectors, caching algorithms and self- organizing search | 1993-01-17 | Paper |
Enumerating Davenport-Schinzel sequences | 1993-01-17 | Paper |
Normal Limiting Distributions for Projection and Semijoin Sizes | 1992-09-27 | Paper |
Steepest descent method and limiting distributions in combinatorial analysis | 1992-09-26 | Paper |
https://portal.mardi4nfdi.de/entity/Q3814832 | 1988-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3740279 | 1984-01-01 | Paper |
On the size of projections: I | 1982-01-01 | Paper |