default search action
Alexandre Blondin Massé
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c24]Julien Guité-Vinet, Alexandre Blondin Massé, Fatiha Sadat:
Towards a Transformer-Based Reverse Dictionary Model for Quality Estimation of Definitions (Student Abstract). AAAI 2024: 23508-23509 - [c23]Moussa Abdenbi, Alexandre Blondin Massé, Alain Goupil, Odile Marcotte:
On the Confluence of Directed Graph Reductions Preserving Feedback Vertex Set Minimality. GASCom 2024: 6-11 - [i10]Alexandre Besner, Alexandre Blondin Massé, Abderrahman Bani, Mouad Morabit, Luc Charest, David Ialongo, Simon Couture-Gagnon, Julien Fournier:
Generation planning and operation under power stability constraints: A Hydro-Quebec use case. CoRR abs/2405.20199 (2024) - [i9]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, Rishabh Jain, Kibaek Kim, Vincent Mai, François Mirallès, Martin De Montigny, Octavio Ramos-Leaños, Hussein Suprême, Le Xie, El-Nasser S. Youssef, Arnaud Zinflou, Alexander J. Belvi, Ricardo J. Bessa, Bishnu Prasad Bhattari, Johannes Schmude, Stanislav Sobolevsky:
A Perspective on Foundation Models for the Electric Power Grid. CoRR abs/2407.09434 (2024) - 2023
- [i8]Julien Guité-Vinet, Alexandre Blondin Massé, Fatiha Sadat:
Towards a Transformer-Based Reverse Dictionary Model for Quality Estimation of Definitions. CoRR abs/2311.02985 (2023) - [i7]Carole Porrier, Alexandre Blondin Massé, Alain Goupil:
The Leaf Function of Penrose P2 Graphs. CoRR abs/2312.08262 (2023) - 2021
- [c22]Mickaël Wajnberg, Petko Valtchev, Mario Lezoche, Alexandre Blondin Massé, Hervé Panetto:
FCA Went (Multi-)Relational, But Does It Make Any Difference? FCA4AI@IJCAI 2021: 27-38 - 2020
- [c21]Mickael Wajnberg, Petko Valtchev
, Alexandre Blondin Massé, Abderrahim Benmoussa
Mining Heterogeneous Associations from Pediatric Cancer Data by Relational Concept Analysis. ICDM (Workshops) 2020: 597-604
2010 – 2019
- 2019
- [c20]Carole Porrier
The Leaf Function for Graphs Associated with Penrose Tilings. GC 2019: 37-44 - [c19]Mickael Wajnberg, Petko Valtchev, Mario Lezoche, Alexandre Blondin Massé, Hervé Panetto:
Concept Analysis-Based Association Mining from Linked Data: A Case in Industrial Decision Making. JOWO 2019 - [c18]Mickael Wajnberg, Petko Valtchev
Mining Process Factor Causality Links with Multi-relational Associations. K-CAP 2019: 263-266 - 2018
- [j16]Alexandre Blondin Massé, Srecko Brlek, Christophe Reutenauer:
Preface. Int. J. Found. Comput. Sci. 29(5): 701-704 (2018) - [j15]Alexandre Blondin Massé, Julien de Carufel, Alain Goupil:
Saturated fully leafed tree-like polyforms and polycubes. J. Discrete Algorithms 52-53: 38-54 (2018) - [j14]Alexandre Blondin Massé, Julien de Carufel, Alain Goupil, Mélodie Lapointe, Émile Nadeau, Élise Vandomme
Leaf realization problem, caterpillar graphs and prefix normal words. Theor. Comput. Sci. 732: 1-13 (2018) - [c17]Guillaume Blin, Alexandre Blondin Massé, Marie Gasparoux, Sylvie Hamel, Élise Vandomme
Nearest constrained circular words. CPM 2018: 6:1-6:14 - [c16]Moussa Abdenbi, Alexandre Blondin Massé, Alain Goupil:
On the maximal number of leaves in induced subtrees of series-parallel graphs. GASCom 2018: 24-31 - [c15]Alexandre Blondin Massé, Julien de Carufel, Alain Goupil:
Non saturated polyhexes and polyiamonds. GASCom 2018: 116-123 - [c14]Alexandre Blondin Massé, Julien de Carufel, Alain Goupil, Mélodie Lapointe, Émile Nadeau, Élise Vandomme
Fully Leafed Induced Subtrees. IWOCA 2018: 90-101 - 2017
- [j13]Alexandre Blondin Massé, Éric Marcotte:
Linear time and space algorithms for discrete paths on the 1-uniform regular lattices of Z2. Electron. Notes Discret. Math. 59: 165-176 (2017) - [c13]Alexandre Blondin Massé, Julien de Carufel, Alain Goupil, Maxime Samson:
Fully Leafed Tree-Like Polyominoes and Polycubes. IWOCA 2017: 206-218 - [c12]Simon Désaulniers, Adrien Béraud, Alexandre Blondin Massé, Nicolas Reynaud:
Fully Distributed Indexing over a Distributed Hash Table. UNet 2017: 308-318 - [i6]Alexandre Blondin Massé, Julien de Carufel, Alain Goupil, Mélodie Lapointe, Émile Nadeau, Élise Vandomme:
Fully leafed induced subtrees. CoRR abs/1709.09808 (2017) - 2016
- [j12]Alexandre Blondin Massé, Srecko Brlek, Hugo Tremblay
Efficient operations on discrete paths. Theor. Comput. Sci. 624: 121-135 (2016) - [j11]Philippe Vincent-Lamarre
The Latent Structure of Dictionaries. Top. Cogn. Sci. 8(3): 625-659 (2016) - [c11]Alexandre Blondin Massé, Mélodie Lapointe, Hugo Tremblay
Parallelogram Morphisms and Circular Codes. LATA 2016: 221-232 - 2014
- [j10]Hugo Tremblay
Exhaustive generation of atomic combinatorial differential operators. Theor. Comput. Sci. 536: 62-69 (2014) - [c10]Simon Varvaressos, Kim Lavoie, Alexandre Blondin Massé, Sébastien Gaboury, Sylvain Hallé
Automated Bug Finding in Video Games: A Case Study for Runtime Monitoring. ICST 2014: 143-152 - [c9]Sylvain Hallé
Exhaustive Exploration of Ajax Web Applications with Selective Jumping. ICST Workshops 2014: 243-252 - [c8]Alexandre Blondin Massé, Sébastien Gaboury, Sylvain Hallé
Solving Equations on Words with Morphisms and Antimorphisms. LATA 2014: 186-197 - [c7]Alexandre Blondin Massé, Amadou Makhtar Tall, Hugo Tremblay
On the Arithmetics of Discrete Figures. LATA 2014: 198-209 - [i5]Philippe Vincent-Lamarre, Alexandre Blondin Massé, Marcos Lopes, Mélanie Lord, Odile Marcotte, Stevan Harnad:
The Latent Structure of Dictionaries. CoRR abs/1411.0129 (2014) - 2013
- [j9]Alexandre Blondin Massé, Andrea Frosini, Simone Rinaldi, Laurent Vuillon:
On the shape of permutomino tiles. Discret. Appl. Math. 161(15): 2316-2327 (2013) - [j8]Alexandre Blondin Massé, Sarah Desmeules, Sébastien Gaboury, Sylvain Hallé
Multipseudoperiodic Words. Int. J. Found. Comput. Sci. 24(7): 1153-1166 (2013) - [j7]Alexandre Blondin Massé, Ariane Garon, Sébastien Labbé
Combinatorial properties of double square tiles. Theor. Comput. Sci. 502: 98-117 (2013) - [c6]Simon Varvaressos, Dominic Vaillancourt, Sébastien Gaboury, Alexandre Blondin Massé, Sylvain Hallé
Runtime Monitoring of Temporal Logic Properties in a Platform Game. RV 2013: 346-351 - [c5]Michaël Larouche, Alexandre Blondin Massé, Sébastien Gaboury, Sylvain Hallé
Solving equations on words through boolean satisfiability. SAC 2013: 104-106 - [i4]Olivier Picard, Mélanie Lord, Alexandre Blondin Massé, Odile Marcotte, Marcos Lopes, Stevan Harnad:
Hidden Structure and Function in the Lexicon. CoRR abs/1308.2428 (2013) - 2012
- [j6]Alexandre Blondin Massé, Srecko Brlek, Sébastien Labbé
A parallelogram tile fills the plane by translation in at most two distinct ways. Discret. Appl. Math. 160(7-8): 1011-1018 (2012) - [c4]Alexandre Blondin Massé, Sébastien Gaboury, Sylvain Hallé
Pseudoperiodic Words. Developments in Language Theory 2012: 308-319 - 2011
- [b1]Alexandre Blondin Massé:
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). Grenoble Alpes University, France, 2011 - [j5]Alexandre Blondin Massé, Srecko Brlek, Ariane Garon, Sébastien Labbé
Equations on palindromes and circular words. Theor. Comput. Sci. 412(27): 2922-2930 (2011) - [j4]Alexandre Blondin Massé, Srecko Brlek, Ariane Garon, Sébastien Labbé
Two infinite families of polyominoes that tile the plane by translation in two distinct ways. Theor. Comput. Sci. 412(36): 4778-4786 (2011) - [j3]Alexandre Blondin Massé, Srecko Brlek, Sébastien Labbé
Palindromic complexity of codings of rotations. Theor. Comput. Sci. 412(46): 6455-6463 (2011) - [c3]Alexandre Blondin Massé, Andrea Frosini, Simone Rinaldi, Laurent Vuillon:
Tiling the Plane with Permutations. DGCI 2011: 381-393
2000 – 2009
- 2009
- [j2]Alexandre Blondin Massé, Srecko Brlek, Sébastien Labbé
Codings of rotations on two intervals are full. Electron. Notes Discret. Math. 34: 289-293 (2009) - [c2]Alexandre Blondin Massé, Srecko Brlek, Ariane Garon, Sébastien Labbé
Christoffel and Fibonacci Tiles. DGCI 2009: 67-78 - [i3]Olivier Picard, Alexandre Blondin Massé, Stevan Harnad, Odile Marcotte, Guillaume Chicoisne, Yassine Gargouri:
Hierarchies in Dictionary Definition Space. CoRR abs/0911.5703 (2009) - 2008
- [c1]Alexandre Blondin Massé, Srecko Brlek, Andrea Frosini, Sébastien Labbé
Reconstructing words from a fixed palindromic length sequence. IFIP TCS 2008: 101-114 - [i2]Alexandre Blondin Massé, Guillaume Chicoisne, Yassine Gargouri, Stevan Harnad, Olivier Picard, Odile Marcotte:
How Is Meaning Grounded in Dictionary Definitions? CoRR abs/0806.3710 (2008) - 2007
- [j1]Alexandre Blondin Massé, Srecko Brlek, Amy Glen, Sébastien Labbé:
On the Critical Exponent of Generalized Thue-Morse Words. Discret. Math. Theor. Comput. Sci. 9(1) (2007) - [i1]Alexandre Blondin Massé, Srecko Brlek, Amy Glen, Sébastien Labbé:
On the critical exponent of generalized Thue-Morse words. CoRR abs/0710.4031 (2007)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-23 23:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: