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=345
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Efficient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processes
Christel Baier
,
Holger Hermanns
,
Joost-Pieter Katoen
,
Boudewijn R. Haverkort
Theoretical Computer Science
345
(1), 2005, pp. 2-26
A partial order semantics approach to the clock explosion problem of timed automata
D. Lugiez
,
P. Niebert
,
S. Zennou
Theoretical Computer Science
345
(1), 2005, pp. 27-59
More efficient on-the-fly LTL verification with Tarjan's algorithm
Jaco Geldenhuys
,
Antti Valmari
Theoretical Computer Science
345
(1), 2005, pp. 60-82
From complementation to certification
Orna Kupferman
,
Moshe Y. Vardi
Theoretical Computer Science
345
(1), 2005, pp. 83-100
An interpolating theorem prover
K.L. McMillan
Theoretical Computer Science
345
(1), 2005, pp. 101-121
A class of polynomially solvable range constraints for interval analysis without widenings
Zhendong Su
,
David Wagner
Theoretical Computer Science
345
(1), 2005, pp. 122-138
Model checking discounted temporal properties
Luca de Alfaro
,
Marco Faella
,
Thomas A. Henzinger
,
Rupak Majumdar
,
Mariëlle Stoelinga
Theoretical Computer Science
345
(1), 2005, pp. 139-170
One query reducibilities between partial information classes
Sebastian Bab
,
Arfst Nickelsen
Theoretical Computer Science
345
(2-3), 2005, pp. 173-189
A hierarchy of shift equivalent sofic shifts
Marie-Pierre Béal
,
Francesca Fiorenzi
,
Dominique Perrin
Theoretical Computer Science
345
(2-3), 2005, pp. 190-205
A common algebraic description for probabilistic and quantum computations
Martin Beaudry
,
José M. Fernandez
,
Markus Holzer
Theoretical Computer Science
345
(2-3), 2005, pp. 206-234
A new dimension sensitive property for cellular automata
Vincent Bernardi
,
Bruno Durand
,
Enrico Formenti
,
Jarkko Kari
Theoretical Computer Science
345
(2-3), 2005, pp. 235-247
The enumerability of
P
collapses
P
to
NC
Alina Beygelzimer
,
Mitsunori Ogihara
Theoretical Computer Science
345
(2-3), 2005, pp. 248-259
Generation problems
E. Böhler
,
C. Glaßer
,
B. Schwarz
,
K.W. Wagner
Theoretical Computer Science
345
(2-3), 2005, pp. 260-295
The non-parametrizability of the word equation
xyz=zvx
: A short proof
Elena Czeizler
Theoretical Computer Science
345
(2-3), 2005, pp. 296-303
Decidability of trajectory-based equations
Michael Domaratzki
,
Kai Salomaa
Theoretical Computer Science
345
(2-3), 2005, pp. 304-330
Graph exploration by a finite automaton
Pierre Fraigniaud
,
David Ilcinkas
,
Guy Peer
,
Andrzej Pelc
,
David Peleg
Theoretical Computer Science
345
(2-3), 2005, pp. 331-344
All superlinear inverse schemes are co
NP
-hard
Edith Hemaspaandra
,
Lane A. Hemaspaandra
,
Harald Hempel
Theoretical Computer Science
345
(2-3), 2005, pp. 345-358
A generalization of repetition threshold
Lucian Ilie
,
Pascal Ochem
,
Jeffrey Shallit
Theoretical Computer Science
345
(2-3), 2005, pp. 359-369
Universal test for quantum one-way permutations
Akinori Kawachi
,
Hirotada Kobayashi
,
Takeshi Koshiba
,
Raymond H. Putra
Theoretical Computer Science
345
(2-3), 2005, pp. 370-385
Resource bounded symmetry of information revisited
Troy Lee
,
Andrei Romashchenko
Theoretical Computer Science
345
(2-3), 2005, pp. 386-405
The complexity of equivalence and isomorphism of systems of equations over finite groups
Gustav Nordh
Theoretical Computer Science
345
(2-3), 2005, pp. 406-424
The dual of concatenation
Alexander Okhotin
Theoretical Computer Science
345
(2-3), 2005, pp. 425-447
A reducibility for the dot-depth hierarchy
Victor L. Selivanov
,
Klaus W. Wagner
Theoretical Computer Science
345
(2-3), 2005, pp. 448-472
Sublogarithmic ambiguity
Klaus Wich
Theoretical Computer Science
345
(2-3), 2005, pp. 473-504