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="Poign{\'e}, Axel"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Listing closed sets of strongly accessible set systems with applications to data mining
Mario Boley
,
Tamás Horváth
,
Axel Poigné
,
Stefan Wrobel
Theoretical Computer Science
411
(3), 2010, pp. 691-700
A functorial semantics for observed concurrency
David Murphy
,
Axel Poigné
Lecture Notes in Computer Science
629
, 1992, pp. 401-411
On the nature of events
G. Michele Pinna
,
Axel Poigné
Lecture Notes in Computer Science
629
, 1992, pp. 430-441
Once more on order-sorted algebras
Axel Poigné
Lecture Notes in Computer Science
520
, 1991, pp. 397-405
A note on inconsistencies caused by fixpoints in a cartesian closed category
Hagen Huwig
,
Axel Poigné
Theoretical Computer Science
73
, 1990, pp. 101-112
Parametrization for order-sorted algebraic specification
Axel Poigné
Journal of Computer and System Sciences
40
, 1990, pp. 229-268
Another look at parameterization using algebras with subsorts
Axel Poigné
Lecture Notes in Computer Science
176
, 1984, pp. 471-479