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=137
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Propositional lax logic
Matt Fairtlough
,
Michael Mendler
Information and Computation
137
(1), 1997, pp. 1-33
Non-existent Statman's double fixed point combinator does not exist, indeed
Benedetto Intrigila
Information and Computation
137
(1), 1997, pp. 35-40
Constraint logic programming with dynamic scheduling: A semantics based on closure operators
Moreno Falaschi
,
Maurizio Gabbrielli
,
Kim Marriott
,
Catuscia Palamidessi
Information and Computation
137
(1), 1997, pp. 41-67
Interaction combinators
Yves Lafont
Information and Computation
137
(1), 1997, pp. 69-101
Simulating shared memory in real time: On the computation power of reconfigurable architectures
Artur Czumaj
,
Friedhelm Meyer auf der Heide
,
Volker Stemann
Information and Computation
137
(2), 1997, pp. 103-120
An equational axiomatization for multi-exit iteration
Luca Aceto
,
Wan Fokkink
Information and Computation
137
(2), 1997, pp. 121-158
A tight relationship between generic oracles and type-2 complexity theory
Stephen Cook
,
Russell Impagliazzo
,
Tomoyuki Yamakami
Information and Computation
137
(2), 1997, pp. 159-170