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=262
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
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
Algebraic nets with flexible arcs
Ekkart Kindler
,
Hagen Völzer
Theoretical Computer Science
262
(1-2), 2001, pp. 285-310
Implementing conditional term rewriting by graph rewriting
Enno Ohlebusch
Theoretical Computer Science
262
(1-2), 2001, pp. 311-331
Finite maximal solid codes
Nguyen Huong Lam
Theoretical Computer Science
262
(1-2), 2001, pp. 333-347
Multiplicities of covers for sofic shifts
Doris Fiebig
,
Ulf-Rainer Fiebig
,
Natas̑a Jonoska
Theoretical Computer Science
262
(1-2), 2001, pp. 349-375
Tree-based generation of languages of fractals
Frank Drewes
Theoretical Computer Science
262
(1-2), 2001, pp. 377-414
Parallel algorithms for red-black trees
Heejin Park
,
Kunsoo Park
Theoretical Computer Science
262
(1-2), 2001, pp. 415-435
Preemptive multiprocessor scheduling with rejection
Steven S. Seiden
Theoretical Computer Science
262
(1-2), 2001, pp. 437-458
On
\beta
-skeleton as a subgraph of the minimum weight triangulation
Siu-Wing Cheng
,
Yin-Feng Xu
Theoretical Computer Science
262
(1-2), 2001, pp. 459-471
Representation versus numberings: On the relationship of two computability notions
Dieter Spreen
Theoretical Computer Science
262
(1-2), 2001, pp. 473-499
Seiten 1
2
>