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: Journal=Theory of Computing Systems AND Volume=41
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A thread algebra with multi-level strategic interleaving
J.A. Bergstra
,
C.A. Middelburg
Theory of Computing Systems
41
(1), 2007, pp. 3-32
Optimal semicomputable approximations to reachable and invariant sets
Pieter Collins
Theory of Computing Systems
41
(1), 2007, pp. 33-48
SHRAD: A language for sequential real number computation
Amin Farjudian
Theory of Computing Systems
41
(1), 2007, pp. 49-105
Some relations between approximation problems and PCPs over the real numbers
Klaus Meer
Theory of Computing Systems
41
(1), 2007, pp. 107-118
The computational complexity of one-dimensional sandpiles
Peter Bro Miltersen
Theory of Computing Systems
41
(1), 2007, pp. 119-125
Productivity of Edalat-Potts exact arithmetic in constructive type theory
Milad Niqui
Theory of Computing Systems
41
(1), 2007, pp. 127-154
Computable analysis of a boundary-value problem for the Korteweg-de Vries equation
Ning Zhong
Theory of Computing Systems
41
(1), 2007, pp. 155-175
Real hypercomputation and continuity
Martin Ziegler
Theory of Computing Systems
41
(1), 2007, pp. 177-206
On the incompressibility of monotone DNFs
Matthias P. Krieger
Theory of Computing Systems
41
(2), 2007, pp. 211-231
Leftist grammars and the Chomsky hierarchy
Tomasz Jurdziński
,
Krzysztof Loryś
Theory of Computing Systems
41
(2), 2007, pp. 233-256
Polynomial-space decidable membership problems for recurrent systems over sets of natural numbers
Daniel Meister
Theory of Computing Systems
41
(2), 2007, pp. 257-289
On the power of unambiguity in alternating machines
Holger Spakowski
,
Rahul Tripathi
Theory of Computing Systems
41
(2), 2007, pp. 291-326
Logspace optimization problems and their approximability properties
Till Tantau
Theory of Computing Systems
41
(2), 2007, pp. 327-350
Average-case non-approximability of optimisation problems
Birgit Schelm
Theory of Computing Systems
41
(2), 2007, pp. 351-368
A simple and fast min-cut algorithm
Michael Brinkmeier
Theory of Computing Systems
41
(2), 2007, pp. 369-380
Exact algorithms for graph homomorphisms
Fedor V. Fomin
,
Pinar Heggernes
,
Dieter Kratsch
Theory of Computing Systems
41
(2), 2007, pp. 381-393
Pseudo-kernelization: A branch-then-reduce approach for FPT problems
Faisal N. Abu-Khzam
Theory of Computing Systems
41
(3), 2007, pp. 399-410
Crown structures for vertex cover kernelization
Faisal N. Abu-Khzam
,
Michael R. Fellows
,
Michael A. Langston
,
W. Henry Suters
Theory of Computing Systems
41
(3), 2007, pp. 411-430
The parameterized approximability of TSP with deadlines
Hans-Joachim Böckenhauer
,
Juraj Hromkovic̑
,
Joachim Kneis
,
Joachim Kupke
Theory of Computing Systems
41
(3), 2007, pp. 431-444
Algorithms in the
W
-hierarchy
Jonathan F. Buss
,
Tarique Islam
Theory of Computing Systems
41
(3), 2007, pp. 445-457
The complexity of polynomial-time approximation
Liming Cai
,
Michael Fellows
,
David Juedes
,
Frances Rosamond
Theory of Computing Systems
41
(3), 2007, pp. 459-477
An
O(2^{0(k)}n^3)
FPT algorithm for the undirected Feedback Vertex Set problem
Frank Dehne
,
Michael Fellows
,
Michael Langston
,
Frances Rosamond
,
Kim Stevens
Theory of Computing Systems
41
(3), 2007, pp. 479-492
Dynamic programming for minimum Steiner trees
B. Fuchs
,
W. Kern
,
D. Mölle
,
S. Richter
,
P. Rossmanith
,
X. Wang
Theory of Computing Systems
41
(3), 2007, pp. 493-500
Parameterized complexity of Vertex Cover Variants
Jiong Guo
,
Rolf Niedermeier
,
Sebastian Wernicke
Theory of Computing Systems
41
(3), 2007, pp. 501-520
The linear arrangement problem parameterized above guaranteed value
Gregory Gutin
,
Arash Rafiey
,
Stefan Szeider
,
Anders Yeo
Theory of Computing Systems
41
(3), 2007, pp. 521-538
Seiten 1
2
>