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=6281
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Does treewidth help in modal satisfiability?
M. Praveen
Lecture Notes in Computer Science
6281
, 2010, pp. 580-591
Asynchronous omega-regular games with partial information
Bernd Puchala
Lecture Notes in Computer Science
6281
, 2010, pp. 592-603
Parity games with partial information played on graphs of bounded complexity
Bernd Puchala
,
Roman Rabinovich
Lecture Notes in Computer Science
6281
, 2010, pp. 604-615
Revisiting Ackermann-hardness for lossy counter machines and Reset Petri nets
Philippe Schnoebelen
Lecture Notes in Computer Science
6281
, 2010, pp. 616-628
Enumeration of the monomials of a polynomial and related complexity classes
Yann Strozecki
Lecture Notes in Computer Science
6281
, 2010, pp. 629-640
Faster approximation schemes and parameterized algorithms on
H
-minor-free and odd-minor-free graphs
Siamak Tazari
Lecture Notes in Computer Science
6281
, 2010, pp. 641-652
Semi-linear Parikh images of regular expressions via reduction
Bahareh Badban
,
Mohammad Torabi Dashti
Lecture Notes in Computer Science
6281
, 2010, pp. 653-664
Breaking the rectangle bound barrier against formula size lower bounds
Kenya Ueno
Lecture Notes in Computer Science
6281
, 2010, pp. 665-676
Mesh deformation of dynamic smooth manifolds with surface correspondences
Ho-Lun Cheng
,
Ke Yan
Lecture Notes in Computer Science
6281
, 2010, pp. 677-688
Counting dependent and independent strings
Marius Zimand
Lecture Notes in Computer Science
6281
, 2010, pp. 689-700
Impossibility of independence amplification in Kolmogorov complexity theory
Marius Zimand
Lecture Notes in Computer Science
6281
, 2010, pp. 701-712
Seiten
<
1
2
3