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=379
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Operational semantics for Petri net components
Jan Friso Groote
,
Marc Voorhoeve
Theoretical Computer Science
379
(1-2), 2007, pp. 1-19
From truth to computability II
Giorgi Japaridze
Theoretical Computer Science
379
(1-2), 2007, pp. 20-52
Closure properties for the class of behavioral models
Manuel A. Martins
Theoretical Computer Science
379
(1-2), 2007, pp. 53-83
Strong planning under uncertainty in domains with numerous but identical elements (a generic approach)
Max Kanovich
,
Jacqueline Vauzeilles
Theoretical Computer Science
379
(1-2), 2007, pp. 84-119
Semantics of a sequential language for exact real-number computation
J. Raymundo Marcial-Romero
,
Martín H. Escardó
Theoretical Computer Science
379
(1-2), 2007, pp. 120-141
Reasoning about probabilistic sequential programs
R. Chadha
,
L. Cruz-Filipe
,
P. Mateus
,
A. Sernadas
Theoretical Computer Science
379
(1-2), 2007, pp. 142-165
The differential
\lambda \mu
-calculus
Lionel Vaux
Theoretical Computer Science
379
(1-2), 2007, pp. 166-209
Ultraproducts and possible worlds semantics in institutions
Răzvan Diaconescu
,
Petros Stefaneas
Theoretical Computer Science
379
(1-2), 2007, pp. 210-230
Algorithmic analysis of polygonal hybrid systems, part I: Reachability
Eugene Asarin
,
Gerardo Schneider
,
Sergio Yovine
Theoretical Computer Science
379
(1-2), 2007, pp. 231-265
Generalising automaticity to modal properties of finite structures
Anuj Dawar
,
Stephan Kreutzer
Theoretical Computer Science
379
(1-2), 2007, pp. 266-285
Complexity results on branching-time pushdown model checking
Laura Bozzelli
Theoretical Computer Science
379
(1-2), 2007, pp. 286-297
Losing recognizability
Sándor Vágvölgyi
Theoretical Computer Science
379
(1-2), 2007, pp. 298-304
Degree distribution of the FKP network model
Noam Berger
,
Béla Bollobás
,
Christian Borgs
,
Jennifer Chayes
,
Oliver Riordan
Theoretical Computer Science
379
(3), 2007, pp. 306-316
Polynomial time algorithm for an optimal stable assignment with multiple partners
Vipul Bansal
,
Aseem Agrawal
,
Varun S. Malhotra
Theoretical Computer Science
379
(3), 2007, pp. 317-328
Algorithmic analysis of a basic evolutionary algorithm for continuous optimization
Jens Jägersküpper
Theoretical Computer Science
379
(3), 2007, pp. 329-347
Decoding interleaved Reed-Solomon codes over noisy channels
Daniel Bleichenbacher
,
Aggelos Kiayias
,
Moti Yung
Theoretical Computer Science
379
(3), 2007, pp. 348-360
Dual-bounded generating problems: Efficient and inefficient points for discrete probability distributions and sparse boxes for multidimensional data
Leonid Khachiyan
,
Endre Boros
,
Khaled Elbassioni
,
Vladimir Gurvich
,
Kazuhisa Makino
Theoretical Computer Science
379
(3), 2007, pp. 361-376
Generating labeled planar graphs uniformly at random
Manuel Bodirsky
,
Clemens Gröpl
,
Mihyun Kang
Theoretical Computer Science
379
(3), 2007, pp. 377-386
Multicommodity flows over time: Efficient algorithms and complexity
Alex Hall
,
Steffen Hippler
,
Martin Skutella
Theoretical Computer Science
379
(3), 2007, pp. 387-404
The cell probe complexity of succinct data structures
Anna Gál
,
Peter Bro Miltersen
Theoretical Computer Science
379
(3), 2007, pp. 405-417
Efficient pebbling for list traversal synopses with application to program rollback
Yossi Matias
,
Ely Porat
Theoretical Computer Science
379
(3), 2007, pp. 418-436