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=1994
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
First-order linear logic without modalities ist NEXPTIME-hard
P. Lincoln
,
A. Scedrov
Theoretical Computer Science
135
(1), 1994, pp. 139-153
Constant-only multiplicative linear logic is NP-complete
Patrick Lincoln
,
Timothy Winkler
Theoretical Computer Science
135
(1), 1994, pp. 155-169
Denotational semantics in the cpo and metric approach
Christian Baier
,
Mila E. Majster-Cederbaum
Theoretical Computer Science
135
(2), 1994, pp. 171-220
Functorial theory of parameterized specifications in a general specification framework
Hartmut Ehrig
,
Martin Große-Rhode
Theoretical Computer Science
135
(2), 1994, pp. 221-266
An algebraic approach to semantics of programming languages
Alexey L. Lastovetsky
,
Sergey S. Gaissaryan
Theoretical Computer Science
135
(2), 1994, pp. 267-288
Labelled domains and automata with concurrency
Felipe Bracho
,
Manfred Droste
Theoretical Computer Science
135
(2), 1994, pp. 289-318
Automatizing termination proofs of recursively defined functions
Pascal Manoury
,
Marianne Simonot
Theoretical Computer Science
135
(2), 1994, pp. 319-343
Weights for total division orderings on strings
E.A. Scott
Theoretical Computer Science
135
(2), 1994, pp. 345-359
Some complexity results on transition systems and elementary net systems
Kunihiko Hiraishi
Theoretical Computer Science
135
(2), 1994, pp. 361-376
Fair Petri nets and structural induction for rings of processes
Jianan Li
,
Ichiro Suzuki
,
Masafumi Yamashita
Theoretical Computer Science
135
(2), 1994, pp. 377-404
Combinatory abstraction using
B
,
B
' and friends
Peter Trigg
,
J. Roger Hindley
,
Martin W. Bunder
Theoretical Computer Science
135
(2), 1994, pp. 405-422
The Inf function in the system
F
R. David
Theoretical Computer Science
135
(2), 1994, pp. 423-431
Semiretracts of a free monoid
J.A. Anderson
Theoretical Computer Science
134
(1), 1994, pp. 3-11
Rabin tree automata and finite monoids
Danièle Beauquier
,
Andreas Podelski
Theoretical Computer Science
134
(1), 1994, pp. 13-25
A complete system of identities for one-letter rational expressions with multiplicities in the tropical semiring
Agnès Bonnier-Rigny
,
Daniel Krob
Theoretical Computer Science
134
(1), 1994, pp. 27-50
Boolean neural nets are observable
Fernando Botelho
,
Max Garzon
Theoretical Computer Science
134
(1), 1994, pp. 51-61
A fast algorithm for the unique decipherability of multivalued encodings
Renato M. Capocelli
,
Luisa Gargano
,
Ugo Vaccaro
Theoretical Computer Science
134
(1), 1994, pp. 63-78
On dynamic algebras
Sinis̑a Crvenković
,
Rozália Sz. Madarász
Theoretical Computer Science
134
(1), 1994, pp. 79-86
A partial trace semantics for Petri nets
V. Diekert
Theoretical Computer Science
134
(1), 1994, pp. 87-105
Transducers and the decidability of independence in free monoids
H. Jürgensen
,
K. Salomaa
,
S. Yu
Theoretical Computer Science
134
(1), 1994, pp. 107-117
Languages of colonies
Alica Kelemenová
,
Erzsébet Csuhaj-Varjú
Theoretical Computer Science
134
(1), 1994, pp. 119-130
An introduction to commutative and noncommutative Gröbner bases
Teo Mora
Theoretical Computer Science
134
(1), 1994, pp. 131-173
Codes modulo finite monadic string-rewriting systems
Friedrich Otto
,
Paliath Narendran
Theoretical Computer Science
134
(1), 1994, pp. 175-188
Bounds on the variety generated by completely regular syntactic monoids from finite prefix codes
Norman R. Reilly
Theoretical Computer Science
134
(1), 1994, pp. 189-208
A bijection between cliques in graphs and factorizations in free monoids
J.-C. Spehner
Theoretical Computer Science
134
(1), 1994, pp. 209-223
Seiten
<
1
2
3
4
5
6
7
8
9
10
11
12
>