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=382
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Mixing logics and rewards for the component-oriented specification of performance measures
Alessandro Aldini
,
Marco Bernardo
Theoretical Computer Science
382
(1), 2007, pp. 3-23
CSL model checking algorithms for QBDs
Anne Remke
,
Boudewijn R. Haverkort
,
Lucia Cloth
Theoretical Computer Science
382
(1), 2007, pp. 24-41
Model checking mobile stochastic logic
Rocco De Nicola
,
Joost-Pieter Katoen
,
Diego Latella
,
Michele Loreti
,
Mieke Massink
Theoretical Computer Science
382
(1), 2007, pp. 42-70
Formalization of the Standard Uniform random variable
Osman Hasan
,
Sofiène Tahar
Theoretical Computer Science
382
(1), 2007, pp. 71-83
A unified access bound on comparison-based dynamic dictionaries
Mihai Bădoiu
,
Richard Cole
,
Erik D. Demaine
,
John Iacono
Theoretical Computer Science
382
(2), 2007, pp. 86-96
On coding labeled trees
Saverio Caminiti
,
Irene Finocchi
,
Rossella Petreschi
Theoretical Computer Science
382
(2), 2007, pp. 97-108
Complementation of rational sets on scattered linear orderings of finite rank
Olivier Carton
,
Chloé Rispal
Theoretical Computer Science
382
(2), 2007, pp. 109-119
Bounds on the bisection width for random
d
-regular graphs
J. Díaz
,
M.J. Serna
,
N.C. Wormald
Theoretical Computer Science
382
(2), 2007, pp. 120-130
Complexity of the bisection method
Claudio Gutierrez
,
Flavio Gutierrez
,
Maria-Cecilia Rivara
Theoretical Computer Science
382
(2), 2007, pp. 131-138
On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs
Leonid Khachiyan
,
Endre Boros
,
Khaled Elbassioni
,
Vladimir Gurvich
Theoretical Computer Science
382
(2), 2007, pp. 139-150
Approximation schemes for a class of subset selection problems
Kirk Pruhs
,
Gerhard J. Woeginger
Theoretical Computer Science
382
(2), 2007, pp. 151-156
On the (im)possibility of non-interactive correlation distillation
Ke Yang
Theoretical Computer Science
382
(2), 2007, pp. 157-166
On the data consumption benefits of accepting increased uncertainty
Eric Martin
,
Arun Sharma
,
Frank Stephan
Theoretical Computer Science
382
(3), 2007, pp. 170-182
Learning tree languages from positive examples and membership queries
Jérôme Besombes
,
Jean-Yves Marion
Theoretical Computer Science
382
(3), 2007, pp. 183-197
Revising threshold functions
Robert H. Sloan
,
Balázs Szörényi
,
György Turán
Theoretical Computer Science
382
(3), 2007, pp. 198-208
Learning intersection-closed classes with signatures
Andrei Bulatov
,
Hubie Chen
,
Víctor Dalmau
Theoretical Computer Science
382
(3), 2007, pp. 209-220
Applications of regularized least squares to pattern classification
Nicolò Cesa-Bianchi
Theoretical Computer Science
382
(3), 2007, pp. 221-231
Complexity of pattern classes and the Lipschitz property
Amiran Ambroladze
,
Emilio Parrado-Hernández
,
John Shawe-Taylor
Theoretical Computer Science
382
(3), 2007, pp. 232-246
On semimeasures predicting Martin-Löf random sequences
Marcus Hutter
,
Andrej Muchnik
Theoretical Computer Science
382
(3), 2007, pp. 247-261
On the complexity of working set selection
Hans Ulrich Simon
Theoretical Computer Science
382
(3), 2007, pp. 262-279