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=Theor.~Comput.~Sci. AND Volume=337
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Transforming semantics by abstract interpretation
Roberto Giacobazzi
,
Isabella Mastroeni
Theoretical Computer Science
337
(1-3), 2005, pp. 1-50
Adding symbolic information to picture models: Definitions and properties
Gennaro Costagliola
,
Filomena Ferrucci
,
Carmine Gravino
Theoretical Computer Science
337
(1-3), 2005, pp. 51-104
On the complexity of decidable cases of the commutation problem of languages
Juhani Karhumäki
,
Wojciech Plandowski
,
Wojciech Rytter
Theoretical Computer Science
337
(1-3), 2005, pp. 105-118
The generative capacity of block-synchronized context-free grammars
I. McQuillan
Theoretical Computer Science
337
(1-3), 2005, pp. 119-133
Semi-on-line multiprocessor scheduling with given total processing time
T.C. Edwin Cheng
,
Hans Kellerer
,
Vladimir Kotov
Theoretical Computer Science
337
(1-3), 2005, pp. 134-146
Gathering of asynchronous robots with limited visibility
Paola Flocchini
,
Giuseppe Prencipe
,
Nicola Santoro
,
Peter Widmayer
Theoretical Computer Science
337
(1-3), 2005, pp. 147-168
Factors of characteristic words of irrational numbers
Wai-Fong Chuan
Theoretical Computer Science
337
(1-3), 2005, pp. 169-182
On state-alternating context-free grammars
Etsuro Moriya
,
Dieter Hofbauer
,
Maria Huber
,
Friedrich Otto
Theoretical Computer Science
337
(1-3), 2005, pp. 183-216
A survey on tree edit distance and related problems
Philip Bille
Theoretical Computer Science
337
(1-3), 2005, pp. 217-239
Generating bicliques of a graph in lexicographic order
Vânia M.F. Dias
,
Celina M.H. de Figueiredo
,
Jayme L. Szwarcfiter
Theoretical Computer Science
337
(1-3), 2005, pp. 240-248
Approximating
k
-spanner problems for
k>2
Michael Elkin
,
David Peleg
Theoretical Computer Science
337
(1-3), 2005, pp. 249-277
On the completeness and decidability of duration calculus with iteration
Dimitar P. Guelev
,
Dang Van Hung
Theoretical Computer Science
337
(1-3), 2005, pp. 278-304
On approximating minimum vertex cover for graphs with perfect matching
Jianer Chen
,
Iyad A. Kanj
Theoretical Computer Science
337
(1-3), 2005, pp. 305-318
The plurality problem with three colors and more
Martin Aigner
,
Gianluca de Marco
,
Manuela Montangero
Theoretical Computer Science
337
(1-3), 2005, pp. 319-330
The intractability of computing the Hamming distance
Bodo Manthey
,
Rüdiger Reischuk
Theoretical Computer Science
337
(1-3), 2005, pp. 331-346
Computing unsatisfiable
k
-SAT instances with few occurrences per variable
Shlomo Hoory
,
Stefan Szeider
Theoretical Computer Science
337
(1-3), 2005, pp. 347-359
The computational complexity of distance functions of two-dimensional domains
Arthur W. Chou
,
Ker-I Ko
Theoretical Computer Science
337
(1-3), 2005, pp. 360-369
Embedding longest fault-free paths onto star graphs with more vertex faults
Sun-Yuan Hsieh
Theoretical Computer Science
337
(1-3), 2005, pp. 370-378
The complexity of Fibonacci-like kneading sequences
H. Bruin
,
O. Volkova
Theoretical Computer Science
337
(1-3), 2005, pp. 379-389
Approximation of Walrasian equilibrium in single-minded auctions
Li-Sha Huang
,
Minming Li
,
Bo Zhang
Theoretical Computer Science
337
(1-3), 2005, pp. 390-398