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=Inf.~Comput. AND Volume=73
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Lower bounds on communication complexity
P. Durivs
,
Z. Galil
,
G. Schnitger
Information and Computation
73
(1), 1987, pp. 1-22
The decentralized Wald problem
D. Teneketzis
,
Y.-C. Ho
Information and Computation
73
(1), 1987, pp. 23-44
Layouts with wires of balanced length
B. Becker
,
H.G. Osthof
Information and Computation
73
(1), 1987, pp. 45-58
Semi-commutations
M. Clerbout
,
M. Latteux
Information and Computation
73
(1), 1987, pp. 59-74
Parallel time
O(\log n)
recognition of unambiguous context-free languages
W. Rytter
Information and Computation
73
(1), 1987, pp. 75-86
Semantics of production systems
G. Pacini
,
F. Turini
Information and Computation
73
(2), 1987, pp. 87-101
Separation and lower bounds for ROM and nondeterministic models of parallel computation
M. Li
,
Y. Yesha
Information and Computation
73
(2), 1987, pp. 102-128
Algebra of constructions: I. The word problem for partial algebras
A. Obtulowicz
Information and Computation
73
(2), 1987, pp. 129-173
Object histories which avoid certain subsequences
S. Ginsburg
,
M. Gyssens
Information and Computation
73
(2), 1987, pp. 174-206
Weak and strong fairness in CCS
Gerardo Costa
,
Colin Stirling
Information and Computation
73
(3), 1987, June, pp. 207-244
Look-ahead on pushdowns
Joost Engelfriet
,
Heiko Vogler
Information and Computation
73
(3), 1987, June, pp. 245-279