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=115
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Reasoning about infinite computations
Moshe Y. Vardi
,
Pierre Wolper
Information and Computation
115
(1), 1994, November, pp. 1-37
A syntactic approach to type soundness
Andrew K. Wright
,
Matthias Felleisen
Information and Computation
115
(1), 1994, November, pp. 38-94
Asynchronous approximate agreement
A.D. Fekete
Information and Computation
115
(1), 1994, November, pp. 95-124
Fully abstract denotational models for nonuniform concurrent languages
E. Horita
,
J.W. de Bakker
,
J.J.M.M. Rutten
Information and Computation
115
(1), 1994, November, pp. 125-178
Adding action refinement to a finite process algebra
L. Aceto
,
M. Hennessy
Information and Computation
115
(2), 1994, December, pp. 179-247
Predicting
\{0,1\}
-functions on randomly drawn points
D. Haussler
,
N. Littlestone
,
M.K. Warmuth
Information and Computation
115
(2), 1994, December, pp. 248-292
The complexity of word problems-this time with interleaving
Alan J. Mayer
,
Larry J. Stockmeyer
Information and Computation
115
(2), 1994, December, pp. 293-311
Tolerating a linear number of faults in networks of bounded degree
Eli Upfal
Information and Computation
115
(2), 1994, December, pp. 312-320
Logical definability of NP optimization problems
Phokion G. Kolaitis
,
Madhukar N. Thakur
Information and Computation
115
(2), 1994, December, pp. 321-353
Undecidable equivalences for Basic Process Algebra
Jan Friso Groote
,
Hans Hüttel
Information and Computation
115
(2), 1994, December, pp. 354-371