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
[3]
Hilfe
Suche: Journal=Theor.~Comput.~Sci. AND YEAR=2005
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A multidimensional critical factorization theorem
Chiara Epifanio
,
Filippo Mignosi
Theoretical Computer Science
346
(2-3), 2005, pp. 265-280
Implicit surface visualization of reconstructed biological molecules
Edgar Garduño
,
Gabor T. Herman
Theoretical Computer Science
346
(2-3), 2005, pp. 281-299
Reduction from three-dimensional discrete tomography to multicommodity flow problem
Y. Gerard
Theoretical Computer Science
346
(2-3), 2005, pp. 300-306
Enumeration of symmetry classes of convex polyominoes on the honeycomb lattice
Dominique Gouyou-Beauchamps
,
Pierre Leroux
Theoretical Computer Science
346
(2-3), 2005, pp. 307-334
A sufficient condition for non-uniqueness in binary tomography with absorption
Attila Kuba
,
Murice Nivat
Theoretical Computer Science
346
(2-3), 2005, pp. 335-357
Monotone runs of uniformly distributed integer random variables: A probabilistic analysis
Guy Louchard
Theoretical Computer Science
346
(2-3), 2005, pp. 358-387
Efficient iteration in admissible combinatorial classes
Conrado Martínez
,
Xavier Molinero
Theoretical Computer Science
346
(2-3), 2005, pp. 388-417
On computing the coefficients of bivariate holonomic formal series
P. Massazza
,
R. Radicioni
Theoretical Computer Science
346
(2-3), 2005, pp. 418-438
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
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
Seiten
<
1
2
3
4
5
6
7
8
9
10
11
12
>