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=105
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On functors expressible in the polymorphic typed lambda calculus
John C. Reynolds
,
Gordon D. Plotkin
Information and Computation
105
(1), 1993, July, pp. 1-29
Typing in pure type systems
L.S. van Benthem Jutting
Information and Computation
105
(1), 1993, July, pp. 30-41
Continuous information systems
R. Hoofman
Information and Computation
105
(1), 1993, July, pp. 42-71
On checking versus evaluation of multiple queries
William I. Gasarch
,
Lane A. Hemachandra
,
Albrecht Hoene
Information and Computation
105
(1), 1993, July, pp. 72-93
Lower bounds and efficient algorithms for multiprocessor scheduling of directed acyclic graphs with communication delays
Hermann Jung
,
Lefteris M. Kirousis
,
Paul Spirakis
Information and Computation
105
(1), 1993, July, pp. 94-104
The anaphora problem
Eric Sven Ristad
Information and Computation
105
(1), 1993, July, pp. 105-131
More choices allow more faults: Set consensus problems in totally asynchronous systems
Soma Chaudhuri
Information and Computation
105
(1), 1993, July, pp. 132-158
Full abstraction in the lazy lambda calculus
Samson Abramsky
,
C.-H. Luke Ong
Information and Computation
105
(2), 1993, August, pp. 159-267
Automating PĆ³lya theory: The computational complexity of the cycle index polynomial
Leslie Ann Goldberg
Information and Computation
105
(2), 1993, August, pp. 268-288