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: Series=LNCS AND Volume=4596
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Regular languages of nested words: Fixed points, automata, and synchronization
Marcelo Arenas
,
Pablo Barceló
,
Leonid Libkin
Lecture Notes in Computer Science
4596
, 2007, pp. 888-900
A combinatorial theorem for trees - Applications to monadic logic and infinite structures
Thomas Colcombet
Lecture Notes in Computer Science
4596
, 2007, pp. 901-912
Model theory makes formulas large
Anuj Dawar
,
Martin Grohe
,
Stephan Kreutzer
,
Nicole Schweikardt
Lecture Notes in Computer Science
4596
, 2007, pp. 913-924
Decision problems for lower/upper bound parametric timed automata
Laura Bozzelli
,
Salvatore La Torre
Lecture Notes in Computer Science
4596
, 2007, pp. 925-936
On the complexity of LTL model-checking of recursive state machines
Salvatore La Torre
,
Gennaro Parlato
Lecture Notes in Computer Science
4596
, 2007, pp. 937-948
Paper retraction: On the hardness of embeddings between two finite metrics
Matthew Cary
,
Atri Rudra
,
Ashish Sabharwal
Lecture Notes in Computer Science
4596
, 2007, pp. 949-949
Seiten
<
1
2
3
4