The following pages link to Antoine Genitrini (Q408541):
Displayed 44 items.
- In the full propositional logic, 5/8 of classical tautologies are intuitionistically valid (Q408542) (← links)
- Probabilities of Boolean functions given by random implicational formulas (Q426921) (← links)
- Generalised and quotient models for random and/or~trees and application to satisfiability (Q727977) (← links)
- Item:Q408541 (redirect page) (← links)
- A quantitative study of pure parallel processes (Q907263) (← links)
- Extended boxed product and application to synchronized trees (Q1687792) (← links)
- Statistical analysis of non-deterministic fork-join processes (Q2037938) (← links)
- Binary decision diagrams: from tree compaction to sampling (Q2081654) (← links)
- A quantitative study of fork-join processes with non-deterministic choice: application to the statistical exploration of the state-space (Q2120961) (← links)
- Asymptotic enumeration of compacted binary trees of bounded right height (Q2299626) (← links)
- Entropic uniform sampling of linear extensions in series-parallel posets (Q2399366) (← links)
- Associative and commutative tree representations for Boolean functions (Q2514128) (← links)
- Strict monotonic trees arising from evolutionary processes: combinatorial and probabilistic study (Q2665758) (← links)
- (Q2789548) (← links)
- Increasing Diamonds (Q2802941) (← links)
- The fraction of large random trees representing a given Boolean function in implicational logic (Q2884007) (← links)
- (Q2920847) (← links)
- (Q2959884) (← links)
- (Q2959913) (← links)
- The Combinatorics of Non-determinism (Q2963932) (← links)
- Pointed versus singular Boltzmann samplers: a comparative analysis (Q2973215) (← links)
- Intuitionistic vs. Classical Tautologies, Quantitative Comparison (Q3499752) (← links)
- Tautologies over implication with negative literals (Q3583801) (← links)
- Complexity and Limiting Ratio of Boolean Functions over Implication (Q3599140) (← links)
- Quantitative Comparison of Intuitionistic and Classical Logics - Full Propositional System (Q3605535) (← links)
- Classical and Intuitionistic Logic Are Asymptotically Identical (Q3608412) (← links)
- Full asymptotic expansion for Polya structures (Q4632483) (← links)
- Beyond series-parallel concurrent systems: the case of arch processes (Q4993536) (← links)
- Families of Monotonic Trees: Combinatorial Enumeration and Asymptotics (Q5042237) (← links)
- (Q5074777) (← links)
- Associativity for Binary Parallel Processes: A Quantitative Study (Q5174965) (← links)
- Balanced And/Or trees and linear threshold functions (Q5194664) (← links)
- Cuts in Increasing Trees (Q5194794) (← links)
- The Ordered and Colored Products in Analytic Combinatorics: Application to the Quantitative Study of Synchronizations in Concurrent Processes (Q5195032) (← links)
- Ranked Schröder Trees (Q5195226) (← links)
- The relation between tree size complexity and probability for Boolean functions generated by uniform random trees (Q5279893) (← links)
- Equivalence Classes of Random Boolean Trees and Application to the Catalan Satisfiability Problem (Q5405065) (← links)
- Compaction for two models of logarithmic‐depth trees: Analysis and experiments (Q6074703) (← links)
- A combinatorial link between labelled graphs and increasingly labelled Schröder trees (Q6109027) (← links)
- The Combinatorics of Barrier Synchronization (Q6144224) (← links)
- A combinatorial study of async/await processes (Q6164473) (← links)
- Catalan satisfiability problem (Q6241308) (← links)
- Binary Decision Diagrams: from Tree Compaction to Sampling (Q6322146) (← links)
- An iterative approach for counting reduced ordered binary decision diagrams (Q6416685) (← links)