Recherche - Archive ouverte HAL Accéder directement au contenu

Filtrer vos résultats

24 résultats
Page :
triés par

Classical and intuitionistic logic are asymptotically identical

 Hervé Fournier , Danièle Gardy , Antoine Genitrini , Marek Zaionc
16th Annual Conference on Computer Science Logic, 2007, Lausanne, Switzerland. pp.177-193
Communication dans un congrès hal-00530534v1
Image document

On the size of projections:I

 E. Gelenbe , D. Gardy
RR-0105, INRIA. 1981
Rapport inria-00076455v1
Image document

Relational algebra operations and sizes of relations

 D. Gardy , C. Puech
RR-0317, INRIA. 1984
Rapport inria-00076240v1
Image document

On the size of projections:II.The case of a single functional dependency

 E. Gelenbe , D. Gardy
RR-0117, INRIA. 1982
Rapport inria-00076443v1
Image document

When is it worthwhile to propagate a constraint? A probabilistic analysis of AllDifferent

 Jérémie Du Boisberranger , Danièle Gardy , Xavier Lorca , Charlotte Truchet
Meeting on Analytic Algorithmics and Combinatorics, 2013, New Orleans, Louisiana, USA, United States. pp.80-90
Communication dans un congrès hal-00867576v1
Image document

And/or tree probabilities of Boolean functions

 Danièle Gardy , Alan Woods
2005 International Conference on Analysis of Algorithms, 2005, Barcelona, Spain. pp.139-146, ⟨10.46298/dmtcs.3355⟩
Communication dans un congrès hal-01184027v1
Image document

Boys-and-girls birthdays and Hadamard products

 Olivier Bodini , Danièle Gardy , Olivier Roussel
7th International Conference on Lattice Path Combinatorics and Applications, Jul 2010, Siena, Italy. pp.85-101, ⟨10.3233/FI-2012-689⟩
Communication dans un congrès hal-00641077v1
Image document

Average cost of orthogonal range queries in multiattribute trees

 Danièle Gardy , Philippe Flajolet , Claude Puech
[Research Report] RR-0892, INRIA. 1988
Rapport inria-00077098v1

The growing tree distribution on Boolean functions.

 Brigitte Chauvin , Danièle Gardy , Cécile Mailler
Proceedings of the 8th Workshop held in San Francisco, CA, January 22, 2011, Jan 2011, United States. pp.45-56
Communication dans un congrès hal-00745974v1

Balanced And/Or trees and linear threshold functions

 Hervé Fournier , Danièle Gardy , Antoine Genitrini
6th SIAM Workshop on Analytic and Combinatorics, 2008, New York, United States. pp.51-57
Communication dans un congrès hal-00530512v1

Complexity and Limiting Ratio of Boolean Functions over Implication.

 Hervé Fournier , Danièle Gardy , Antoine Genitrini , Bernhard Gittenberger
33rd International Symposium on Mathematical Foundations of Computer Science, 2008, Torun, Poland. pp.347-362
Communication dans un congrès hal-00530525v1
Image document

Arbres pour l'algorithmique

 Brigitte Chauvin , Julien Clément , Danièle Gardy
83, 2018, Mathématiques et Applications, 978-3-319-93724-3. ⟨10.1007/978-3-319-93725-0⟩
Ouvrages hal-01708981v3

The fraction of large random trees representing a given Boolean function in implicational logic

 Hervé Fournier , Danièle Gardy , Antoine Genitrini , Bernhard Gittenberger
Random Structures and Algorithms, 2012, 40 (3), pp.317--349
Article dans une revue hal-00551234v1
Image document

A Probabilistic Study of Bound Consistency for the Alldifferent Constraint

 Jérémie Du Boisberranger , Danièle Gardy , Charlotte Truchet , Xavier Lorca
2011
Rapport hal-00588888v1
Image document

Generating functions for generating trees

 Cyril Banderier , Philippe Flajolet , Danièle Gardy , Mireille Bousquet-Mélou , Alain Denise , et al.
Discrete Mathematics, 2002, 246 (1-3), pp.29-55
Article dans une revue hal-00003258v1
Image document

The weighted words collector

 Jérémie Du Boisberranger , Danièle Gardy , Yann Ponty
AOFA - 23rd International Meeting on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms - 2012, Nicolas, Broutin (INRIA, France) and Luc, Devroye (McGill, Canada), Jun 2012, Montreal, Canada. pp.243--264, ⟨10.46298/dmtcs.2998⟩
Communication dans un congrès hal-00666399v2
Image document

Weighted random generation of context-free languages: Analysis of collisions in random urn occupancy models

 Danièle Gardy , Yann Ponty
GASCOM - 8th conference on random generation of combinatorial structures - 2010, LACIM, UQAM, Sep 2010, Montréal, Canada. 14pp
Communication dans un congrès inria-00543150v1
Image document

Birthday paradox,coupon collectors,caching algorithms and self-organizing search

 Philippe Flajolet , Loÿs Thimonier , Danièle Gardy
[Research Report] RR-0720, INRIA. 1987
Rapport inria-00075832v1

A sprouting tree model for random Boolean functions

 Brigitte Chauvin , Danièle Gardy , Cécile Mailler
Random Structures and Algorithms, 2015, 47 (4), pp.635-662. ⟨10.1002/rsa.20567⟩
Article dans une revue hal-02063524v1

B-urns

 Brigitte Chauvin , Danièle Gardy , Nicolas Pouyanne , Dai-Hai Ton-That
ALEA : Latin American Journal of Probability and Mathematical Statistics, 2016, 13 (2), pp.605-634. ⟨10.30757/alea.v13-24⟩
Article dans une revue hal-02063525v1
Image document

On Generating Functions of Generating Trees

 Cyril Banderier , Mireille Bousquet-Mélou , Alain Denise , Philippe Flajolet , Danièle Gardy , et al.
[Research Report] RR-3661, INRIA. 1999
Rapport inria-00073011v1
Image document

Random Boolean expressions

 Danièle Gardy
Computational Logic and Applications, CLA '05, 2005, Chambéry, France. pp.1-36, ⟨10.46298/dmtcs.3475⟩
Communication dans un congrès hal-01183339v1
Image document

Threshold functions for small subgraphs in simple graphs and multigraphs

 Gwendal Collet , Elie de Panafieu , Danièle Gardy , Bernhard Gittenberger , Vlady Ravelomanana
2018
Pré-publication, Document de travail hal-01847358v2

Tautologies over implication with negative literals

 Hervé Fournier , Danièle Gardy , Antoine Genitrini , Marek Zaionc
Mathematical Logic Quarterly, 2010, 56 (4), pp.388-396. ⟨10.1002/malq.200810053⟩
Article dans une revue istex hal-00530496v1
Page :