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
[1]
Hilfe
Suche: Journal=Theory of Computing Systems AND Volume=48
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Weak MSO with the unbounding quantifier
Mikoƚaj Bojańczyk
Theory of Computing Systems
48
(3), 2011, pp. 554-576
Semi-online preemptive scheduling: One algorithm for all variants
Tomás̑ Ebenlendr
,
Jiȓí Sgall
Theory of Computing Systems
48
(3), 2011, pp. 577-613
Computability in Europe 2008
Arnold Beckmann
,
Benedikt Löwe
Theory of Computing Systems
48
(3), 2011, pp. 614-616
Computability and complexity in self-assembly
James I. Lathrop
,
Jack H. Lutz
,
Matthew J. Patitz
,
Scott M. Summers
Theory of Computing Systems
48
(3), 2011, pp. 617-647
Model checking weighted integer reset timed automata
Lakshmi Manasa
,
Shankara Narayanan Krishna
,
Chinmay Jain
Theory of Computing Systems
48
(3), 2011, pp. 648-679
On the complexity of computing winning strategies for finite poset games
Michael Soltys
,
Craig Wilson
Theory of Computing Systems
48
(3), 2011, pp. 680-692
Topological dynamics of cellular automata: Dimension matters
Mathieu Sablik
,
Guillaume Theyssier
Theory of Computing Systems
48
(3), 2011, pp. 693-714
Enhanced mobile membranes: Computability results
Gabriel Ciobanu
,
Shankara Narayanan Krishna
Theory of Computing Systems
48
(3), 2011, pp. 715-729
Polylog space compression, pushdown compression, and Lempel-Ziv are incomparable
Elvira Mayordomo
,
Philippe Moser
,
Sylvain Perifel
Theory of Computing Systems
48
(4), 2011, pp. 731-766
Conditional fuzzy entropy of maps in fuzzy systems
Wen-Chiao Cheng
Theory of Computing Systems
48
(4), 2011, pp. 767-780
Stackelberg strategies and collusion in network games with splittable flow
Tobias Harks
Theory of Computing Systems
48
(4), 2011, pp. 781-802
Lower bounds for kernelizations and other preprocessing procedures
Yijia Chen
,
Jörg Flum
,
Moritz Müller
Theory of Computing Systems
48
(4), 2011, pp. 803-839
Straight-line instruction sequence completeness for total calculation on cancellation meadows
Jan A. Bergstra
,
Inge Bethke
Theory of Computing Systems
48
(4), 2011, pp. 840-864
Algorithms for finding a most similar subforest
Jesper Jansson
,
Zeshan Peng
Theory of Computing Systems
48
(4), 2011, pp. 865-887
Seiten
<
1
2