Contact

Département d'informatique
Université du Québec à Montréal
CP 8888, Succ. Centre-ville
Montréal (Québec) H3C 3P8
Phone: 514-987-3000, #5516
Office: PK-4525
Email: blondin_masse[dot]alexandre
[at]uqam[dot]ca

About

I have completed my Ph.D. in mathematics and computer science under the supervision of Professors Srecko Brlek, from Université du Québec à Montréal, in Canada, and Laurent Vuillon, from Université de Savoie, in France.

Since August 1st, 2014, I'm a regular assistant-professor at Université du Québec à Montréal, in Canada.

Links

Publications

[français]

Publications in Refereed Journals

  1. A. Blondin Massé, J. de Carufel, A. Goupil, M. Lapointe, É. Nadeau and É. Vandomme, Leaf realization problem, caterpillar graphs and prefix normal words. Theoretical Computer Science, Volume 732, p. 1-13, 2018.
  2. M. Wajnberg, M. Lezoche, A. Blondin Massé, P. Valtchev and H. Panetto, Complex system tacit knowledge extraction through a formal method. International Council on system engineering (INCOSE), Wiley, Volume 20, Number 4, p. 23-26, 2017
  3. A. Blondin Massé and É. Marcotte, Linear time and space algorithms for discrete paths on the 1-uniform regular lattices of Z^2. Electronic Notes in Discrete Mathematics, Jean-Marc Fédou and Luca Ferrari, Eds, Volume 59, p. 165-176, 2017.
  4. P. Vincent-Lamarre, M. Lord, A. Blondin Massé, O. Marcotte, M. Lopes and S. Harnad, Hidden Structure and Function in the Lexicon, Cognitive Approach to Natural Language Processing, Elsevier, Bernadette Sharp, Florence Sèdes et Wieslaw Lubaszewski, eds. p. 91-108, 2017.
  5. A. Blondin Massé, S. Brlek and H. Tremblay, Efficient operations on discrete paths, Theoretical Computer Science, Volume 624, p. 121-135, 2016.
  6. P. Vincent-Lamarre, A. Blondin Massé, M. Lopes, M. Lord, O. Marcotte and S. Harnad, The latent structure of dictionaries, Topics in Cognitive Science, Volume 8, Number 3, p. 625-659. 2016
  7. H. Tremblay, G. Labelle, S. Brlek an A. Blondin Massé, Exhaustive generation of atomic combinatorial differential operators. Theoretical Computer Science, Volume 536, p. 62-69, 2014.
  8. S. Desmeules, A. Blondin Massé, S. Hallé and S. Gaboury. Multipseudoperiodic words. International Journal of Foundations of Computer Science, World Scientific Publishing, 2013.
  9. A. Blondin Massé, A. Frosini, S. Rinaldi and L. Vuillon, On the shape of permutomino tiles, Discrete Applied Mathematics, Volume 161, Number 15, octobre 2013, p. 2316-2327.
  10. A. Blondin-Massé, G. Paquin, H. Tremblay and L. Vuillon, On generalized pseudostandard words over binary alphabets, Journal of Integer Sequences 16 no. Article 13.2.11, 2013.
  11. A. Blondin Massé, A. Garon, S. Labbé, Combinatorial properties of double square tiles, Theoretical Computer Science, Available since November 2nd, 2012, ISSN 0304-3975, http://dx.doi.org/10.1016/j.tcs.2012.10.040.
  12. A. Blondin Massé, S. Brlek and S. Labbé, A parallelogram tile fills the plane by translation in at most two distinct ways, Discrete Applied Mathematics, 2012.
  13. A. Blondin Massé, S. Brlek, A. Garon and S. Labbé. Two infinite families of polyominoes that tile the plane by translation in two distinct ways, Theoretical Computer Science, 2010.
  14. A. Blondin Massé, S. Brlek, A. Garon and S. Labbé. Equations on palindromes and circular words, Theoretical Computer Science, 2013.
  15. A. Blondin Massé, S. Brlek, S. Labbé and L. Vuillon. Codings of rotations on two intervals are full, Electronic Notes in Discrete Mathematics, vol. 34, 2009, 289--393, 10.1016/j.endm.2009.07.047.
  16. A. Blondin Massé, S. Brlek, S. Labbé and M. Mendès-France. Fibonacci snowflakes, special number of Annales des sciences mathématiques du Québec dedicated to Professor Paulo Ribenboim, 2009.
  17. A. Blondin Massé, S. Brlek, A. Garon and S. Labbé. Combinatorial properties of f-palindromes in the Thue-Morse sequence, Pure Mathematics and Applications, vol. 19, no. 2-3, 2008, p. 39-52.
  18. A. Blondin Massé, S. Brlek, A. Glen and S. Labbé. On the critical exponent of generalized Thue-Morse sequences, Discrete Mathematics and Theoretical Computer Science, vol. 9, no. 1, 2007, p. 293-304.

Conference proceedings

  1. A. Blondin Massé, J. de Carufel, A. Goupil, M. Lapointe, É. Nadeau and É. Vandomme, Fully leafed induced subtrees. 29th International workshop on combinatorial algorithms (IWOCA 2018), Singapore, Singapore Republic, 16-19 July 2018, Springer, Lecture Notes in Computer Science.
  2. G. Blin, A. Blondin Massé, M. Gasparoux, S. Hamel and É. Vandomme, Nearest constrained circular words. 29th Annual symposium on combinatorial pattern matching (CPM 2018), Qingdao, Chine, 2-4 July 2018, Leibniz International Proceedings in Informatics.
  3. M. Abdenbi, A. Blondin Massé and A. Goupil, On the maximal number of leaves in induced subtrees of series-parallel graphs. 11th Conference on random generation of combinatorial structures (GASCom 2018), CEUR Workshop Proceedings, Athens, Greece, 18-20 June 2018.
  4. A. Blondin Massé, J. de Carufel and A. Goupil, Non-saturated polyhexes and polyiamonds. 11th Conference on random generation of combinatorial structures (GASCom 2018), CEUR Workshop Proceedings, Athens, Greece, 18-20 June 2018.
  5. M. Wajnberg, M. Lezoche, A. Blondin Massé, P. Valtchev, H. Panetto and L. Tyvaert, Semantic interoperability of large systems through a formal method: relational concept analysis. 16th IFAC Symposium on Information Control Problems in Manufacturing (INCOM 2018), Bergamo, Italy, 11-13 June 2018.
  6. J.-M. Poulin, A. Blondin Massé and A. Fonseca, Strategies for learning lexemes efficiently: A graph-based approach, 10th International Conference on Advanced Cognitive Technologies and Applications (COGNITIVE 2018), Barcelona, Spain, 18-22 February 2018, XPS IARIA.
  7. A. Blondin Massé, J. de Carufel, A. Goupil and M. Samson, Fully Leafed Tree-Like Polyominoes and Polycubes. 28th International workshop on combinatorial algorithms (IWOCA 2017), New Castle, Australia, 17-21 July 2017, Springer, Lecture Notes in Computer Science.
  8. S. Désaulniers, A. Béraud, A. Blondin Massé and N. Reynaud, Fully distributed indexing over a distributed hash table. 3rd International symposium on ubiquitous networks (UNet 2017), Casablanca, Morocco, 9-12 May 2017, Springer, Lecture Notes in Computer Science.
  9. A. Blondin Massé, M. Lapointe and H. Tremblay. Parallelogram morphisms and circular codes, 10th International conference on languages and automata theory and applications (LATA 2016), Prag, Czech Republic, 14-18 March 2018. Springer, Lecture Notes in Computer Science, p. 221-232.
  10. A. Fonseca, F. Sadat and A. Blondin Massé. A Comparative Study on Different Classification Methods for the Identification of Brazilian Portuguese Multiword Expressions, 4th International Workshop on computational terminology (CompuTerm 2014), Dublin, Irland, 23-29 August 2014.
  11. A. Blondin Massé, A. Goupil and M. Lapointe. Tree and Snake Polyominoes of Maximal Area, 9th International conference on random generation of combinatorial structures (GASCom 2014), Bertinoro, Italy, 23-25 June 2014.
  12. S. Hallé, G. Le Breton, F. Maronnaud, A. Blondin Massé and S. Gaboury. Exhaustive Exploration of Ajax Web Applications With Selective Jumping, 10e Workshop on development and model testing (A-MOST 2014), Montréal, Canada, April 4th, 2014.
  13. A. Blondin Massé, S. Gaboury, S. Hallé and M. Larouche, Solving Equations on Words with Morphisms and Antimorphisms, 8th International conference on language, automata theory and applications (LATA 2014), Madrid, Spain, 10-14 March 2014.
  14. A. Blondin Massé, A. Makhtar Tall and H. Tremblay, On the Arithmetics of Discrete Figures, 8th International conference on language, automata theory and applications (LATA 2014), Madrid, Spain, 10-14 March 2014.
  15. S. Varvaressos, K. Lavoie, A. Blondin Massé, S. Gaboury and S. Hallé, Automated Bug Finding in Video Games: A Case Study for Runtime Monitoring. Dans B. Robinson, L. Williams et C. Wohlin, eds, IEEE 7th International conference on software testing, verification and validation, Cleveland, OH, USA, 31 mars-4 avril 2014.
  16. O. Picard, M. Lord, A. Blondin Massé, O. Marcotte and S. Harnad, Hidden Structure and Function in the Lexicon, 10th International workshop on natural language processing and cognitive science (NLPCS 2013), Marseille, France, 15-16 October 2013.
  17. M. Larouche, A. Blondin Massé, S. Gaboury and S. Hallé. Solving Equations on Words through Boolean Satisfiability. In J.C. Maldonado and S.Y. Shin, eds., Proceedings of Symposium on Applied Computing (SAC) supported by the ACM, Coimbra, Portugal, 18-22 March 2013. p. 104-106.
  18. S. Varvaressos, D. Vaillancourt, A. Blondin Massé, S. Gaboury and S. Hallé. Runtime Verification of Temporal Logic Properties in a Platform Game. In A. Legay, U. Fahrenberg, L. Traonouez, B. Boyer and E. Blin, eds., 4th International conference on real-time monitoring (RV 2013), Rennes, France, 24-27 September 2013, Springer, Lecture Notes in Computer Science.
  19. A. Blondin Massé, S. Gaboury and S. Hallé. Pseudoperiodic words, (DLT 2012) 16th International conference on development in language theory (14-17 August 2012, Taïpeï, Taïwan) 10p.
  20. H. Tremblay, G. Labelle, S. Brlek and A. Blondin Massé. Exhaustive generation of atomic combinatorial differential operators, (GASCom 2012) 8th International conference on random generation of combinatorial structures (25-27 June 2012, Bordeaux, France) 11p.
  21. A. Blondin Massé, A. Frosini, S. Rinaldi and L. Vuillon. Tiling the plane with permutations, (DGCI 2011) 16e International conference on discrete geometry for computer imagery (6-8 April 2011, Nancy, France) 12p.
  22. A. Blondin Massé, G. Paquin and L. Vuillon. A Fine and Wilf's theorem for pseudoperiods and Justin's formula for generalized pseudostandard words (JM2010) 13th Mons days of theoretical computer science (6-10 September 2010, Amiens, France) 8p.
  23. A. Blondin Massé, A. Garon and S. Labbé. Generation of double square tiles, (GASCom 2010) 8th International conference on random generation of combinatorial structures (2-4 September 2010, Montréal, Canada) 15p.
  24. A. Blondin Massé and L. Vuillon. Generalized pseudostandard words having complexity 2n, (LaCIM 2010) 20th Anniversary of Laboratoire de combinatoire et d'informatique mathématique (29-31 August 2010, Montréal, Canada) 13p.
  25. A. Blondin Massé, S. Brlek and S. Labbé. Combinatorial aspects of Escher tilings, (FPSAC 2010) 22nd International conference on formal power series and algebraic combinatorics (2-6 August 2010, San Francisco, USA) 12p.
  26. A. Blondin Massé, S. Brlek, A. Garon and S. Labbé. Every polyomino yields at most two square tilings, (Lattice Paths 2010) 7th International conference on lattice paths and applications (4-7 July 2010, Siena, Italy) 5p.
  27. A. Blondin Massé, A. Frosini, S. Rinaldi and L. Vuillon. Permutations tiling the plane, (Lattice Paths 2010) 7th International conference on lattice paths and applications (4-7 July 2010, Siena, Italy) 5p.
  28. O. Picard, A. Blondin Massé, S. Harnad, O. Marcotte, G. Chicoisne and Y. Gargouri. Hierarchies in Dictionary Definition Space, (NIPS-Graphs 2009) Workshop on network analysis and learning based on graph-theory (December 11th, 2009, Whistler, Canada, 9p. [arxiv]
  29. A. Blondin Massé, S. Brlek, A. Garon and S. Labbé. Christoffel and Fibonacci Tiles, (DGCI 2009) 15th International conference on discrete geometry for computer imagery (September 30-Octobre 2nd, 2009, Montréal, Canada) 8p., Springer LNCS 5810 (2009) p. 67-78.
  30. A. Blondin Massé, S. Brlek, A. Garon and S. Labbé. Palindromes and local periodicity, (Words 2009) 7th International conference on words (14-18 September 2009, Salerno, Italy) 8p.
  31. A. Blondin Massé, S. Brlek, S. Labbé and L. Vuillon. Codings of rotations on two intervals are full, In: Nsetril et A. Raspaud (Eds) (EuroComb 2009) European conference on combinatorics, graph theory and applications (7-11 September 2009, Bordeaux, France), Discrete Mathematics, Volume 34, p. 289-293, 2009.
  32. S. Brlek, A. Blondin Massé and S. Labbé. Combinatorial aspects of double squares, (PP2009) 7th International conference on permutations (13-17 July 2009, Florence, Italy), p. 35-43.
  33. S. Harnad, A. Blondin Massé, B. Saint-Louis, G. Chicoisne, Y. Gargouri and O. Picard. Symbol Grounding, Turing Testing and Robot Talking, International workshop on language, action and integration (22-24 September 2008, Roma, Italy) 8p.
  34. A. Blondin Massé, S. Brlek, A. Frosini, S. Labbé and S. Rinaldi. Reconstructing words from a fixed palindromic length sequence, TCS Proceedings 2008, 5th International conference on theoretical computer science (8-10 September 2008, Milano, Italy), IFIP International Federation for Information Processing (Springer, Boston) Volume 273 (2008) 101-114.
  35. A. Blondin Massé, G. Chicoisne, Y. Gargouri, S. Harnad, O. Marcotte and O. Picard. How is meaning grounded in dictionary definitions? (TextGraphs-3) 3rd Workshop on graph-based natural language processing (24 August 2008, Manchester, United Kingdom), 8p.
  36. A. Blondin Massé, S. Brlek and S. Labbé. Palindromic lacunas of the Thue-Morse word, Proceedings GASCom 2008, 6th International conference on random generation of combinatorial structures (16-20 June 2008, Arezzo, Italy), p. 53-67.
  37. A. Blondin Massé and S. Labbé. A note on the critical exponent of generalized Thue-Morse words, (Words 2007), 6th International conference on words (17-21 September 2007, Marseille, France), 6p.

Theses

  1. A. Blondin Massé. À l'intersection de la combinatoire des mots et de la géométrie discrète: palindromes, symétries et pavages, Ph.D thesis, Université du Québec à Montréal, Montréal, Canada and Université de Savoie, Chambéry, France, 2012.
  2. A. Blondin Massé. Sur le défaut palindromique des mots infinis, Master's thesis, Université du Québec à Montréal, Montréal, Canada, 2008.

Book chapter

  1. A. Blondin Massé, S. Harnad, O. Picard and B. Saint-Louis. Symbol Grounding and the Origin of Language: From Show to Tell. presented to Summer school on the origins of language. Institut des sciences cognitives, Université du Québec à Montréal, June 2010.

Poster presentations

  1. O. Picard, A. Blondin Massé and S. Harnad. Learning Word Meaning From Dictionary Definitions: Sensorimotor Induction Precedes Verbal Instruction, Summer school of Institut des sciences cognitives 2010, Université du Québec à Montréal (21-30 June 2010, Montréal, Canada).
  2. Y. Gargouri, O. Picard, A. Blondin Massé, G. Chicoisne, O. Marcotte and S. Harnad. Our external and internal lexicon: from the grounding kernel to the category commons, Summer school of Institut des sciences cognitives 2008, Université du Québec à Montréal (June 28th-July 6th, 2008, Montréal, Canada).
  3. G. Chicoisne, A. Blondin Massé, O. Picard and S. Harnad. Grounding abstract word definitions in prior concrete experience, 6th International conference on mental lexicon representation (7-10 October 2007, Banff, Canada).