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=333
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Iteration and coiteration schemes for higher-order and nested datatypes
Andreas Abel
,
Ralph Matthes
,
Tarmo Uustalu
Theoretical Computer Science
333
(1-2), 2005, pp. 3-66
Verification of cryptographic protocols: Tagging enforces termination
Bruno Blanchet
,
Andreas Podelski
Theoretical Computer Science
333
(1-2), 2005, pp. 67-90
Normalisation for higher-order calculi with explicit substitutions
Eduardo Bonelli
Theoretical Computer Science
333
(1-2), 2005, pp. 91-125
When ambients cannot be opened
Iovka Boneva
,
Jean-Marc Talbot
Theoretical Computer Science
333
(1-2), 2005, pp. 127-169
Domain theory, testing and simulation for labelled Markov processes
Franck van Breugel
,
Michael Mislove
,
Joël Ouaknine
,
James Worrell
Theoretical Computer Science
333
(1-2), 2005, pp. 171-197
Game semantics and linear CPS interpretation
J. Laird
Theoretical Computer Science
333
(1-2), 2005, pp. 199-224
Multitree automata that count
Denis Lugiez
Theoretical Computer Science
333
(1-2), 2005, pp. 225-263
Ambiguous classes in
\mu
-calculi hierarchies
Luigi Santocanale
,
André Arnold
Theoretical Computer Science
333
(1-2), 2005, pp. 265-296
Locating reaction with 2-categories
Vladimiro Sassone
,
Pawel Sobociński
Theoretical Computer Science
333
(1-2), 2005, pp. 297-327
Optimal oblivious routing on
d
-dimensional meshes
Andre Osterloh
Theoretical Computer Science
333
(3), 2005, pp. 331-346
Single backup table schemes for shortest-path routing
Hiro Ito
,
Kazuo Iwama
,
Yasuo Okabe
,
Takuya Yoshihiro
Theoretical Computer Science
333
(3), 2005, pp. 347-353
Time complexity of radio broadcasting: Adaptiveness vs. obliviousness and randomization vs. determinism
Dariusz R. Kowalski
,
Andrzej Pelc
Theoretical Computer Science
333
(3), 2005, pp. 355-371
The cost of concurrent, low-contention Read&Modify&Write
Costas Busch
,
Marios Mavronicolas
,
Paul Spirakis
Theoretical Computer Science
333
(3), 2005, pp. 373-400
On routing of wavebands for all-to-all communications in all-optical paths and cycles
Michele Flammini
,
Alfredo Navarra
,
Andrzej Proskurowski
Theoretical Computer Science
333
(3), 2005, pp. 401-413
Interval routing in reliability networks
Cyril Gavoille
,
Martin Neheéz
Theoretical Computer Science
333
(3), 2005, pp. 415-432
The Do-All problem with Byzantine processor failures
Antonio Fernández
,
Chryssis Georgiou
,
Alexander Russell
,
Alex A. Shvartsman
Theoretical Computer Science
333
(3), 2005, pp. 433-454