default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFrançois Lemieux
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2013
[c12]Michel C. Desmarais, François Lemieux:
Clustering and Visualizing Study State Sequences. EDM 2013: 224-227
2000 – 2009
- 2009
- [c11]Martin Beaudry, François Lemieux:
Faithful Loops for Aperiodic E-Ordered Monoids. ICALP (2) 2009: 55-66 - 2007
- [j3]François Lemieux, Michel C. Desmarais:
Conception centrée sur l'utilisateur lors de la définition des exigences en RUP©. Une étude de cas. Ingénierie des Systèmes d Inf. 12(6): 9-37 (2007) - 2006
- [c10]François Lemieux, Martin Salois:
Visualization Techniques for Program Comprehension - A Literature Review. SoMeT 2006: 22-47 - 2005
- [c9]Martin Beaudry, François Lemieux, Denis Thérien:
Groupoids That Recognize Only Regular Languages. ICALP 2005: 421-433 - 2004
- [c8]François Bernier, Eric Boivin, Denis Laurendeau, Marielle Mokhtari, François Lemieux:
Conceptual Models for Describing Virtual Worlds. WSCG (Posters) 2004: 25-28 - [c7]Marielle Mokhtari, François Bernier, François Lemieux, H. Martel, Jean-Marc Schwartz, Denis Laurendeau, Alexandra Branzan Albu:
Virtual Environment and Sensori-Motor Activities: Haptic, Auditory and Olfactory Devices. WSCG (Posters) 2004: 109-112 - [c6]Marielle Mokhtari, François Lemieux, François Bernier, Denis Ouellet, Richard Drouin, Denis Laurendeau, Alexandra Branzan Albu:
Virtual Environment and Sensori-Motor Activities: Visualization. WSCG 2004: 293-300 - 2001
- [c5]Martin Beaudry, François Lemieux, Denis Thérien:
Star-Free Open Languages and Aperiodic Loops. STACS 2001: 87-98 - 2000
- [j2]Cristopher Moore
, Denis Thérien, François Lemieux, Joshua Berman, Arthur Drisko:
Circuits and Expressions with Nonassociative Gates. J. Comput. Syst. Sci. 60(2): 368-394 (2000)
1990 – 1999
- 1997
- [c4]Joshua Berman, Arthur Drisko, François Lemieux, Cristopher Moore, Denis Thérien:
Circuits and Expressions with NOn-Associative Gates. CCC 1997: 193-203 - [c3]Martin Beaudry, François Lemieux, Denis Thérien:
Finite Loops Recognize Exactly the Regular Open Languages. ICALP 1997: 110-120 - 1994
- [c2]Hervé Caussinus, François Lemieux:
The Complexity of Computing over Quasigroups. FSTTCS 1994: 36-47 - 1993
- [j1]François Bédard, François Lemieux, Pierre McKenzie:
Extensions to Barrington's M-Program Model. Theor. Comput. Sci. 107(1): 31-61 (1993) - 1990
- [c1]François Bédard, François Lemieux, Pierre McKenzie:
Extensions to Barrington's M-Program Model. SCT 1990: 200-209
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-04-24 23:06 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:
