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="Puppis, Gabriele"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The per-character cost of repairing word languages
Michael Benedikt
,
Gabriele Puppis
,
Cristian Riveros
Theoretical Computer Science
539
, 2014, pp. 38-67
Decidability of the interval temporal logic
\mathsf{A\bar{A}B\bar{B}}
over the rationals
Angelo Montanari
,
Gabriele Puppis
,
Pietro Sala
Lecture Notes in Computer Science
8634
, 2014, pp. 451-463
Bounded repairability of word languages
Michael Benedikt
,
Gabriele Puppis
,
Cristian Riveros
Journal of Computer and System Sciences
79
(8), 2013, pp. 1302-1321
The cost of traveling between languages
Michael Benedikt
,
Gabriele Puppis
,
Cristian Riveros
Lecture Notes in Computer Science
6756
, 2011, pp. 234-245
Regular languages of words over countable linear orderings
Olivier Carton
,
Thomas Colcombet
,
Gabriele Puppis
Lecture Notes in Computer Science
6756
, 2011, pp. 125-136
On the use of guards for logics with data
Thomas Colcombet
,
Clemens Ley
,
Gabriele Puppis
Lecture Notes in Computer Science
6907
, 2011, pp. 243-255
Decidability of the interval temporal logic ABBÌ„ over the natural numbers
Angelo Montanari
,
Gabriele Puppis
,
Pietro Sala
,
Guido Sciavicco
Leibniz International Proceedings in Informatics (LIPIcs)
5
, 2010, pp. 597-608
Maximal decidable fragments of Halpern and Shoham's modal logic of intervals
Angelo Montanari
,
Gabriele Puppis
,
Pietro Sala
Lecture Notes in Computer Science
6199
, 2010, pp. 345-356
A theory of ultimately periodic languages and automata with an application to time granularity
Davide Bresolin
,
Angelo Montanari
,
Gabriele Puppis
Acta Informatica
46
(5), 2009, pp. 331-360
Compact and tractable automaton-based representations of time granularities
Ugo Dal Lago
,
Angelo Montanari
,
Gabriele Puppis
Theoretical Computer Science
373
(1-2), 2007, pp. 115-141
Decidability of MSO theories of tree structures
Angelo Montanari
,
Gabriele Puppis
Lecture Notes in Computer Science
3328
, 2004, pp. 434-446