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=363
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Complexity of hyperconcepts
Joel Ratsaby
Theoretical Computer Science
363
(1), 2006, pp. 2-10
Coloring octrees
Udo Adamy
,
Michael Hoffmann
,
József Solymosi
,
Milos̑ Stojaković
Theoretical Computer Science
363
(1), 2006, pp. 11-17
An improved algorithm for online coloring of intervals with bandwidth
Yossi Azar
,
Amos Fiat
,
Meital Levy
,
N.S. Narayanaswamy
Theoretical Computer Science
363
(1), 2006, pp. 18-27
The worst-case time complexity for generating all maximal cliques and computational experiments
Etsuji Tomita
,
Akira Tanaka
,
Haruhisa Takahashi
Theoretical Computer Science
363
(1), 2006, pp. 28-42
Computing phylogenetic roots with bounded degrees and errors is
NP
-complete
Tatsuie Tsukiji
,
Zhi-Zhong Chen
Theoretical Computer Science
363
(1), 2006, pp. 43-59
Inferring a level-1 phylogenetic network from a dense set of rooted triplets
Jesper Jansson
,
Wing-Kin Sung
Theoretical Computer Science
363
(1), 2006, pp. 60-68
An efficient algorithm for online square detection
H.F. Leung
,
Z.S. Peng
,
H.F. Ting
Theoretical Computer Science
363
(1), 2006, pp. 69-75
A construction method for optimally universal hash families and its consequences for the existence of RBIBDs
Philipp Woelfel
Theoretical Computer Science
363
(1), 2006, pp. 76-84
Large triangles in the
d
-dimensional unit cube
Hanno Lefmann
Theoretical Computer Science
363
(1), 2006, pp. 85-98
Approximating the minimum weight weak vertex cover
Yong Zhang
,
Qi Ge
,
Rudolf Fleischer
,
Tao Jiang
,
Hong Zhu
Theoretical Computer Science
363
(1), 2006, pp. 99-105
Component composition preserving behavioral contracts based on communication traces
Arnaud Bailly
,
Mireille Clerbout
,
Isabelle Simplot-Ryl
Theoretical Computer Science
363
(2), 2006, pp. 108-123
Prime normal form and equivalence of simple grammars
Cédric Bastien
,
Jurek Czyzowicz
,
Wojciech Fraczak
,
Wojciech Rytter
Theoretical Computer Science
363
(2), 2006, pp. 124-134
Incremental construction of minimal deterministic finite cover automata
Cezar Câmpeanu
,
Andrei Păun
,
Jason R. Smith
Theoretical Computer Science
363
(2), 2006, pp. 135-148
Deterministic catalytic systems are not universal
Oscar H. Ibarra
,
Hsu-Chun Yen
Theoretical Computer Science
363
(2), 2006, pp. 149-161
Restarting automata with restricted utilization of auxiliary symbols
Tomasz Jurdziński
,
Friedrich Otto
Theoretical Computer Science
363
(2), 2006, pp. 162-181
Experiments with deterministic
\omega
-automata for formulas of linear temporal logic
Joachim Klein
,
Christel Baier
Theoretical Computer Science
363
(2), 2006, pp. 182-195
The complexity of tree automata and XPath on grammar-compressed trees
Markus Lohrey
,
Sebastian Maneth
Theoretical Computer Science
363
(2), 2006, pp. 196-210
The structure of subword graphs and suffix trees of Fibonacci words
Wojciech Rytter
Theoretical Computer Science
363
(2), 2006, pp. 211-223
Observations on determinization of Büchi automata
Christoph Schulte Althoff
,
Wolfgang Thomas
,
Nico Wallmeier
Theoretical Computer Science
363
(2), 2006, pp. 224-233
On size reduction techniques for multitape automata
Hellis Tamm
,
Matti Nykänen
,
Esko Ukkonen
Theoretical Computer Science
363
(2), 2006, pp. 234-246
Computation of arbitrage in frictional bond markets
Mao-cheng Cai
,
Xiaotie Deng
,
Zhongfei Li
Theoretical Computer Science
363
(3), 2006, pp. 248-256
Improved algorithms for two single machine scheduling problems
Yong He
,
Weiya Zhong
,
Huikun Gu
Theoretical Computer Science
363
(3), 2006, pp. 257-265
Graph bandwidth of weighted caterpillars
Mingen Lin
,
Zhiyong Lin
,
Jinhui Xu
Theoretical Computer Science
363
(3), 2006, pp. 266-277
On product covering in 3-tier supply chain models: Natural complete problems for W[3] and W[4]
Jianer Chen
,
Fenghui Zhang
Theoretical Computer Science
363
(3), 2006, pp. 278-288
Approximation algorithms for facility location problems with a special class of subadditive cost functions
Adriana F. Gabor
,
Jan-Kees C.W. van Ommeren
Theoretical Computer Science
363
(3), 2006, pp. 289-300