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 YEAR=2003
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The differential lambda-calculus
Thomas Ehrhard
,
Laurent Regnier
Theoretical Computer Science
309
(1-3), 2003, pp. 1-41
A format for semantic equivalence comparison
Vashti Galpin
Theoretical Computer Science
309
(1-3), 2003, pp. 65-109
Better-quasi-orderings and coinduction
Thomas Forster
Theoretical Computer Science
309
(1-3), 2003, pp. 111-123
Paracategories I: Internal paracategories and saturated partial algebras
Claudio Hermida
,
Paulo Mateus
Theoretical Computer Science
309
(1-3), 2003, pp. 125-156
Power simulation and its relation to traces and failures refinement
Paul Gardiner
Theoretical Computer Science
309
(1-3), 2003, pp. 157-176
Branching time and orthogonal bisimulation equivalence
Jan A. Bergstra
,
Alban Ponse
,
Mark B. van der Zwaag
Theoretical Computer Science
309
(1-3), 2003, pp. 313-355
Structured theories and institutions
Francisco Durán
,
José Meseguer
Theoretical Computer Science
309
(1-3), 2003, pp. 357-380
On iterating linear transformations over recognizable sets of integers
Bernard Boigelot
Theoretical Computer Science
309
(1-3), 2003, pp. 413-468
The regular-language semantics of second-order idealized Algol
Dan R. Ghica
,
Guy McCusker
Theoretical Computer Science
309
(1-3), 2003, pp. 469-502
Tau laws for pi calculus
Yuxi Fu
,
Zhenrong Yang
Theoretical Computer Science
308
(1-3), 2003, pp. 55-130
Distributivity of categories of coalgebras
H. Peter Gumm
,
Jesse Hughes
,
Tobias Schröder
Theoretical Computer Science
308
(1-3), 2003, pp. 131-143
Linearisability on Datalog programs
Foto Afrati
,
Manolis Gergatsoulis
,
Francesca Toni
Theoretical Computer Science
308
(1-3), 2003, pp. 199-226
A first-order one-pass CPS transformation
Olivier Danvy
,
Lasse R. Nielsen
Theoretical Computer Science
308
(1-3), 2003, pp. 239-257
Model checking mobile ambients
Witold Charatonik
,
Silvano Dal Zilio
,
Andrew D. Gordon
,
Supratik Mukhopadhyay
,
Jean-Marc Talbot
Theoretical Computer Science
308
(1-3), 2003, pp. 277-331
A fixpoint theory for non-monotonic parallelism
Yifeng Chen
Theoretical Computer Science
308
(1-3), 2003, pp. 367-392
Self-stabilizing timestamps
Uri Abraham
Theoretical Computer Science
308
(1-3), 2003, pp. 449-515
The ring of
k
-regular sequences, II
Jean-Paul Allouche
,
Jeffrey Shallit
Theoretical Computer Science
307
(1), 2003, pp. 3-29
Words whose complexity satisfies
lim\frac{p(n)}{n}=1
Ali Aberkane
Theoretical Computer Science
307
(1), 2003, pp. 31-46
Balances for fixed points of primitive substitutions
Boris Adamczewski
Theoretical Computer Science
307
(1), 2003, pp. 47-75
Image reducing words and subgroups of free groups
D.S. Ananichev
,
A. Cherubini
,
M.V. Volkov
Theoretical Computer Science
307
(1), 2003, pp. 77-92
On the entropy of regular languages
Tullio Ceccherini-Silberstein
,
Antonio Machì
,
Fabio Scarabotti
Theoretical Computer Science
307
(1), 2003, pp. 93-102
Growth-sensitivity of context-free languages
Tullio Ceccherini-Silberstein
,
Wolfgang Woess
Theoretical Computer Science
307
(1), 2003, pp. 103-116
Semiretracts - A counterexample and some results
Wit Foryś
,
Tomasz Krawczyk
,
James A. Anderson
Theoretical Computer Science
307
(1), 2003, pp. 117-127
On maximal synchronous codes
Yannick Guesnet
Theoretical Computer Science
307
(1), 2003, pp. 129-138
On the independence of equations in three variables
Tero Harju
,
Dirk Nowotka
Theoretical Computer Science
307
(1), 2003, pp. 139-172
Seiten 1
2
3
4
5
6
7
8
9
10
11
12
>