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=331
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Beyond the Alder-Strassen bound
Markus Bläser
Theoretical Computer Science
331
(1), 2005, pp. 3-21
Combinatorics and algorithms for low-discrepancy roundings of a real sequence
Kunihiko Sadakane
,
Nadia Takki-Chebihi
,
Takeshi Tokuyama
Theoretical Computer Science
331
(1), 2005, pp. 23-36
Testing hypergraph colorability
Artur Czumaj
,
Christian Sohler
Theoretical Computer Science
331
(1), 2005, pp. 37-52
Faster gossiping on butterfly networks
Jop F. Sibeyn
Theoretical Computer Science
331
(1), 2005, pp. 53-72
Performance aspects of distributed caches using TTL-based consistency
Edith Cohen
,
Eran Halperin
,
Haim Kaplan
Theoretical Computer Science
331
(1), 2005, pp. 73-96
Realizability and verification of MSC graphs
Rajeev Alur
,
Kousha Etessami
,
Mihalis Yannakakis
Theoretical Computer Science
331
(1), 2005, pp. 97-114
A behavioural pseudometric for probabilistic transition systems
Franck van Breugel
,
James Worrell
Theoretical Computer Science
331
(1), 2005, pp. 115-142
Tree automata with one memory set constraints and cryptographic protocols
Hubert Comon
,
Véronique Cortier
Theoretical Computer Science
331
(1), 2005, pp. 143-214
Amalgamation in the semantics of CASL
Lutz Schröder
,
Till Mossakowski
,
Andrzej Tarlecki
,
Bartek Klin
,
Piotr Hoffman
Theoretical Computer Science
331
(1), 2005, pp. 215-247
An assertion-based proof system for multithreaded Java
Erika Ábrahám
,
Frank S. de Boer
,
Willem-Paul de Roever
,
Martin Steffen
Theoretical Computer Science
331
(2-3), 2005, pp. 251-290
Semantic models of a timed distributed dataspace architecture
Jozef Hooman
,
Jaco van de Pol
Theoretical Computer Science
331
(2-3), 2005, pp. 291-323
Coalgebraic minimization of HD-automata for the
\pi
-calculus using polymorphic types
Gianluigi Ferrari
,
Ugo Montanari
,
Emilio Tuosto
Theoretical Computer Science
331
(2-3), 2005, pp. 325-365
A calculus for reasoning about software composition
Franz Achermann
,
Oscar Nierstrasz
Theoretical Computer Science
331
(2-3), 2005, pp. 367-396
A compositional approach to CTL* verification
Yonit Kesten
,
Amir Pnueli
Theoretical Computer Science
331
(2-3), 2005, pp. 397-428
Verification and refinement with fine-grained action-based concurrent objects
Emil Sekerinski
Theoretical Computer Science
331
(2-3), 2005, pp. 429-455
A coordination approach to mobile components
Dirk Pattinson
,
Martin Wirsing
Theoretical Computer Science
331
(2-3), 2005, pp. 457-483