default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichel Bauderon
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2009
[c16]Michel Bauderon, Rui Chen, Olivier Ly:
Context-Free Categorical Grammars. CAI 2009: 160-171- 2008
- [c15]Michel Bauderon, Rui Chen, Olivier Ly:
Pullback Grammars Are Context-Free. ICGT 2008: 366-378 - 2002
- [c14]Michel Bauderon, Frédérique Carrère:
Decomposing Graphs with Symmetries. ICGT 2002: 45-59 - [c13]Michel Bauderon, Mohamed Mosbah
:
A Unified Framework for Designing, Implementing and Visualizing Distributed Algorithms. GT-VMT@ICGT 2002: 13-24 - 2001
- [j5]Michel Bauderon, Hélène Jacquet:
Pullback as a Generic Graph Rewriting Mechanism. Appl. Categorical Struct. 9(1): 65-82 (2001) - [j4]Michel Bauderon, Hélène Jacquet:
Node rewriting in graphs and hypergraphs: a categorical framework. Theor. Comput. Sci. 266(1-2): 463-487 (2001) - [c12]Michel Bauderon, Hélène Jacquet, Renate Klempien-Hinrichs:
Pullback rewriting and applications. GETGRATS Closing Workshop 2001: 83-92 - [c11]Michel Bauderon, Yves Métivier, Mohamed Mosbah, Afif Sellami:
Graph Relabelling Systems: a Tool for Encoding, Proving, Studying and Visualizing - Distributed Algorithms. GETGRATS Closing Workshop 2001: 93-107 - [c10]Michel Bauderon, Stefan Gruner, Yves Métivier, Mohamed Mosbah, Afif Sellami:
Visualization of Distributed Algorithms Based on Graph Relabelling Systems. GT-VMT@ICALP 2001: 227-237 - [c9]Michel Bauderon, Andrea Corradini:
Preface. GETGRATS Closing Workshop 2001: 319 - [e1]Michel Bauderon, Andrea Corradini:
GETGRATS Closing Workshop 2001, Bordeaux, France, June 22-23, 2001. Electronic Notes in Theoretical Computer Science 51, Elsevier 2001 [contents]
1990 – 1999
- 1996
- [c8]Michel Bauderon, Hélène Jacquet:
Node Rewriting in Hypergraphs. WG 1996: 31-43 - 1995
- [c7]Michel Bauderon:
A Uniform Approach to Graph Rewriting: The Pullback Approach. WG 1995: 101-115 - [c6]Michel Bauderon:
Parallel rewriting of graphs through the pullback approach. SEGRAGRA 1995: 19-26 - 1994
- [c5]Michel Bauderon:
A Category-Theoretical Approach to Vertex Replacement: The Generation of Infinite Graphs. TAGT 1994: 27-37 - 1992
- [j3]Michel Bauderon:
Infinite Hypergraphs II: Systems of Recursive Equations. Theor. Comput. Sci. 103(2): 165-190 (1992) - 1991
- [j2]Michel Bauderon:
Infinite Hypergraphs I. Basic Properties. Theor. Comput. Sci. 82(2): 177-214 (1991) - 1990
- [c4]Michel Bauderon:
General Solution to a System of Recursive Equations. Graph-Grammars and Their Application to Computer Science 1990: 113-126
1980 – 1989
- 1988
- [c3]Michel Bauderon:
On Systems of Equations Defining Infinite Graphs. WG 1988: 54-73 - 1987
- [j1]Michel Bauderon, Bruno Courcelle:
Graph Expressions and Graph Rewritings. Math. Syst. Theory 20(2-3): 83-127 (1987) - [c2]Michel Bauderon, François Laubié:
Searching for Weakly Autocorrelated Binary Sequences. AAECC 1987: 25-34 - 1986
- [c1]Michel Bauderon, Bruno Courcelle:
An Algebraic Formalism for Graphs. CAAP 1986: 74-84
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 22:59 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:
