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=127
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Bayesianism: An algorithmic analysis
Vladimir V. V'yugin
Information and Computation
127
(1), 1996, pp. 1-10
Real number computability and domain theory
Pietro Di Gianantonio
Information and Computation
127
(1), 1996, pp. 11-25
Axiomatizing prefix iteration with silent steps
Luca Aceto
,
Rob van Glabbeek
,
Wan Fokkink
,
Anna Ingólfsdóttir
Information and Computation
127
(1), 1996, pp. 26-40
The limit of
\mbox{Split}_n
-language equivalence
Walter Vogler
Information and Computation
127
(1), 1996, pp. 41-61
Relational properties of domains
Andrew M. Pitts
Information and Computation
127
(2), 1996, pp. 66-90
Verifying programs with unreliable channels
Parosh Aziz Abdulla
,
Bengt Jonsson
Information and Computation
127
(2), 1996, pp. 91-101
Standard ML-NJ weak polymorphism and imperative constructs
John Mitchell
,
Ramesh Viswanathan
Information and Computation
127
(2), 1996, pp. 102-116
Database query languages embedded in the typed lambda calculus
Gerd G. Hillebrand
,
Paris C. Kanellakis
,
Harry G. Mairson
Information and Computation
127
(2), 1996, pp. 117-144
Full abstraction for a shared-variable parallel language
Stephen Brookes
Information and Computation
127
(2), 1996, pp. 145-163
Bisimulation from open maps
André Joyal
,
Mogens Nielsen
,
Glynn Winskel
Information and Computation
127
(2), 1996, pp. 164-185
A coinduction principle for recursive data types based on bisimulation
Marcelo P. Fiore
Information and Computation
127
(2), 1996, pp. 186-198