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=Theor.~Comput.~Sci. AND YEAR=2001
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Neighborhood unions and regularity in graphs
O. Favaron
,
Y. Redouane
Theoretical Computer Science
263
(1-2), 2001, pp. 247-254
Partitioning vertices of 1-tough graphs into paths
Cristina Bazgan
,
Amel Harkat-Benhamdine
,
Hao Li
,
Mariusz Woźniak
Theoretical Computer Science
263
(1-2), 2001, pp. 255-261
Voronoi diagrams on piecewise flat surfaces and an application to biological growth
C. Indermitte
,
Th.M. Liebling
,
M. Troyanov
,
H. Clémençon
Theoretical Computer Science
263
(1-2), 2001, pp. 263-274
A combinatorial approach to Golomb forests
Mordecai J. Golin
Theoretical Computer Science
263
(1-2), 2001, pp. 283-304
NP
-completeness for calculating power indices of weighted majority games
Yasuko Matsu
,
Tomomi Matsui
Theoretical Computer Science
263
(1-2), 2001, pp. 305-310
On the covering radius problem for ternary self-dual codes
Michio Ozeki
Theoretical Computer Science
263
(1-2), 2001, pp. 311-332
Independent triangles covering given vertices of a graph
Hao Li
,
Jianping Li
Theoretical Computer Science
263
(1-2), 2001, pp. 333-344
When does a planar bipartite framework admit a continuous deformation?
H. Maehara
,
N. Tokushige
Theoretical Computer Science
263
(1-2), 2001, pp. 345-354
An improvement on a spernerity proof of Horrocks
Szu-En Cheng
,
Ko-Wei Lih
Theoretical Computer Science
263
(1-2), 2001, pp. 355-377
On the power of Las Vegas II: Two-way finite automata
Juraj Hromkovic̑
,
Georg Schnitger
Theoretical Computer Science
262
(1-2), 2001, pp. 1-24
Local and global cyclicity in free semigroups
S̑tȇpán Holub
Theoretical Computer Science
262
(1-2), 2001, pp. 25-36
Approximate evaluations of characteristic polynomials of Boolean functions
David Lee
,
Henryk Woźniakowski
Theoretical Computer Science
262
(1-2), 2001, pp. 37-68
Analogies and differences between quantum and stochastic automata
Alberto Bertoni
,
Marco Carpentieri
Theoretical Computer Science
262
(1-2), 2001, pp. 69-81
Approximations for Steiner trees with minimum number of Steiner points
Donghui Chen
,
Ding-Zhu Du
,
Xiao-Dong Hu
,
Guo-Hui Lin
,
Lusheng Wang
,
Guoliang Xue
Theoretical Computer Science
262
(1-2), 2001, pp. 83-99
Minimizing roundoff errors of prefix sums via dynamic construction of Huffman trees
Ming-Yang Kao
,
Jie Wang
Theoretical Computer Science
262
(1-2), 2001, pp. 101-115
Formal properties of PA-matching
Satoshi Kobayashi
,
Victor Mitrana
,
Gheorghe Păun
,
Grzegorz Rozenberg
Theoretical Computer Science
262
(1-2), 2001, pp. 117-131
Priority queues with binary priorities
K. Kalorkoti
,
D.H. Tulley
Theoretical Computer Science
262
(1-2), 2001, pp. 133-144
Approximation for the general block distribution of a matrix
Bengt Aspvall
,
Magnús M. Halldórsson
,
Fredrik Manne
Theoretical Computer Science
262
(1-2), 2001, pp. 145-160
A polynomial-time algorithm for checking equivalence under certain semiring congruences motivated by the state-space isomorphism problem for hybrid systems
Bhaskar DasGupta
,
Eduardo D. Sontag
Theoretical Computer Science
262
(1-2), 2001, pp. 161-189
Strong cocycle triviality for
Z^2
subshifts
Oliver Jenkinson
Theoretical Computer Science
262
(1-2), 2001, pp. 191-213
Longest fault-free paths in star graphs with vertex faults
Sun-Yuan Hsieh
,
Gen-Huey Chen
,
Chin-Wen Ho
Theoretical Computer Science
262
(1-2), 2001, pp. 215-227
The component hierarchy of chain-free cooperating distributed regular tree grammars
G. Dányi
,
Z. Fülöp
Theoretical Computer Science
262
(1-2), 2001, pp. 229-240
Hyper-polynomial hierarchies and the polynomial jump
Stephen Fenner
,
Steven Homer
,
Randall Pruim
,
Marcus Schaefer
Theoretical Computer Science
262
(1-2), 2001, pp. 241-256
Wire segmenting for buffer insertion based on RSTP-MSP
Bing Lu
,
Jun Gu
,
Xiaodong Hu
,
Eugene Shragowitz
Theoretical Computer Science
262
(1-2), 2001, pp. 257-267
Recurrence and periodicity in infinite words from local periods
J.-P. Duval
,
F. Mignosi
,
A. Restivo
Theoretical Computer Science
262
(1-2), 2001, pp. 269-284
Seiten
<
1
2
3
4
5
6
7
8
9
10
11
12
>