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=390
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Algorithmic analysis of polygonal hybrid systems, Part II: Phase portrait and tools
Eugene Asarin
,
Gordon Pace
,
Gerardo Schneider
,
Sergio Yovine
Theoretical Computer Science
390
(1), 2008, pp. 1-26
Gathering asynchronous oblivious mobile robots in a ring
Ralf Klasing
,
Euripides Markou
,
Andrzej Pelc
Theoretical Computer Science
390
(1), 2008, pp. 27-39
Motif patterns in 2D
Alberto Apostolico
,
Laxmi Parida
,
Simona E. Rombo
Theoretical Computer Science
390
(1), 2008, pp. 40-55
A rounding algorithm for approximating minimum Manhattan networks
Victor Chepoi
,
Karim Nouioua
,
Yann Vaxès
Theoretical Computer Science
390
(1), 2008, pp. 56-69
Panconnectivity and edge-pancyclicity of faulty recursive circulant
G(2^m,4)
Jung-Heum Park
Theoretical Computer Science
390
(1), 2008, pp. 70-80
An improved approximation algorithm for capacitated multicast routings in networks
Ehab Morsy
,
Hiroshi Nagamochi
Theoretical Computer Science
390
(1), 2008, pp. 81-91
Tag systems and Collatz-like functions
Liesbeth De Mol
Theoretical Computer Science
390
(1), 2008, pp. 92-101
Parikh matrices and amiable words
Adrian Atanasiu
,
Radu Atanasiu
,
Ion Petre
Theoretical Computer Science
390
(1), 2008, pp. 102-109
Online bin packing with arbitrary release times
Yongqiang Shi
,
Deshi Ye
Theoretical Computer Science
390
(1), 2008, pp. 110-119
On the complexity of non-unique probe selection
Yongxi Cheng
,
Ker-I Ko
,
Weili Wu
Theoretical Computer Science
390
(1), 2008, pp. 120-125
True-concurrency probabilistic models: Markov nets and a law of large numbers
Samy Abbes
,
Albert Benveniste
Theoretical Computer Science
390
(2-3), 2008, pp. 129-170
Full abstraction for polymorphic
\pi
-calculus
Alan Jeffrey
,
Julian Rathke
Theoretical Computer Science
390
(2-3), 2008, pp. 171-196
Optimal reachability for multi-priced timed automata
Kim Guldstrand Larsen
,
Jacob Illum Rasmussen
Theoretical Computer Science
390
(2-3), 2008, pp. 197-213
Third-order idealized Algol with iteration is decidable
Andrzej S. Murawski
,
Igor Walukiewicz
Theoretical Computer Science
390
(2-3), 2008, pp. 214-229
Expressivity of coalgebraic modal logic: The limits and beyond
Lutz Schröder
Theoretical Computer Science
390
(2-3), 2008, pp. 230-247
Free-algebra models for the
\pi
-calculus
Ian Stark
Theoretical Computer Science
390
(2-3), 2008, pp. 248-270