Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Bauderon, Michel"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Node rewriting in graphs and hypergraphs: A categorical framework
Michel Bauderon
,
Hélène Jacquet
Theoretical Computer Science
266
(1-2), 2001, pp. 463-487
Node rewriting in hypergraphs
Michel Bauderon
,
Hélène Jacquet
Lecture Notes in Computer Science
1197
, 1997, pp. 31-43
A uniform approach to graph rewriting: The pullback approach
Michel Bauderon
Lecture Notes in Computer Science
1017
, 1995, pp. 101-115
Infinite hypergraphs. II. Systems of recursive equations
Michel Bauderon
Theoretical Computer Science
103
, 1992, pp. 165-190
Infinite hypergraphs I. Basic properties
Michel Bauderon
Theoretical Computer Science
82
, 1991, pp. 177-214
Searching for weakly autocorrelated binary sequences
Michel Bauderon
,
François Laubie
Lecture Notes in Computer Science
356
, 1989, pp. 25-34
Graph expressions and graph rewritings
Michel Bauderon
,
Bruno Courcelle
Math. Systems Theory
20
, 1987, pp. 83-127