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=1997
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Fixed point characterization of infinite behavior of finite-state systems
Damian Niwiński
Theoretical Computer Science
189
(1-2), 1997, pp. 1-69
Formal validation of data-parallel programs: A two-component assertional proof system for a simple language
Luc Bougé
,
David Cachera
,
Yann le Guyadec
,
Gil Utard
,
Bernard Virot
Theoretical Computer Science
189
(1-2), 1997, pp. 71-107
Fairness and control in multi-agent systems
Hans-Dieter Burkhard
Theoretical Computer Science
189
(1-2), 1997, pp. 109-127
Abduction from logic programs: Semantics and complexity
Thomas Eiter
,
Georg Gottlob
,
Nicola Leone
Theoretical Computer Science
189
(1-2), 1997, pp. 129-177
A process algebra of communicating shared resources with dense time and priorities
Patrice Brémond-Grégoire
,
Insup Lee
Theoretical Computer Science
189
(1-2), 1997, pp. 179-219
c
\beta
-machine with
\lambda\beta
-reduction
Mohamed Mezghiche
Theoretical Computer Science
189
(1-2), 1997, pp. 221-228
On the rational behaviors of concurrent timers
Anne Bergeron
Theoretical Computer Science
189
(1-2), 1997, pp. 229-237
On the complexity of specification morphisms
Serafino Cicerone
,
Francesco Parisi-Presicce
Theoretical Computer Science
189
(1-2), 1997, pp. 239-248
Optimal binary search trees
S.V. Nagaraj
Theoretical Computer Science
188
(1-2), 1997, pp. 1-44
Linear speed-up for cellular automata synchronizers and applications
Olivier Heen
Theoretical Computer Science
188
(1-2), 1997, pp. 45-57
Lower bounds for parallel algebraic decision trees, parallel complexity of convex hulls and related problems
Sandeep Sen
Theoretical Computer Science
188
(1-2), 1997, pp. 59-78
Approximate testing and its relationship to learning
Kathleen Romanik
Theoretical Computer Science
188
(1-2), 1997, pp. 79-99
Gap-languages and log-time complexity classes
Kenneth W. Regan
,
Heribert Vollmer
Theoretical Computer Science
188
(1-2), 1997, pp. 101-116
On the power of circuits with gates of low
L_1
norms
Vince Grolmusz
Theoretical Computer Science
188
(1-2), 1997, pp. 117-128
Complexity of tile rotation problems
Eric Goles
,
Iván Rapaport
Theoretical Computer Science
188
(1-2), 1997, pp. 129-159
On sequences resulting from iteration of modified quadratic and palindromic mappings
Anton C̑erný
Theoretical Computer Science
188
(1-2), 1997, pp. 161-174
Kolmogorov numberings and minimal identification
Rusins Freivalds
,
Sanjay Jain
Theoretical Computer Science
188
(1-2), 1997, pp. 175-194
Automaticity of double sequences generated by one-dimensional linear cellular automata
J.-P. Allouche
,
F. von Haeseler
,
H.-O. Peitgen
,
A. Petersen
,
G. Skordev
Theoretical Computer Science
188
(1-2), 1997, pp. 195-209
A short proof of representability of fork algebras
Viktor Gyuris
Theoretical Computer Science
188
(1-2), 1997, pp. 211-220
Optimal algorithms for generalized searching in sorted matrices
Hong Shen
Theoretical Computer Science
188
(1-2), 1997, pp. 221-230
Structure of 3-infix--outfix maximal codes
Dong Yang Long
,
Jian Ma
,
Duanning Zhou
Theoretical Computer Science
188
(1-2), 1997, pp. 231-240
An improved shellsort algorithm
Renren Liu
Theoretical Computer Science
188
(1-2), 1997, pp. 241-247
Constructing a third-order linear differential equation
Willi Geiselman
,
Felix Ulmer
Theoretical Computer Science
187
(1-2), 1997, pp. 3-6
Detecting degenerate behaviors in first order algebraic differential equations
Evelyne Hubert
Theoretical Computer Science
187
(1-2), 1997, pp. 7-25
On second order homogeneous linear differential equations with Liouvillian solutions
Winfried Fakler
Theoretical Computer Science
187
(1-2), 1997, pp. 27-48
Seiten 1
2
3
4
5
6
7
8
9
10
11
12
>