| Publication | Date of Publication | Type |
|---|
| An iterative approach for counting reduced ordered binary decision diagrams | 2024-12-03 | Paper |
| The Combinatorics of Barrier Synchronization | 2024-01-29 | Paper |
| Compaction for two models of logarithmic‐depth trees: Analysis and experiments | 2023-10-12 | Paper |
| A combinatorial study of async/await processes | 2023-07-28 | Paper |
| A combinatorial link between labelled graphs and increasingly labelled Schröder trees | 2023-07-26 | Paper |
| An iterative approach for counting reduced ordered binary decision diagrams | 2022-11-09 | Paper |
| Families of Monotonic Trees: Combinatorial Enumeration and Asymptotics | 2022-10-19 | Paper |
| Binary decision diagrams: from tree compaction to sampling | 2022-10-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5074777 | 2022-05-10 | Paper |
| A quantitative study of fork-join processes with non-deterministic choice: application to the statistical exploration of the state-space | 2022-04-01 | Paper |
| Strict monotonic trees arising from evolutionary processes: combinatorial and probabilistic study | 2021-11-19 | Paper |
| Statistical analysis of non-deterministic fork-join processes | 2021-07-08 | Paper |
| Beyond series-parallel concurrent systems: the case of arch processes | 2021-06-15 | Paper |
| Asymptotic enumeration of compacted binary trees of bounded right height | 2020-02-21 | Paper |
| Ranked Schröder Trees | 2019-09-18 | Paper |
| Cuts in Increasing Trees | 2019-09-17 | Paper |
| The Ordered and Colored Products in Analytic Combinatorics: Application to the Quantitative Study of Synchronizations in Concurrent Processes | 2019-09-17 | Paper |
| Balanced And/Or trees and linear threshold functions | 2019-09-16 | Paper |
| Binary Decision Diagrams: from Tree Compaction to Sampling | 2019-07-15 | Paper |
| Full asymptotic expansion for Polya structures | 2019-04-29 | Paper |
| Extended boxed product and application to synchronized trees | 2018-01-04 | Paper |
| Entropic uniform sampling of linear extensions in series-parallel posets | 2017-08-22 | Paper |
| The relation between tree size complexity and probability for Boolean functions generated by uniform random trees | 2017-07-19 | Paper |
| Pointed versus singular Boltzmann samplers: a comparative analysis | 2017-03-31 | Paper |
| The Combinatorics of Non-determinism | 2017-02-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2959884 | 2017-02-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2959913 | 2017-02-10 | Paper |
| Generalised and quotient models for random and/or~trees and application to satisfiability | 2016-12-21 | Paper |
| Increasing Diamonds | 2016-05-03 | Paper |
| No Shannon effect induced by and/or trees | 2016-03-01 | Paper |
| A quantitative study of pure parallel processes | 2016-01-25 | Paper |
| Associativity for Binary Parallel Processes: A Quantitative Study | 2015-02-19 | Paper |
| Associative and commutative tree representations for Boolean functions | 2015-01-30 | Paper |
| Enumeration and random generation of concurrent computations | 2014-09-29 | Paper |
| Equivalence Classes of Random Boolean Trees and Application to the Catalan Satisfiability Problem | 2014-03-31 | Paper |
| Catalan satisfiability problem | 2013-04-20 | Paper |
| Probabilities of Boolean functions given by random implicational formulas | 2012-06-12 | Paper |
| The fraction of large random trees representing a given Boolean function in implicational logic | 2012-05-14 | Paper |
| In the full propositional logic, 5/8 of classical tautologies are intuitionistically valid | 2012-04-10 | Paper |
| Tautologies over implication with negative literals | 2010-08-18 | Paper |
| Classical and Intuitionistic Logic Are Asymptotically Identical | 2009-03-05 | Paper |
| Quantitative Comparison of Intuitionistic and Classical Logics - Full Propositional System | 2009-02-24 | Paper |
| Complexity and Limiting Ratio of Boolean Functions over Implication | 2009-02-03 | Paper |
| Intuitionistic vs. Classical Tautologies, Quantitative Comparison | 2008-06-03 | Paper |
