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=Theor.~Comput.~Sci. AND Volume=413
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
PADS: An approach to modeling resource demand and supply for the formal analysis of hierarchical scheduling
Anna Philippou
,
Insup Lee
,
Oleg Sokolsky
Theoretical Computer Science
413
(1), 2012, pp. 2-20
Simulation distances
Pavol C̑erný
,
Thomas A. Henzinger
,
Arjun Radhakrishna
Theoretical Computer Science
413
(1), 2012, pp. 21-35
A linear process-algebraic format with data for probabilistic automata
Joost-Pieter Katoen
,
Jaco van de Pol
,
Mariëlle Stoelinga
,
Mark Timmer
Theoretical Computer Science
413
(1), 2012, pp. 36-57
Branching bisimulation congruence for probabilistic systems
Suzana Andova
,
Sonja Georgievska
,
Nikola Trc̑ka
Theoretical Computer Science
413
(1), 2012, pp. 58-72
Approximating Markovian testing equivalence
Aldini Alessandro
Theoretical Computer Science
413
(1), 2012, pp. 73-86
Analysis of a clock synchronization protocol for wireless sensor networks
Faranak Heidarian
,
Julien Schmaltz
,
Frits Vaandrager
Theoretical Computer Science
413
(1), 2012, pp. 87-105
Fluid computation of passage-time distributions in large Markov models
Richard A. Hayden
,
Anton Stefanek
,
Jeremy T. Bradley
Theoretical Computer Science
413
(1), 2012, pp. 106-141
Cost analysis of object-oriented bytecode programs
Elvira Albert
,
Puri Arenas
,
Samir Genaim
,
German Puebla
,
Damiano Zanardini
Theoretical Computer Science
413
(1), 2012, pp. 142-159
Quantitatively fair scheduling
Alessandro Bianco
,
Marco Faella
,
Fabio Mogavero
,
Aniello Murano
Theoretical Computer Science
413
(1), 2012, pp. 160-175