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=200
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Quantum and classical complexity classes: Separations, collapses, and closure properties
Holger Spakowski
,
Mayur Thakur
,
Rahul Tripathi
Information and Computation
200
(1), 2005, pp. 1-34
Bridging the gap between fair simulation and trace inclusion
Yonit Kesten
,
Nir Piterman
,
Amir Pnueli
Information and Computation
200
(1), 2005, pp. 35-61
Time and space optimal implementations of atomic multi-writer register
Amos Israeli
,
Amnon Shaham
Information and Computation
200
(1), 2005, pp. 62-106
Notions of bisimulation and congruence formats for SOS with data
Mohammad Reza Mousavi
,
Michel A. Reniers
,
Jan Friso Groote
Information and Computation
200
(1), 2005, pp. 107-147
Comparative branching-time semantics for Markov chains
Christel Baier
,
Joost-Pieter Katoen
,
Holger Hermanns
,
Verena Wolf
Information and Computation
200
(2), 2005, pp. 149-214
Types and full abstraction for polyadic
\pi
-calculus
Paola Quaglia
,
David Walker
Information and Computation
200
(2), 2005, pp. 215-246
Reductions between disjoint
NP
-pairs
Christian Glaßer
,
Alan L. Selman
,
Samik Sengupta
Information and Computation
200
(2), 2005, pp. 247-267