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=295
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Exact results for accepting probabilities of quantum automata
Andris Ambainis
,
Arnolds Ķikusts
Theoretical Computer Science
295
(1-3), 2003, pp. 3-25
Improved bounds on the weak pigeonhole principle and infinitely many primes from weaker axioms
Albert Atserias
Theoretical Computer Science
295
(1-3), 2003, pp. 27-39
Reachability problems for sequential dynamical systems with threshold functions
Chris Barrett
,
Harry B. Hunt III
,
Madhav V. Marathe
,
S.S. Ravi
,
Daniel J. Rosenkrantz
,
Richard E. Stearns
Theoretical Computer Science
295
(1-3), 2003, pp. 41-64
The complexity of bivariate power series arithmetic
Markus Bläser
Theoretical Computer Science
295
(1-3), 2003, pp. 65-83
Automatic verification of recursive procedures with one integer parameter
Ahmed Bouajjani
,
Peter Habermehl
,
Richard Mayr
Theoretical Computer Science
295
(1-3), 2003, pp. 85-106
Periodicity, morphisms, and matrices
Sabin Cautis
,
Filippo Mignosi
,
Jeffrey Shallit
,
Ming-wei Wang
,
Soroosh Yazdani
Theoretical Computer Science
295
(1-3), 2003, pp. 107-121
Sharing one secret vs. sharing many secrets
Giovanni Di Crescenzo
Theoretical Computer Science
295
(1-3), 2003, pp. 123-140
On the computational complexity of infinite words
Pavol D̑uris̑
,
Ján Man̑uch
Theoretical Computer Science
295
(1-3), 2003, pp. 141-151
Quantifier rank for parity of embedded finite models
Hervé Fournier
Theoretical Computer Science
295
(1-3), 2003, pp. 153-169
Space hierarchy theorem revised
Viliam Geffert
Theoretical Computer Science
295
(1-3), 2003, pp. 171-187
Converting two-way nondeterministic unary automata into simpler automata
Viliam Geffert
,
Carlo Mereghetti
,
Giovanni Pighizzini
Theoretical Computer Science
295
(1-3), 2003, pp. 189-203
The complexity of the characteristic and the minimal polynomial
Thanh Minh Hoang
,
Thomas Thierauf
Theoretical Computer Science
295
(1-3), 2003, pp. 205-222
Synchronizing finite automata on Eulerian digraphs
Jarkko Kari
Theoretical Computer Science
295
(1-3), 2003, pp. 223-232
Fast one-way cellular automata
Andreas Klein
,
Martin Kutrib
Theoretical Computer Science
295
(1-3), 2003, pp. 233-250
On-line scheduling with tight deadlines
Chiu-Yuen Koo
,
Tak-Wah Lam
,
Tsuen-Wan Ngan
,
Kunihiko Sadakane
,
Kar-Keung To
Theoretical Computer Science
295
(1-3), 2003, pp. 251-261
Mixed hypergraphs with bounded degree: Edge-coloring of mixed multigraphs
Daniel Král'
,
Jan Kratochvíl
,
Heinz-Jürgen Voss
Theoretical Computer Science
295
(1-3), 2003, pp. 263-278
News from the online Traveling Repairman
Sven O. Krumke
,
Willem E. de Paepe
,
Diana Poensgen
,
Leen Stougie
Theoretical Computer Science
295
(1-3), 2003, pp. 279-294
From bidirectionality to alternation
Nir Piterman
,
Moshe Y. Vardi
Theoretical Computer Science
295
(1-3), 2003, pp. 295-321
On reducibility and symmetry of disjoint
NP
pairs
Pavel Pudlák
Theoretical Computer Science
295
(1-3), 2003, pp. 323-339
On the equational definition of the least prefixed point
Luigi Santocanale
Theoretical Computer Science
295
(1-3), 2003, pp. 341-370
The size of power automata
K. Sutner
Theoretical Computer Science
295
(1-3), 2003, pp. 371-386
On the approximability of the Steiner tree problem
Martin Thimm
Theoretical Computer Science
295
(1-3), 2003, pp. 387-402