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=1993
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Modal logic and algebraic specifications
Lawrence S. Moss
,
Satish R. Thatte
Theoretical Computer Science
111
(1-2), 1993, pp. 191-210
A logic for category theory
Paul C. Gilmore
,
George K. Tsiknis
Theoretical Computer Science
111
(1-2), 1993, pp. 211-252
Logical foundations for programming semantics
Paul C. Gilmore
,
George K. Tsiknis
Theoretical Computer Science
111
(1-2), 1993, pp. 253-290
X
-automata on
\omega
-words
Joost Engelfriet
,
Hendrik Jan Hoogeboom
Theoretical Computer Science
110
, 1993, pp. 1-51
On the limit set of some universal cellular automata
Eric Goles
,
Alejandro Maass
,
Servet Martinez
Theoretical Computer Science
110
, 1993, pp. 53-78
Dedekind multisets and function shells
Wayne D. Blizard
Theoretical Computer Science
110
, 1993, pp. 79-98
Time-space tradeoffs for set operations
Boaz Patt-Shamir
,
David Peleg
Theoretical Computer Science
110
, 1993, pp. 99-129
On the power of inductive inference from good examples
R. Freivalds
,
E.B. Kinber
,
R. Wiehagen
Theoretical Computer Science
110
, 1993, pp. 131-144
A comparison of compatible, finite, and inductive graph properties
Annegret Habel
,
Hans-Jörg Kreowski
,
Clemens Lautemann
Theoretical Computer Science
110
, 1993, pp. 145-168
The memory game
Uri Zwick
,
Michael S. Paterson
Theoretical Computer Science
110
, 1993, pp. 169-196
Geography
A.S. Fraenkel
,
S. Simonson
Theoretical Computer Science
110
, 1993, pp. 197-214
Complexity of path-forming games
Hans L. Bodlaender
Theoretical Computer Science
110
, 1993, pp. 215-245
Constructive logics Part I: A tutorial on proof systems and typed
\lambda
-calculi
Jean Gallier
Theoretical Computer Science
110
, 1993, pp. 249-339
Coupling coefficients of a distributed execution
Bernadette Charron-Bost
Theoretical Computer Science
110
, 1993, pp. 341-376
A transformation system for deductive database modules with perfect model semantics
Michael J. Maher
Theoretical Computer Science
110
, 1993, pp. 377-403
A semantic characterization of the well-typed formulae of
\lambda
-calculus
Thomas Forster
Theoretical Computer Science
110
, 1993, pp. 405-418
How to decide the lark
M. Sprenger
,
M. Wymann-Böni
Theoretical Computer Science
110
, 1993, pp. 419-432
The ESPRIT basic research working group COMPUGRAPH ``Computing by Graph Transformation'': a survey
H. Ehrig
,
M. Löwe
Theoretical Computer Science
109
(1-2), 1993, pp. 3-6
Hyperedge replacement jungle rewriting for term-rewriting systems and logic programming
Andrea Corradini
,
Francesca Rossi
Theoretical Computer Science
109
(1-2), 1993, pp. 7-48
Monadic second-order evaluations on tree-decomposable graphs
B. Courcelle
,
M. Mosbah
Theoretical Computer Science
109
(1-2), 1993, pp. 49-82
Recognising
k
-connected hypergraphs in cubic time
Frank Drewes
Theoretical Computer Science
109
(1-2), 1993, pp. 83-122
Parallel and distributed derivations in the single-pushout approach
H. Ehrig
,
M. Löwe
Theoretical Computer Science
109
(1-2), 1993, pp. 123-143
Equivalence of computations in actor grammars
D. Janssens
Theoretical Computer Science
109
(1-2), 1993, pp. 145-180
Algebraic approach to single-pushout graph transformation
Michael Löwe
Theoretical Computer Science
109
(1-2), 1993, pp. 181-224
Graph rewriting for a partial ordering semantics of concurrent constraint programming
Ugo Montanari
,
Francesca Rossi
Theoretical Computer Science
109
(1-2), 1993, pp. 225-256
Seiten
<
1
2
3
4
5
6
7
8
9
10
>