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=2005
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On Floyd and Rivest's SELECT algorithm
Krzysztof C. Kiwiel
Theoretical Computer Science
347
(1-2), 2005, pp. 214-238
Sequential and indexed two-dimensional combinatorial template matching allowing rotations
Kimmo Fredriksson
,
Gonzalo Navarro
,
Esko Ukkonen
Theoretical Computer Science
347
(1-2), 2005, pp. 239-275
Linear deterministic multi bottom-up tree transducers
Zoltán Fülöp
,
Armin Kühnemann
,
Heiko Vogler
Theoretical Computer Science
347
(1-2), 2005, pp. 276-287
Approximation schemes for minimizing total (weighted) completion time with release dates on a batch machine
Zhaohui Liu
,
T.C. Edwin Cheng
Theoretical Computer Science
347
(1-2), 2005, pp. 288-298
Dependences related to strict binary relations
H.K. Hsiao
,
Y.T. Yeh
,
S.S. Yu
Theoretical Computer Science
347
(1-2), 2005, pp. 306-324
Enumeration of
L
-convex polyominoes by rows and columns
G. Castiglione
,
A. Frosini
,
A. Restivo
,
S. Rinaldi
Theoretical Computer Science
347
(1-2), 2005, pp. 336-352
An introduction to periodical discrete sets from a tomographical perspective
Andrea Frosini
,
Maurice Nivat
,
Laurent Vuillon
Theoretical Computer Science
347
(1-2), 2005, pp. 370-392
Random generation of
Q
-convex sets
Sara Brunetti
,
Alain Daurat
Theoretical Computer Science
347
(1-2), 2005, pp. 393-414
A characterization of periodicity of bi-infinite words
Tero Harju
,
Arto Lepistö
,
Dirk Nowotka
Theoretical Computer Science
347
(1-2), 2005, pp. 419-422
*-
\mu
-semirings and *-
\lambda
-semirings
Feng Feng
,
Xianzhong Zhao
,
Young Bae Jun
Theoretical Computer Science
347
(1-2), 2005, pp. 423-431
Some necessary clarifications about the chords' problem and the partial digest problem
A. Daurat
,
Y. Gérard
,
M. Nivat
Theoretical Computer Science
347
(1-2), 2005, pp. 432-436
Erratum to ''NFA reduction algorithms by means of regular inequalities''
J.-M. Champarnaud
,
F. Coulon
Theoretical Computer Science
347
(1-2), 2005, pp. 437-440
A structural approach to reversible computation
Samson Abramsky
Theoretical Computer Science
347
(3), 2005, pp. 441-464
The conflict-free reduction geometry
Zurab Khasidashvili
,
John Glauert
Theoretical Computer Science
347
(3), 2005, pp. 465-497
A representation theorem for Boolean contact algebras
Ivo Düntsch
,
Michael Winter
Theoretical Computer Science
347
(3), 2005, pp. 498-512
A theory for execution-time derivation in real-time programs
Karl Lermer
,
Colin J. Fidge
,
Ian J. Hayes
Theoretical Computer Science
346
(1), 2005, pp. 3-27
Quantitative information in the tuple space coordination model
Mario Bravetti
,
Roberto Gorrieri
,
Roberto Lucchi
,
Gianluigi Zavattaro
Theoretical Computer Science
346
(1), 2005, pp. 28-57
A semantic framework for the abstract model checking of tccp programs
María Alpuente
,
María del Mar Gallardo
,
Ernesto Pimentel
,
Alicia Villanueva
Theoretical Computer Science
346
(1), 2005, pp. 58-95
Probabilistic guarded commands mechanized in HOL
Joe Hurd
,
Annabelle McIver
,
Carroll Morgan
Theoretical Computer Science
346
(1), 2005, pp. 96-112
On finite-state approximants for probabilistic computation tree logic
Michael Huth
Theoretical Computer Science
346
(1), 2005, pp. 113-134
Quantitative
\mu
-calculus and CTL defined over constraint semirings
Alberto Lluch-Lafuente
,
Ugo Montanari
Theoretical Computer Science
346
(1), 2005, pp. 135-160
Separable equilibrium state probabilities via time reversal in Markovian process algebra
P.G. Harrison
,
T.T. Lee
Theoretical Computer Science
346
(1), 2005, pp. 161-182
Minimal change list for Lucas strings and some graph theoretic consequences
Jean-Luc Baril
,
Vincent Vajnovszki
Theoretical Computer Science
346
(2-3), 2005, pp. 189-199
The discrete Green theorem and some applications in discrete geometry
S. Brlek
,
G. Labelle
,
A. Lacasse
Theoretical Computer Science
346
(2-3), 2005, pp. 200-225
Graph encoding of 2D-gon tilings
Frédéric Chavanon
,
Matthieu Latapy
,
Michel Morvan
,
Eric Rémila
,
Laurent Vuillon
Theoretical Computer Science
346
(2-3), 2005, pp. 226-253
Seiten
<
1
2
3
4
5
6
7
8
9
10
11
12
>