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
[2]
Hilfe
Suche: Journal=Theor.~Comput.~Sci. AND YEAR=2005
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
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
Structural properties of XPath fragments
Michael Benedikt
,
Wenfei Fan
,
Gabriel Kuper
Theoretical Computer Science
336
(1), 2005, pp. 3-31
Decidable containment of recursive queries
Diego Calvanese
,
Giuseppe de Giacomo
,
Moshe Y. Vardi
Theoretical Computer Science
336
(1), 2005, pp. 33-56
XML queries and constraints, containment and reformulation
Alin Deutsch
,
Val Tannen
Theoretical Computer Science
336
(1), 2005, pp. 57-87
Data exchange: Semantics and query answering
Ronald Fagin
,
Phokion G. Kolaitis
,
Renée J. Miller
,
Lucian Popa
Theoretical Computer Science
336
(1), 2005, pp. 89-124
On the decidability of termination of query evaluation in transitive-closure logics for polynomial constraint databases
Floris Geerts
,
Bart Kuijpers
Theoretical Computer Science
336
(1), 2005, pp. 125-151
On the complexity of typechecking top-down XML transformations
Wim Martens
,
Frank Neven
Theoretical Computer Science
336
(1), 2005, pp. 153-180
Combining test case generation and runtime verification
Cyrille Artho
,
Howard Barringer
,
Allen Goldberg
,
Klaus Havelund
,
Sarfraz Khurshid
,
Mike Lowry
,
Corina Pasareanu
,
Grigore Roşu
,
Koushik Sen
,
Willem Visser
,
Rich Washington
Theoretical Computer Science
336
(2-3), 2005, pp. 209-234
A high-level modular definition of the semantics of C\#
Egon Börger
,
Nicu G. Fruja
,
Vincenzo Gervasi
,
Robert F. Stärk
Theoretical Computer Science
336
(2-3), 2005, pp. 235-284
Formal description and analysis of a distributed location service for mobile ad hoc networks
Uwe Glässer
,
Qian-Ping Gu
Theoretical Computer Science
336
(2-3), 2005, pp. 285-309
Partial updates
Yuri Gurevich
,
Nikolai Tillmann
Theoretical Computer Science
336
(2-3), 2005, pp. 311-342
An inexact-suffix-tree-based algorithm for detecting extensible patterns
Abhijit Chattaraj
,
Laxmi Parida
Theoretical Computer Science
335
(1), 2005, pp. 3-14
Computing the maximum agreement of phylogenetic networks
Charles Choy
,
Jesper Jansson
,
Kunihiko Sadakane
,
Wing-Kin Sung
Theoretical Computer Science
335
(1), 2005, pp. 93-107
Polynomial and APX-hard cases of the individual haplotyping problem
Vineet Bafna
,
Sorin Istrail
,
Giuseppe Lancia
,
Romeo Rizzi
Theoretical Computer Science
335
(1), 2005, pp. 109-125
A brief history of process algebra
J.C.M. Baeten
Theoretical Computer Science
335
(2-3), 2005, pp. 131-146
Decomposition orders - Another generalisation of the fundamental theorem of arithmetic
Bas Luttik
,
Vincent van Oostrom
Theoretical Computer Science
335
(2-3), 2005, pp. 147-186
Measuring the performance of asynchronous systems with PAFAS
F. Corradini
,
W. Vogler
Theoretical Computer Science
335
(2-3), 2005, pp. 187-213
Process algebra for hybrid systems
J.A. Bergstra
,
C.A. Middelburg
Theoretical Computer Science
335
(2-3), 2005, pp. 215-280
Seiten
<
1
2
3
4
5
6
7
8
9
10
11
12
>