Alexandre Blondin Massé
Alexandre Blondin Massé
Professor of Computer Science, Université du Québec à Montréal
Verified email at uqam.ca - Homepage
TitleCited byYear
How is meaning grounded in dictionary definitions?
AB Massé, G Chicoisne, Y Gargouri, S Harnad, O Picard, O Marcotte
Proceedings of the 3rd Textgraphs Workshop on Graph-Based Algorithms for …, 2008
662008
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
312008
Palindromic lacunas of the Thue-Morse word
A Blondin Massé, S Brlek, S Labbé
Pure Mathematics and Applications 19 (2-3), 39-52, 2008
202008
Hierarchies in dictionary definition space
O Picard, A Blondin-Massé, S Harnad, O Marcotte, G Chicoisne, ...
arXiv preprint arXiv:0911.5703, 2009
192009
Palindromic complexity of codings of rotations
AB Massé, S Brlek, S Labbé, L Vuillon
Theoretical Computer Science 412 (46), 6455-6463, 2011
182011
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, 2017
172017
Christoffel and Fibonacci tiles
A Blondin-Massé, S Brlek, A Garon, S Labbé
International Conference on Discrete Geometry for Computer Imagery, 67-78, 2009
162009
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
152011
Fibonacci snowflakes
AB Massé, S Brlek, S Labbé, MM France
Annales des Sciences Mathématiques du Québec 35, 141-152, 2011
142011
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
132016
Combinatorial properties of double square tiles
AB Massé, A Garon, S Labbé
Theoretical Computer Science 502, 98-117, 2013
132013
Grounding abstract word definitions in prior concrete experience
G Chicoisne, A Blondin-Masse, O Picard, S Harnad
Sixth Annual Conference on the Mental Lexicon, 2008
132008
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
122008
Equations on palindromes and circular words
AB Massé, S Brlek, A Garon, S Labbé
Theoretical Computer Science 412 (27), 2922-2930, 2011
102011
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
102010
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
92012
Fully leafed tree-like polyominoes and polycubes
AB Massé, J de Carufel, A Goupil, M Samson
International Workshop on Combinatorial Algorithms, 206-218, 2017
72017
On generalized pseudostandard words over binary alphabets
AB Massé, G Paquin, J Tremblay, L Vuillon
72013
Complexity of the Fibonacci snowflake
AB Massé, S Brlek, S Labbé, MM France
Fractals 20 (03n04), 257-260, 2012
72012
On the critical exponent of generalized Thue-Morse words
A Blondin-Massé, S Brlek, A Glen, S Labbé
arXiv preprint arXiv:0710.4031, 2007
72007
The system can't perform the operation now. Try again later.
Articles 1–20