On the Critical Exponent of Generalized Thue-Morse Words. - Alexandre Blondin Massé; Srecko Brlek; Amy Glen; Sébastien Labbé 001 (Discret. Math. Theor. Comput. Sci., 2007)

Reconstructing words from a fixed palindromic length sequence. - Alexandre Blondin Massé; Srecko Brlek; Andrea Frosini; Sébastien Labbé 001; Simone Rinaldi (IFIP TCS, 2008)

How Is Meaning Grounded in Dictionary Definitions? - Alexandre Blondin Massé; Guillaume Chicoisne; Yassine Gargouri; Stevan Harnad; Olivier Picard; Odile Marcotte (CoRR, 2008)

Christoffel and Fibonacci Tiles. - Alexandre Blondin Massé; Srecko Brlek; Ariane Garon; Sébastien Labbé 001 (DGCI, 2009)

Hierarchies in Dictionary Definition Space - Olivier Picard; Alexandre Blondin Massé; Stevan Harnad; Odile Marcotte; Guillaume Chicoisne; Yassine Gargouri (CoRR, 2009)

Codings of rotations on two intervals are full. - Alexandre Blondin Massé; Srecko Brlek; Sébastien Labbé 001; Laurent Vuillon (Electron. Notes Discret. Math., 2009)

Tiling the Plane with Permutations. - Alexandre Blondin Massé; Andrea Frosini; Simone Rinaldi; Laurent Vuillon (DGCI, 2011)

Equations on palindromes and circular words. - Alexandre Blondin Massé; Srecko Brlek; Ariane Garon; Sébastien Labbé 001 (Theor. Comput. Sci., 2011)

Two infinite families of polyominoes that tile the plane by translation in two distinct ways. - Alexandre Blondin Massé; Srecko Brlek; Ariane Garon; Sébastien Labbé 001 (Theor. Comput. Sci., 2011)

Palindromic complexity of codings of rotations. - Alexandre Blondin Massé; Srecko Brlek; Sébastien Labbé 001; Laurent Vuillon (Theor. Comput. Sci., 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é (2011)

Pseudoperiodic Words. - Alexandre Blondin Massé; Sébastien Gaboury; Sylvain Hallé (Developments in Language Theory, 2012)

A parallelogram tile fills the plane by translation in at most two distinct ways. - Alexandre Blondin Massé; Srecko Brlek; Sébastien Labbé 001 (Discret. Appl. Math., 2012)

Runtime Monitoring of Temporal Logic Properties in a Platform Game. - Simon Varvaressos; Dominic Vaillancourt; Sébastien Gaboury; Alexandre Blondin Massé; Sylvain Hallé (RV, 2013)

Solving equations on words through boolean satisfiability. - Michaël Larouche; Alexandre Blondin Massé; Sébastien Gaboury; Sylvain Hallé (SAC, 2013)

Hidden Structure and Function in the Lexicon. - Olivier Picard; Mélanie Lord; Alexandre Blondin Massé; Odile Marcotte; Marcos Lopes; Stevan Harnad (CoRR, 2013)

On the shape of permutomino tiles. - Alexandre Blondin Massé; Andrea Frosini; Simone Rinaldi; Laurent Vuillon (Discret. Appl. Math., 2013)

Multipseudoperiodic Words. - Alexandre Blondin Massé; Sarah Desmeules; Sébastien Gaboury; Sylvain Hallé (Int. J. Found. Comput. Sci., 2013)

Combinatorial properties of double square tiles. - Alexandre Blondin Massé; Ariane Garon; Sébastien Labbé 001 (Theor. Comput. Sci., 2013)

Exhaustive Exploration of Ajax Web Applications with Selective Jumping. - Sylvain Hallé; Gabriel Le Breton; Fabien Maronnaud; Alexandre Blondin Massé; Sébastien Gaboury (ICST Workshops, 2014)

Automated Bug Finding in Video Games: A Case Study for Runtime Monitoring. - Simon Varvaressos; Kim Lavoie; Alexandre Blondin Massé; Sébastien Gaboury; Sylvain Hallé (ICST, 2014)

Solving Equations on Words with Morphisms and Antimorphisms. - Alexandre Blondin Massé; Sébastien Gaboury; Sylvain Hallé; Michaël Larouche (LATA, 2014)

On the Arithmetics of Discrete Figures. - Alexandre Blondin Massé; Amadou Makhtar Tall; Hugo Tremblay (LATA, 2014)

Exhaustive generation of atomic combinatorial differential operators. - Hugo Tremblay; Gilbert Labelle; Srecko Brlek; Alexandre Blondin Massé (Theor. Comput. Sci., 2014)

Parallelogram Morphisms and Circular Codes. - Alexandre Blondin Massé; Mélodie Lapointe; Hugo Tremblay (LATA, 2016)

Efficient operations on discrete paths. - Alexandre Blondin Massé; Srecko Brlek; Hugo Tremblay (Theor. Comput. Sci., 2016)

The Latent Structure of Dictionaries. - Philippe Vincent-Lamarre; Alexandre Blondin Massé; Marcos Lopes; Mélanie Lord; Odile Marcotte; Stevan Harnad (Top. Cogn. Sci., 2016)

Fully Leafed Tree-Like Polyominoes and Polycubes. - Alexandre Blondin Massé; Julien de Carufel; Alain Goupil; Maxime Samson (IWOCA, 2017)

Fully Distributed Indexing over a Distributed Hash Table. - Simon Désaulniers; Adrien Béraud; Alexandre Blondin Massé; Nicolas Reynaud (UNet, 2017)

Linear time and space algorithms for discrete paths on the 1-uniform regular lattices of Z2. - Alexandre Blondin Massé; Éric Marcotte (Electron. Notes Discret. Math., 2017)

Nearest constrained circular words. - Guillaume Blin; Alexandre Blondin Massé; Marie Gasparoux; Sylvie Hamel; Élise Vandomme (CPM, 2018)

On the maximal number of leaves in induced subtrees of series-parallel graphs. - Moussa Abdenbi; Alexandre Blondin Massé; Alain Goupil (GASCom, 2018)

Non saturated polyhexes and polyiamonds. - Alexandre Blondin Massé; Julien de Carufel; Alain Goupil (GASCom, 2018)

Fully Leafed Induced Subtrees. - Alexandre Blondin Massé; Julien de Carufel; Alain Goupil; Mélodie Lapointe; Émile Nadeau; Élise Vandomme (IWOCA, 2018)

Preface. - Alexandre Blondin Massé; Srecko Brlek; Christophe Reutenauer (Int. J. Found. Comput. Sci., 2018)

Saturated fully leafed tree-like polyforms and polycubes. - Alexandre Blondin Massé; Julien de Carufel; Alain Goupil (J. Discrete Algorithms, 2018)

Leaf realization problem, caterpillar graphs and prefix normal words. - Alexandre Blondin Massé; Julien de Carufel; Alain Goupil; Mélodie Lapointe; Émile Nadeau; Élise Vandomme (Theor. Comput. Sci., 2018)

The Leaf Function for Graphs Associated with Penrose Tilings. - Carole Porrier; Alexandre Blondin Massé (GC, 2019)

Concept Analysis-Based Association Mining from Linked Data: A Case in Industrial Decision Making. - Mickael Wajnberg; Petko Valtchev; Mario Lezoche; Alexandre Blondin Massé; Hervé Panetto (JOWO, 2019)

Mining Process Factor Causality Links with Multi-relational Associations. - Mickael Wajnberg; Petko Valtchev; Mario Lezoche; Hervé Panetto; Alexandre Blondin Massé (K-CAP, 2019)

Mining Heterogeneous Associations from Pediatric Cancer Data by Relational Concept Analysis. - Mickael Wajnberg; Petko Valtchev; Alexandre Blondin Massé; Abderrahim Benmoussa; Maja Krajinovic; Caroline Laverdière; Emile Levy; Daniel Sinnett; Valérie Marcil (ICDM (Workshops), 2020)

FCA Went (Multi-)Relational, But Does It Make Any Difference? - Mickaël Wajnberg; Petko Valtchev; Mario Lezoche; Alexandre Blondin Massé; Hervé Panetto (FCA4AI@IJCAI, 2021)

Towards a Transformer-Based Reverse Dictionary Model for Quality Estimation of Definitions. - Julien Guité-Vinet; Alexandre Blondin Massé; Fatiha Sadat (CoRR, 2023)

The Leaf Function of Penrose P2 Graphs. - Carole Porrier; Alexandre Blondin Massé; Alain Goupil (CoRR, 2023)

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

Generation planning and operation under power stability constraints: A Hydro-Quebec use case. - Alexandre Besner; Alexandre Blondin Massé; Abderrahman Bani; Mouad Morabit; Luc Charest; David Ialongo; Simon Couture-Gagnon; Julien Fournier (CoRR, 2024)

On the Confluence of Directed Graph Reductions Preserving Feedback Vertex Set Minimality. - Moussa Abdenbi; Alexandre Blondin Massé; Alain Goupil; Odile Marcotte (GASCom, 2024)

A Perspective on Foundation Models for the Electric Power Grid. - Hendrik F. Hamann; Thomas Brunschwiler; Blazhe Gjorgiev; Leonardo S. A. Martins; Alban Puech; Anna Varbella; Jonas Weiss; Juan Bernabé-Moreno; Alexandre Blondin Massé; Seong Choi; Ian T. Foster; Bri-Mathias S. Hodge; et al. (CoRR, 2024)

Enumerating Minimum Feedback Vertex Sets in directed graphs with union-cat trees. - Moussa Abdenbi; Alexandre Blondin Massé; Alain Goupil; Mélodie Lapointe; Martin Lavoie (RAIRO Theor. Informatics Appl., 2024)

Accelerating quasi-static time series simulations with foundation models. - Alban Puech; François Mirallès; Jonas Weiss; Vincent Mai; Alexandre Blondin Massé; Martin De Montigny; Thomas Brunschwiler; Hendrik F. Hamann (Elektrotech. Informationstechnik, 2024)

Maximal 2-Dimensional Binary Words of Bounded Degree. - Alexandre Blondin Massé; Alain Goupil; Raphael L' Heureux; Louis Marin (WORDS, 2025)

Maximal 2-dimensional binary words of bounded degree. - Alexandre Blondin Massé; Alain Goupil; Ralphael L'Heureux; Louis Marin (CoRR, 2025)

Approaching the Source of Symbol Grounding with Confluent Reductions of Abstract Meaning Representation Directed Graphs. - Nicolas Goulet; Alexandre Blondin Massé; Moussa Abdendi (CoRR, 2025)