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=1992
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Optimal parallel encoding and decoding algorithms for trees
Stephan Olariu
,
James L. Schwing
,
Jingyuan Zhang
International Journal of Foundations of Computer Science
3
(1), 1992, pp. 1-10
On PV
_{chunk}
operations and matrogenic graphs
Sergio de Agostino
,
Rossella Petreschi
International Journal of Foundations of Computer Science
3
(1), 1992, pp. 11-20
Pushdown automata on infinite trees and nondeterministic context-free programs
A. Saoudi
International Journal of Foundations of Computer Science
3
(1), 1992, pp. 21-39
Learning classes of linearly separable Boolean functions from positive examples
Paola Campadelli
,
Anna Morpurgo
International Journal of Foundations of Computer Science
3
(1), 1992, pp. 41-54
Analysis and implementation of parallel uniform hashing
Fabrizio Luccio
,
Andrea Pietracaprina
,
Geppino Pucci
International Journal of Foundations of Computer Science
3
(1), 1992, pp. 55-63
On the power of one-way synchronized alternating machines with small space
Juraj Hromkovic̑
,
Katsushi Inoue
,
Branislav Rovan
,
Anna Slobodová
,
Itsuo Takanami
,
Klaus W. Wagner
International Journal of Foundations of Computer Science
3
(1), 1992, pp. 65-79
The word problem of ACD-ground theories is undecidable
Claude Marché
International Journal of Foundations of Computer Science
3
(1), 1992, pp. 81-92
On learning limiting programs
John Case
,
Sanjay Jain
,
Arun Sharma
International Journal of Foundations of Computer Science
3
(1), 1992, pp. 93-115
Temporal logics for communicating sequential agents: I
Kamal Lodaya
,
R. Ramanujam
,
P.S. Thiagarajan
International Journal of Foundations of Computer Science
3
(2), 1992, pp. 117-159
On the computing power of programs with sets
Alexei P. Stolboushkin
International Journal of Foundations of Computer Science
3
(2), 1992, pp. 161-180
Holonomic generating functions and context free languages
A. Bertoni
,
P. Massazza
,
N. Sabadini
International Journal of Foundations of Computer Science
3
(2), 1992, pp. 181-191
Making some issues of implicit knowledge explicit
W. van der Hoek
,
J.-J.Ch. Meyer
International Journal of Foundations of Computer Science
3
(2), 1992, pp. 193-223
When is a category of many-sorted algebras Cartesian closed?
Frank J. Oles
International Journal of Foundations of Computer Science
3
(2), 1992, pp. 225-231
Finite state processes,
Z
-temporal logic and the monadic theory of the integers
A. Saoudi
,
D.E. Muller
,
P.E. Schupp
International Journal of Foundations of Computer Science
3
(3), 1992, pp. 233-244
Iteration algebras
Stephen L. Bloom
,
Zoltán Ésik
International Journal of Foundations of Computer Science
3
(3), 1992, pp. 245-302
A calculus of timed communicating systems
Padmanabhan Krishnan
International Journal of Foundations of Computer Science
3
(3), 1992, pp. 303-322
Routing algorithms for double loop networks
Y. Cheng
,
F.K. Hwang
,
I.F. Akyildiz
,
D.F. Hsu
International Journal of Foundations of Computer Science
3
(3), 1992, pp. 323-331
A unification algorithm for the
\lambda
II-calculus
David Pym
International Journal of Foundations of Computer Science
3
(3), 1992, pp. 333-378
On the complexity of the mapping problem for massively parallel architectures
Silvano Antonelli
,
Susanna Pelagatti
International Journal of Foundations of Computer Science
3
(3), 1992, pp. 379-387
Concurrent automata and domains
Manfred Droste
International Journal of Foundations of Computer Science
3
(4), 1992, pp. 389-418
The dot-depth of a generating class of aperiodic monoids is computable
F. Blanchet-Sadri
International Journal of Foundations of Computer Science
3
(4), 1992, pp. 419-442
Petri nets and step transition systems
Madhavan Mukund
International Journal of Foundations of Computer Science
3
(4), 1992, pp. 443-478
Updating binary trees with constant linkage cost
Thomas Ottmann
,
Derick Wood
International Journal of Foundations of Computer Science
3
(4), 1992, pp. 479-501