Expressions et fonctions booléennes

D. Gardy. Arbres pour la logique. Ecole d'automne ADAMA, Madhia (Tunisie), 17-21 Octobre 2012.

H. Fournier, D. Gardy, A. Genitrini and B. Gittenberger. The fraction of large random trees representing a given Boolean function in implicational logic. Random Structures and Algorithms 40(3), May 2012, 317–349.

B. Chauvin, D. Gardy, C. Mailler. The growing tree distribution on Boolean functions. Siam workshop on Analytic Algorithmics and Combinatorics (ANALCO), January 2011, San Francisco (USA).

H. Fournier, D. Gardy, A. Genitrini, M. Zaionc. Tautologies over implication with negative literals. Math. Log. Quart. 56 (3), 2010.

H. Fournier, D. Gardy, A. Genitrini. Balanced And/Or trees and linear threshold functions. Siam workshop on Analytic Algorithmics and Combinatorics (ANALCO), January 2009, New York (USA).

A. Genitrini, G. Matecki, J. Kozik. On the density and the structure of the Peirce-like formulae. 5è colloque Mathématiques-Informatique (MCS'08), Blaubeuren (Allemagne), Sept. 2008.

H. Fournier, D. Gardy, A. Genitrini, B. Gittenberger. Complexity and limiting ratio of boolean functions over implication. MFCS'08, Torun (Pologne), Août 2008.

D. Gardy. Expressions booléennes aléatoires; application à la probabilité et complexité ­de fonctions booléennes.
Exposé invité, journées du GDR IM, Paris, 24-25 Janvier 2008.

A. Genitrini, J. Kozik, M. Zaionc. Intuitionistic vs. Classical Tautologies, Quantitative Comparison. Types 2007, actes parus dans LNCS 4941, pp. 100-109, 2008.

H. Fournier, D. Gardy, A. Genitrini, M. Zaionc. Classical and intuitionnistic logics are asymptotically identical. Computer Science Logic'07, proceedings in LNCS 4646, pp. 177-193, 2007.

D. Gardy. Random Boolean expressions.
Invited paper, Colloquium on Computational Logic and Applications, Chambéry, Juin 2005.
DMTCS Proceedings AF, pp. 1-36 R. David, D. Gardy, P. Lescanne, M. Zaionc (eds).

D. Gardy, A. Woods. Lower bounds on probabilities for Boolean functions.
First Intern. Conf. on the Analysis of Algorithms, Barcelona, Spain, June 2005.
DMTCS Proceedings, vol. AD(2005), pp. 139-146, C. Martinez (ed.).

B. Chauvin, P. Flajolet, D. Gardy and B. Gittenberger. And/Or trees revisited. Combinatorics, Probability and Computing, Vol. 13 No. 4-5, (2004) 475-487.

 Imprimer  E-mail

Our website is protected by DMC Firewall!