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 Volume=80
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Petri nets and algebraic specifications
Wolfgang Reisig
Theoretical Computer Science
80
, 1991, pp. 1-34
On
\alpha_0-v_1
-products of automata
F. Gécseg
,
H. Jürgensen
Theoretical Computer Science
80
, 1991, pp. 35-51
An efficient recognizer for the Boolean closure of context-free languages
Stephan Heilbrunner
,
Lothar Schmitz
Theoretical Computer Science
80
, 1991, pp. 53-75
Global and local views of state fairness
Rodney R. Howell
,
Louis E. Rosier
,
Hsu-Chun Yen
Theoretical Computer Science
80
, 1991, pp. 77-104
Complexity of optimal vector code generation
Patrick Powell
,
Viet Ngo
Theoretical Computer Science
80
, 1991, pp. 105-115
Experiments and stability in group automata
Gerhard Hofer
Theoretical Computer Science
80
, 1991, pp. 117-120
On the strength of temporal proofs
Hajnal Andréka
,
István Németi
,
Ildikó Sain
Theoretical Computer Science
80
, 1991, pp. 125-151
The monadic second-order logic of graphs V: On closing the gap between definability and recognizability
Bruno Courcelle
Theoretical Computer Science
80
, 1991, pp. 153-202
On sets polynomially enumerable by iteration
Lane A. Hemachandra
,
Albrecht Hoene
,
Dirk Siefkes
,
Paul Young
Theoretical Computer Science
80
, 1991, pp. 203-225
Testing approximate symmetry in the plane is NP-hard
Sebastian Iwanowski
Theoretical Computer Science
80
, 1991, pp. 227-262
Correctness of concurrent processes
Ernst-Rüdiger Olderog
Theoretical Computer Science
80
, 1991, pp. 263-288
Space bounded computations: review and new separation results
Desh Ranjan
,
Richard Chang
,
Juris Hartmanis
Theoretical Computer Science
80
, 1991, pp. 289-302
Finite constants: characterizations of a new decidable set of constants
Bernhard Steffen
,
Jens Knoop
Theoretical Computer Science
80
, 1991, pp. 303-318
A Hoare-like verification system for a language with an exception handling mechanism
Danuta Szczepanska
Theoretical Computer Science
80
, 1991, pp. 319-335
On the computational efficiency of symmetric neural networks
Juraj Wiedermann
Theoretical Computer Science
80
, 1991, pp. 337-345