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=1997
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the parallel complexity of loops
Oscar H. Ibarra
,
Nicholas Q. Tran
,
Tao Yang
Theoretical Computer Science
179
(1-2), 1997, pp. 381-395
Essential transitions to bisimulation equivalences
Jaana Eloranta
,
Martti Tienari
,
Antti Valmari
Theoretical Computer Science
179
(1-2), 1997, pp. 397-419
Note on free algebras over continuous domains
Jürgen Koslowski
Theoretical Computer Science
179
(1-2), 1997, pp. 421-425
A logic for rough sets
Ivo Düntsch
Theoretical Computer Science
179
(1-2), 1997, pp. 427-436
From regular expressions to DFA's using compressed NFA's
Chia-Hsiang Chang
,
Robert Paige
Theoretical Computer Science
178
(1-2), 1997, pp. 1-36
Nondeterministic stack register machines
P. Clote
Theoretical Computer Science
178
(1-2), 1997, pp. 37-76
The ``magic'' rule spaces of neural-like elementary cellular automata
G. Cattaneo
,
C. Quaranta Vogliotti
Theoretical Computer Science
178
(1-2), 1997, pp. 77-102
Permutations generated by token passing in graphs
M.D. Atkinson
,
M.J. Livesey
,
D. Tulley
Theoretical Computer Science
178
(1-2), 1997, pp. 103-118
Using duplication for scheduling unitary tasks on
m
processors with unit communication delays
A. Munier
,
C. Hanen
Theoretical Computer Science
178
(1-2), 1997, pp. 119-127
Matching a set of strings with variable length don't cares
Gregory Kucherov
,
Michaël Rusinowitch
Theoretical Computer Science
178
(1-2), 1997, pp. 129-154
Normal numbers and sources for BPP
Martin Strauss
Theoretical Computer Science
178
(1-2), 1997, pp. 155-169
Sturmian words, Lyndon words and trees
Jean Berstel
,
Aldo de Luca
Theoretical Computer Science
178
(1-2), 1997, pp. 171-203
Standard Sturmian morphisms
Aldo de Luca
Theoretical Computer Science
178
(1-2), 1997, pp. 205-224
An optimal parallel algorithm for digital curve segmentation
Peter Damaschke
Theoretical Computer Science
178
(1-2), 1997, pp. 225-236
An improved algorithm for the evaluation of fixpoint expressions
A. Browne
,
E.M. Clarke
,
S. Jha
,
D.E. Long
,
W. Marrero
Theoretical Computer Science
178
(1-2), 1997, pp. 237-255
A proof of Simon's theorem on piecewise testable languages
Peter M. Higgins
Theoretical Computer Science
178
(1-2), 1997, pp. 257-264
An approximation scheme for scheduling independent jobs into subcubes of a hypercube of fixed dimension
Y. Kopidakis
,
V. Zissimopoulos
Theoretical Computer Science
178
(1-2), 1997, pp. 265-273
Recognizable picture languages and domino tiling
Michel Latteux
,
David Simplot
Theoretical Computer Science
178
(1-2), 1997, pp. 275-283
A representable approach to finite nondeterminism
S.O. Anderson
,
A.J. Power
Theoretical Computer Science
177
(1), 1997, pp. 3-25
A general adequacy result for a linear functional language
Torben Braüner
Theoretical Computer Science
177
(1), 1997, pp. 27-58
Degrees of parallelism in the continuous type hierarchy
Antonio Bucciarelli
Theoretical Computer Science
177
(1), 1997, pp. 59-71
Constructing process categories
J.R.B. Cockett
,
David A. Spooner
Theoretical Computer Science
177
(1), 1997, pp. 73-109
Continuity spaces: Reconciling domains and metric spaces
Bob Flagg
,
Ralph Kopperman
Theoretical Computer Science
177
(1), 1997, pp. 111-138
Abstract fairness and semantics
Doris Nolte
,
Lutz Priese
Theoretical Computer Science
177
(1), 1997, pp. 139-153
Defaults in domain theory
Guo-Qiang Zhang
,
William C. Rounds
Theoretical Computer Science
177
(1), 1997, pp. 155-182
Seiten
<
1
2
3
4
5
6
7
8
9
10
11
12
>