Alexandre Blondin Massé - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 39 from 39

2024

Towards a Transformer-Based Reverse Dictionary Model for Quality Estimation of Definitions (Student Abstract)Julien Guité-Vinet, Alexandre Blondin Massé, Fatiha Sadat. AAAI 2024: 23508-23509 [doi]

2021

FCA Went (Multi-)Relational, But Does It Make Any Difference?Mickaël Wajnberg, Petko Valtchev, Mario Lezoche, Alexandre Blondin Massé, Hervé Panetto. IJCAI 2021: 27-38 [doi]

2020

Mining Heterogeneous Associations from Pediatric Cancer Data by Relational Concept AnalysisMickael Wajnberg, Petko Valtchev, Alexandre Blondin Massé, Abderrahim Benmoussa, Maja Krajinovic, Caroline Laverdière, Emile Levy, Daniel Sinnett, Valérie Marcil. icdm 2020: 597-604 [doi]

2019

2018

On the maximal number of leaves in induced subtrees of series-parallel graphsMoussa Abdenbi, Alexandre Blondin Massé, Alain Goupil. gascom 2018: 24-31 [doi]

Nearest constrained circular wordsGuillaume Blin, Alexandre Blondin Massé, Marie Gasparoux, Sylvie Hamel, Élise Vandomme. cpm 2018: [doi]

Non saturated polyhexes and polyiamondsAlexandre Blondin Massé, Julien de Carufel, Alain Goupil. gascom 2018: 116-123 [doi]

Fully Leafed Induced SubtreesAlexandre Blondin Massé, Julien de Carufel, Alain Goupil, Mélodie Lapointe, Émile Nadeau, Élise Vandomme. iwoca 2018: 90-101 [doi]

PrefaceAlexandre Blondin Massé, Srecko Brlek, Christophe Reutenauer, Valérie Berthé, Francesco Dolce, Fabien Durand, Julien Leroy 0002, Dominique Perrin. ijfcs, 29(5):701-704, 2018. [doi]

Saturated fully leafed tree-like polyforms and polycubesAlexandre Blondin Massé, Julien de Carufel, Alain Goupil. jda, 52:38-54, 2018. [doi]

Leaf realization problem, caterpillar graphs and prefix normal wordsAlexandre Blondin Massé, Julien de Carufel, Alain Goupil, Mélodie Lapointe, Émile Nadeau, Élise Vandomme. TCS, 732:1-13, 2018. [doi]

2017

Fully Distributed Indexing over a Distributed Hash TableSimon Désaulniers, Adrien Béraud, Alexandre Blondin Massé, Nicolas Reynaud. unet 2017: 308-318 [doi]

Fully Leafed Tree-Like Polyominoes and PolycubesAlexandre Blondin Massé, Julien de Carufel, Alain Goupil, Maxime Samson. iwoca 2018: 206-218 [doi]

2Alexandre Blondin Massé, Éric Marcotte. endm, 59:165-176, 2017. [doi]

2016

2014

Exhaustive Exploration of Ajax Web Applications with Selective JumpingSylvain Hallé, Gabriel Le Breton, Fabien Maronnaud, Alexandre Blondin Massé, Sébastien Gaboury. icst 2014: 243-252 [doi]

On the Arithmetics of Discrete FiguresAlexandre Blondin Massé, Amadou Makhtar Tall, Hugo Tremblay. LATA 2014: 198-209 [doi]

Solving Equations on Words with Morphisms and AntimorphismsAlexandre Blondin Massé, Sébastien Gaboury, Sylvain Hallé, Michaël Larouche. LATA 2014: 186-197 [doi]

Exhaustive generation of atomic combinatorial differential operatorsHugo Tremblay, Gilbert Labelle, Srecko Brlek, Alexandre Blondin Massé. TCS, 536:62-69, 2014. [doi]

Automated Bug Finding in Video Games: A Case Study for Runtime MonitoringSimon Varvaressos, Kim Lavoie, Alexandre Blondin Massé, Sébastien Gaboury, Sylvain Hallé. icst 2014: 143-152 [doi]

2013

2012

A parallelogram tile fills the plane by translation in at most two distinct waysAlexandre Blondin Massé, Srecko Brlek, Sébastien Labbé. DAM, 160(7-8):1011-1018, 2012. [doi]

Pseudoperiodic WordsAlexandre Blondin Massé, Sébastien Gaboury, Sylvain Hallé. dlt 2012: 308-319 [doi]

2011

A l'intersection de la combinatoire des mots et de la géométrie discrète : palindromes, symétries et pavages. (At the intersection of combinatorics on words and discrete geometry : palindromes, symmetries and tilings)Alexandre Blondin Massé. PhD thesis, Grenoble Alpes University, France, 2011. [doi]

Tiling the Plane with PermutationsAlexandre Blondin Massé, Andrea Frosini, Simone Rinaldi, Laurent Vuillon. dgci 2011: 381-393 [doi]

Two infinite families of polyominoes that tile the plane by translation in two distinct waysAlexandre Blondin Massé, Srecko Brlek, Ariane Garon, Sébastien Labbé. TCS, 412(36):4778-4786, 2011. [doi]

Equations on palindromes and circular wordsAlexandre Blondin Massé, Srecko Brlek, Ariane Garon, Sébastien Labbé. TCS, 412(27):2922-2930, 2011. [doi]

Palindromic complexity of codings of rotationsAlexandre Blondin Massé, Srecko Brlek, Sébastien Labbé, Laurent Vuillon. TCS, 412(46):6455-6463, 2011. [doi]

2009

Codings of rotations on two intervals are fullAlexandre Blondin Massé, Srecko Brlek, Sébastien Labbé, Laurent Vuillon. endm, 34:289-293, 2009. [doi]

2008

Reconstructing words from a fixed palindromic length sequenceAlexandre Blondin Massé, Srecko Brlek, Andrea Frosini, Sébastien Labbé, Simone Rinaldi. ifipTCS 2008: 101-114 [doi]

2007

On the Critical Exponent of Generalized Thue-Morse WordsAlexandre Blondin Massé, Srecko Brlek, Amy Glen, Sébastien Labbé. dmtcs, 9(1), 2007. [doi]

All Publications

Filter by Year
OR AND NOT 1

Filter by Type
OR AND NOT 1

Filter by Tag
OR AND NOT 1

Filter by Venue

[+]
OR AND NOT 1

Filter by Author

[+]
OR AND NOT 1

Filter by Top Terms

[+]
OR AND NOT 1

Researchr

Publications by 'Alexandre Blondin Massé'

Viewing Publication 1 - 39 from 39

2024

2021

2020

2019

2018

2017

2016

2014

2013

2012

2011

2009

2008

2007

All Publications

Filter by YearOR AND NOT 1

Filter by TypeOR AND NOT 1

Filter by TagOR AND NOT 1

Filter by Venue [+]OR AND NOT 1

Filter by Author [+]OR AND NOT 1

Filter by Top Terms [+]OR AND NOT 1

Researchr

Publications by 'Alexandre Blondin Massé'

Viewing Publication 1 - 39 from 39

2024

2021

2020

2019

2018

2017

2016

2014

2013

2012

2011

2009

2008

2007

Filter by Year
OR AND NOT 1

Filter by Type
OR AND NOT 1

Filter by Tag
OR AND NOT 1

Filter by Venue

[+]
OR AND NOT 1

Filter by Author

[+]
OR AND NOT 1

Filter by Top Terms

[+]
OR AND NOT 1