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=International Journal of Foundations of Computer Science AND YEAR=1991
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Faithful ideal models for recursive polymorphic types
Martín Abadi
,
Benjamin Pierce
,
Gordon Plotkin
International Journal of Foundations of Computer Science
2
(1), 1991, pp. 1-21
Functional production systems viewed as grammars
Thomas Wilmes
International Journal of Foundations of Computer Science
2
(1), 1991, pp. 23-41
Uniform algebraic specifications of finite sets with equality
J.A. Bergstra
,
S. Mauw
,
F. Wiedijk
International Journal of Foundations of Computer Science
2
(1), 1991, pp. 43-65
PSPACE survives constant-width bottlenecks
Jin-Yi Cai
,
Merrick Furst
International Journal of Foundations of Computer Science
2
(1), 1991, pp. 67-76
\#
P
-completeness via many-one reductions
Viktória Zankó
International Journal of Foundations of Computer Science
2
(1), 1991, pp. 77-82
Edge-deletion graph problems with first-order expressible subgraph properties
V. Arvind
,
S. Biswas
International Journal of Foundations of Computer Science
2
(2), 1991, pp. 83-99
A relational model of demonic nondeterministic programs
Thanh Tung Nguyen
International Journal of Foundations of Computer Science
2
(2), 1991, pp. 101-131
On the complexity of some coloring games
Hans L. Bodlaender
International Journal of Foundations of Computer Science
2
(2), 1991, pp. 133-147
Principal type assignment to lambda terms
Sachio Hirokawa
International Journal of Foundations of Computer Science
2
(2), 1991, pp. 149-162
The structure and complexity of minimal NFA's over a unary alphabet
Tao Jiang
,
Edward McDowell
,
B. Ravikumar
International Journal of Foundations of Computer Science
2
(2), 1991, pp. 163-182
Efficient detectors and constructors for simple languages
Dung T. Huynh
International Journal of Foundations of Computer Science
2
(3), 1991, pp. 183-205
On the complexity of computing optimal solutions
Zhi-Zhong Chen
,
Seinosuke Toda
International Journal of Foundations of Computer Science
2
(3), 1991, pp. 207-220
Systolic tree with base automata
A. Monti
,
D. Parente
International Journal of Foundations of Computer Science
2
(3), 1991, pp. 221-236
On the limitations of locally robust positive reductions
Lane A. Hemachandra
,
Sanjay Jain
International Journal of Foundations of Computer Science
2
(3), 1991, pp. 237-255
On the star operation in free partially commutative monoids
Yves Métivier
,
Brigitte Rozoy
International Journal of Foundations of Computer Science
2
(3), 1991, pp. 257-265
Projections of semicomputable relations on abstract data types
J.V. Tucker
,
J.I. Zucker
International Journal of Foundations of Computer Science
2
(3), 1991, pp. 267-296
From Petri nets to linear logic through categories: A survey
Narciso Martí-Oliet
,
José Meseguer
International Journal of Foundations of Computer Science
2
(4), 1991, pp. 297-399
Alternating Turing machines with modified accepting structure
Katsushi Inoue
,
Akira Ito
,
Itsuo Takanami
International Journal of Foundations of Computer Science
2
(4), 1991, pp. 401-417
Solution of a number theoretic problem involving knowledge
Giovanni Panti
International Journal of Foundations of Computer Science
2
(4), 1991, pp. 419-424