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=1990
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On evaluating Boolean fuctions with unreliable tests
Claire Kenyon
,
Andrew C. Yao
International Journal of Foundations of Computer Science
1
(1), 1990, pp. 1-10
On the complexity of recognizable
\omega
-tree sets and Nerode theorem
A. Saoudi
,
D.E. Muller
,
P.E. Schupp
International Journal of Foundations of Computer Science
1
(1), 1990, pp. 11-21
A ring-theoretic basis for logic programming
V.S. Subrahmanian
International Journal of Foundations of Computer Science
1
(1), 1990, pp. 23-48
Applications of Lyndon homomorphism theorems to the theory of minimal models
Marek A. Suchenek
International Journal of Foundations of Computer Science
1
(1), 1990, pp. 49-59
On a personnel assignment problem
Wan-Di Wei
International Journal of Foundations of Computer Science
1
(1), 1990, pp. 61-70
Planar point location revisited
Franco P. Preparata
International Journal of Foundations of Computer Science
1
(1), 1990, pp. 71-86
Simulation of systolic tree automata on trellis automata
Emanuela Fachini
,
Jozef Gruska
,
Andrea Maggiolo Schettini
,
Davide Sangiorgi
International Journal of Foundations of Computer Science
1
(2), 1990, pp. 87-110
Limiting polynomial approximation of complexity classes
G. Ausiello
,
M. Protasi
International Journal of Foundations of Computer Science
1
(2), 1990, pp. 111-122
Parallel recognition algorithms for graphs with restricted neighbourhoods
Sergio de Agostino
,
Rossella Petreschi
International Journal of Foundations of Computer Science
1
(2), 1990, pp. 123-130
Generalized first-fit algorithms in two and three dimensions
Keqin Li
,
Kam-Hoi Cheng
International Journal of Foundations of Computer Science
1
(2), 1990, pp. 131-150
Recognizing non-floundering logic programs and goals
Roberto Barbuti
,
Maurizio Martelli
International Journal of Foundations of Computer Science
1
(2), 1990, pp. 151-163
Combining term rewriting and type assignment systems
Franco Barbanera
International Journal of Foundations of Computer Science
1
(3), 1990, pp. 165-184
Deadlock prediction in the case of dynamic routing
Daniel P. Bovet
,
Miriam di Ianni
,
Pierluigi Crescenzi
International Journal of Foundations of Computer Science
1
(3), 1990, pp. 185-199
Strong separations for the Boolean hierarchy over
RP
Danilo Bruschi
,
Deborah Joseph
,
Paul Young
International Journal of Foundations of Computer Science
1
(3), 1990, pp. 201-217
Breadth and depth grammars and Deque automata
Alessandra Cherubini
,
Claudio Citrini
,
Stefano Crespi Reghizzi
,
Dino Mandrioli
International Journal of Foundations of Computer Science
1
(3), 1990, pp. 219-232
Semantics of a metalogic programming language
Stefania Costantini
International Journal of Foundations of Computer Science
1
(3), 1990, pp. 233-247
Nested Guarded Horn Clauses
Moreno Falaschi
,
Maurizio Gabbrielli
,
Giorgio Levi
,
Masaki Murakami
International Journal of Foundations of Computer Science
1
(3), 1990, pp. 249-263
Some limit distributions in analysis of algorithms for problems on trace languages
Massimiliano Goldwurm
International Journal of Foundations of Computer Science
1
(3), 1990, pp. 265-276
Towards hierarchical description of systems: A proof system for strong prefixing
Roberto Gorrieri
,
Ugo Montanari
International Journal of Foundations of Computer Science
1
(3), 1990, pp. 277-293
On the notion of linear time computability
Erich Grädel
International Journal of Foundations of Computer Science
1
(3), 1990, pp. 295-307
Sturmian words and ambiguous context-free languages
Filippo Mignosi
International Journal of Foundations of Computer Science
1
(3), 1990, pp. 309-323
Regular systems of equations in
\lambda
-calculus
Adolfo Piperno
,
Enrico Tronci
International Journal of Foundations of Computer Science
1
(3), 1990, pp. 325-339
About modest sets
G. Rosolini
International Journal of Foundations of Computer Science
1
(3), 1990, pp. 341-353
The development of formal language theory since 1956
Robert McNaughton
International Journal of Foundations of Computer Science
1
(4), 1990, pp. 355-368
Redex capturing in term graph rewriting
William M. Farmer
,
Ronald J. Watro
International Journal of Foundations of Computer Science
1
(4), 1990, pp. 369-386
Seiten 1
2
>