Alexandre Blondin Massé
Alexandre Blondin Massé
Professor of Computer Science, Université du Québec à Montréal
Verified email at - Homepage
Cited by
Cited by
How is meaning grounded in dictionary definitions?
AB Massé, G Chicoisne, Y Gargouri, S Harnad, O Picard, O Marcotte
arXiv preprint arXiv:0806.3710, 2008
Automated bug finding in video games: A case study for runtime monitoring
S Varvaressos, K Lavoie, S Gaboury, S Hallé
Computers in Entertainment (CIE) 15 (1), 1-28, 2017
Combinatorial properties of f-palindromes in the Thue-Morse sequence
A Blondin-Massé, S Brlek, A Garon, S Labbé
Pure Math. Appl 19 (2-3), 39-52, 2008
Palindromic lacunas of the Thue-Morse word
A Blondin Massé, S Brlek, S Labbé
Pure Mathematics and Applications 19 (2-3), 39-52, 2008
The latent structure of dictionaries
P Vincent‐Lamarre, AB Massé, M Lopes, M Lord, O Marcotte, S Harnad
Topics in cognitive science 8 (3), 625-659, 2016
Palindromic complexity of codings of rotations
AB Massé, S Brlek, S Labbé, L Vuillon
Theoretical computer science 412 (46), 6455-6463, 2011
Hierarchies in dictionary definition space
O Picard, A Blondin-Massé, S Harnad, O Marcotte, G Chicoisne, ...
arXiv preprint arXiv:0911.5703, 2009
Two infinite families of polyominoes that tile the plane by translation in two distinct ways
AB Massé, S Brlek, A Garon, S Labbé
Theoretical computer science 412 (36), 4778-4786, 2011
Christoffel and Fibonacci tiles
A Blondin-Massé, S Brlek, A Garon, S Labbé
International Conference on Discrete Geometry for Computer Imagery, 67-78, 2009
Fibonacci snowflakes
AB Massé, S Brlek, S Labbé, MM France
Annales des sciences mathématiques du Québec 35, 141-152, 2011
Combinatorial properties of double square tiles
AB Massé, A Garon, S Labbé
Theoretical Computer Science 502, 98-117, 2013
Reconstructing words from a fixed palindromic length sequence
AB Massé, S Brlek, A Frosini, S Labbé, S Rinaldi
Fifth Ifip International Conference On Theoretical Computer Science–Tcs 2008 …, 2008
Grounding abstract word definitions in prior concrete experience
G Chicoisne, A Blondin-Masse, O Picard, S Harnad
Equations on palindromes and circular words
AB Massé, S Brlek, A Garon, S Labbé
Theoretical computer science 412 (27), 2922-2930, 2011
Every polyomino yields at most two square tilings
AB Massé, S Brlek, A Garon, S Labbé
7th Int. Conf. on Lattice Paths Combinatorics and Applications, 2010
Leaf realization problem, caterpillar graphs and prefix normal words
AB Massé, J De Carufel, A Goupil, M Lapointe, É Nadeau, É Vandomme
Theoretical Computer Science 732, 1-13, 2018
Fully leafed tree-like polyominoes and polycubes
A Blondin Massé, J Carufel, A Goupil, M Samson
International Workshop on Combinatorial Algorithms, 206-218, 2017
Exhaustive exploration of ajax web applications with selective jumping
S Hallé, G Le Breton, F Maronnaud, AB Massé, S Gaboury
2014 IEEE Seventh International Conference on Software Testing, Verification …, 2014
A parallelogram tile fills the plane by translation in at most two distinct ways
AB Massé, S Brlek, S Labbé
Discrete Applied Mathematics 160 (7-8), 1011-1018, 2012
On the critical exponent of generalized Thue-Morse words
S Labbé, A Glen, S Brlek, AB Massé
Discrete Mathematics & Theoretical Computer Science 9, 2007
The system can't perform the operation now. Try again later.
Articles 1–20