Filtrer vos résultats
- 27
- 6
- 14
- 12
- 5
- 1
- 1
- 1
- 29
- 14
- 2
- 2
- 1
- 2
- 1
- 4
- 1
- 3
- 3
- 5
- 2
- 2
- 2
- 1
- 3
- 1
- 31
- 2
- 28
- 16
- 11
- 6
- 4
- 3
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 33
- 12
- 10
- 6
- 4
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
33 résultats
|
|
triés par
|
|
Combinatorial specification of permutation classes24th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2012), Jul 2012, Nagoya, Japan. pp.781 - 792, ⟨10.46298/dmtcs.3082⟩
Communication dans un congrès
hal-00685023v1
|
||
On the Sandpile group of Dual graphsEuropean Journal of Combinatorics, 2000, 21, pp.447--459
Article dans une revue
hal-00016380v1
|
|||
|
Quasi-tilingsFPSAC/SFCA'03, 2003, Linkoping, Sweden
Communication dans un congrès
hal-00016376v1
|
||
|
On the Identity of the Sandpile GroupDiscrete Mathematics, 2002, 256, 3, pp.775--790
Article dans une revue
hal-00016377v1
|
||
|
Polynomial Ideals for Sandpiles and their Grobner BasesTheoretical Computer Science, 2002, 276, 1-2, pp.1--15
Article dans une revue
hal-00016378v1
|
||
|
Proprietes combinatoires de certaines familles d'automates cellulairesCombinatorics [math.CO]. Ecole Polytechnique X, 2000. English. ⟨NNT : ⟩
Thèse
tel-00011297v1
|
||
|
Avalanche Polynomials of some Families of GraphsTrends in Mathematics, 2004, Mathematics and COmputer Science III, pp.81--94
Article dans une revue
hal-00016371v1
|
||
|
Edit Distance between Unlabeled Ordered TreesRAIRO - Theoretical Informatics and Applications (RAIRO: ITA), 2006, 40, pp.593-609
Article dans une revue
hal-00005569v1
|
||
|
Height-arrow ModelFPSAC-SFCA 04, 2004, Vancouver, Canada
Communication dans un congrès
hal-00015563v1
|
||
|
Deciding the finiteness of simple permutations contained in a wreath-closed class is polynomialPermutation Patterns 2009 (PP 2009), Jul 2009, Florence, Italy. pp.13-20
Communication dans un congrès
hal-00459647v1
|
||
|
2-Stack Sorting is polynomial2013
Pré-publication, Document de travail
hal-00809832v1
|
||
Longest Common Separable Pattern between PermutationsSymposium on Combinatorial Pattern Matching (CPM'07), 2007, London, Ontario, Canada, Canada. pp.316-327
Communication dans un congrès
hal-00620293v1
|
|||
Chip firing and vertex cover of squares of graphsRAIRO - Theoretical Informatics and Applications (RAIRO: ITA), 2006, To be published
Article dans une revue
hal-00112026v1
|
|||
|
Average-case analysis of perfect sorting by reversalsCPM'09, Jun 2009, Lille, France. pp.314-325, ⟨10.1007/978-3-642-02441-2_28⟩
Communication dans un congrès
hal-00354235v1
|
||
|
The Longest Common Pattern Problem for two PermutationsPure Mathematics and Applications, 2006, 17 (1-2), pp.55-69
Article dans une revue
hal-00115598v1
|
||
Bidimensionnal sand pile and ice pile modelsGASCOM 2006, 2006, Dijon, France
Communication dans un congrès
hal-00112032v1
|
|||
|
On the Toppling of a Sand PileDiscrete Models: Combinatorics, Computation, and Geometry, DM-CCG 2001, 2001, Paris, France. pp.275-286, ⟨10.46298/dmtcs.2283⟩
Communication dans un congrès
hal-01182963v1
|
||
|
Average-case analysis of perfect sorting by reversalsDiscrete Mathematics, Algorithms and Applications, 2011, 3 (3), pp.369-392. ⟨10.1142/S1793830911001280⟩
Article dans une revue
hal-00649761v1
|
||
|
An algorithm computing combinatorial specifications of permutation classesDiscrete Applied Mathematics, 2017, 224, pp.16-44. ⟨10.1016/j.dam.2017.02.013⟩
Article dans une revue
hal-01175234v1
|
||
|
An algorithm for deciding the finiteness of the number of simple permutations in permutation classesAdvances in Applied Mathematics, 2015, 64, pp.124 - 200. ⟨10.1016/j.aam.2014.12.001⟩
Article dans une revue
hal-01818308v1
|
||
|
Enumeration of Pin-PermutationsThe Electronic Journal of Combinatorics, 2011, 18 (1), pp.P57
Article dans une revue
hal-00348664v2
|
||
|
2-stack pushall sortable permutations2013
Pré-publication, Document de travail
hal-00801861v1
|
||
Plateforme d'expérimentation pour la modélisation par surfaces implicitesmodeleurs géométriques '97, 1997, Grenoble, France
Communication dans un congrès
inria-00510103v1
|
|||
|
Polynomial Ideals for Sandpiles and their Gröbner Bases[Research Report] RR-3946, INRIA. 2000
Rapport
inria-00072704v1
|
||
|
A variant of the tandem duplication - random loss model of genome rearrangementTheoretical Computer Science, 2009, 410 (8-10), pp.847-858. ⟨10.1016/j.tcs.2008.11.017⟩
Article dans une revue
hal-00206178v1
|
||
|
Bidimensional Sand Pile and Ice Pile Models2007
Pré-publication, Document de travail
hal-00159487v1
|
||
|
Deciding the finiteness of the number of simple permutations contained in a wreath-closed class is polynomialPure Mathematics and Applications, 2010, 21 (2), pp.119-135
Article dans une revue
hal-00458295v3
|
||
|
2-Stack Sorting is PolynomialTheory of Computing Systems, 2017, 60 (3), pp.552 - 579. ⟨10.1007/s00224-016-9743-8⟩
Article dans une revue
hal-01758837v1
|
||
|
Avalanche polynomials2006
Pré-publication, Document de travail
hal-00384994v1
|
||
|
Simple permutations poset2011
Pré-publication, Document de travail
hal-00649396v1
|
- 1
- 2