Skip to Main content Skip to Navigation
Conference papers

Longest Common Separable Pattern between Permutations

Mathilde Bouvel Dominique Rossin Stéphane Vialette 1
1 LIGM - Laboratoire d'Informatique Gaspard-Monge
Document type :
Conference papers
Complete list of metadata
https://hal-upec-upem.archives-ouvertes.fr/hal-00620293
Contributor : Stéphane Vialette Connect in order to contact the contributor
Submitted on : Wednesday, September 7, 2011 - 3:53:06 PM
Last modification on : Saturday, January 15, 2022 - 3:59:22 AM

Identifiers

  • HAL Id : hal-00620293, version 1

Collections

CNRS | LIGM_ALGO | UNIV-MLV | LIGM | ENPC | PARISTECH | UPEC-UPEM

Citation

Mathilde Bouvel, Dominique Rossin, Stéphane Vialette. Longest Common Separable Pattern between Permutations. Symposium on Combinatorial Pattern Matching (CPM'07), 2007, London, Ontario, Canada, Canada. pp.316-327. ⟨hal-00620293⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Les métriques sont temporairement indisponibles