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="Goubault-Larrecq, Jean"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A constructive proof of the topological Kruskal theorem
Jean Goubault-Larrecq
Lecture Notes in Computer Science
8087
, 2013, pp. 22-41
The theory of WSTS: The case of complete WSTS
Alain Finkel
,
Jean Goubault-Larrecq
Lecture Notes in Computer Science
7347
, 2012, pp. 3-31
Musings around the geometry of interaction, and coherence
Jean Goubault-Larrecq
Theoretical Computer Science
412
(20), 2011, pp. 1998-2014
Noetherian spaces in verification
Jean Goubault-Larrecq
Lecture Notes in Computer Science
6199
, 2010, pp. 2-21
Forward analysis for WSTS, Part II: Complete WSTS
Alain Finkel
,
Jean Goubault-Larrecq
Lecture Notes in Computer Science
5556
, 2009, pp. 188-199
Forward analysis for WSTS, part I: Completions
Alain Finkel
,
Jean Goubault-Larrecq
Leibniz International Proceedings in Informatics (LIPIcs)
3
, 2009, pp. 433-444
Continuous capacities on continuous state spaces
Jean Goubault-Larrecq
Lecture Notes in Computer Science
4596
, 2007, pp. 764-776
Alternating two-way AC-tree automata
Kumar Neeraj Verma
,
Jean Goubault-Larrecq
Information and Computation
205
(6), 2007, pp. 817-869
Deciding
H_1
by resolution
Jean Goubault-Larrecq
Information Processing Letters
95
(3), 2005, pp. 401-408