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 YEAR=2006
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A modal proof theory for final polynomial coalgebras
David Friggens
,
Robert Goldblatt
Theoretical Computer Science
360
(1-3), 2006, pp. 1-22
Theoretical foundations of dynamic program slicing
Dave Binkley
,
Sebastian Danicic
,
Tibor Gyimóthy
,
Mark Harman
,
Ákos Kiss
,
Bogdan Korel
Theoretical Computer Science
360
(1-3), 2006, pp. 23-41
On structuring proof search for first order linear logic
Paola Bruscoli
,
Alessio Guglielmi
Theoretical Computer Science
360
(1-3), 2006, pp. 42-76
LTL over integer periodicity constraints
Stéphane Demri
Theoretical Computer Science
360
(1-3), 2006, pp. 96-123
Two polygraphic presentations of Petri nets
Yves Guiraud
Theoretical Computer Science
360
(1-3), 2006, pp. 124-146
Decidability of performance equivalence for basic parallel processes
Sƚawomir Lasota
Theoretical Computer Science
360
(1-3), 2006, pp. 172-192
Eigenvariables, bracketing and the decidability of positive minimal predicate logic
Gilles Dowek
,
Ying Jiang
Theoretical Computer Science
360
(1-3), 2006, pp. 193-208
Normal forms for binary relations
Daniel J. Dougherty
,
Claudio Gutiérrez
Theoretical Computer Science
360
(1-3), 2006, pp. 228-246
Boolean operations and inclusion test for attribute-element constraints
Haruo Hosoya
,
Makoto Murata
Theoretical Computer Science
360
(1-3), 2006, pp. 327-351
Model checking for process rewrite systems and a class of action-based regular properties
Laura Bozzelli
Theoretical Computer Science
360
(1-3), 2006, pp. 352-372
Semantic foundations for generalized rewrite theories
Roberto Bruni
,
José Meseguer
Theoretical Computer Science
360
(1-3), 2006, pp. 386-414
Processes as formal power series: A coinductive approach to denotational semantics
Michele Boreale
,
Fabio Gadducci
Theoretical Computer Science
360
(1-3), 2006, pp. 440-458
Erratum to ''Axiomatisations of functional dependencies in the presence of records, lists, sets and multisets''
Sven Hartmann
,
Sebastian Link
,
Klaus-Dieter Schewe
Theoretical Computer Science
360
(1-3), 2006, pp. 459-459
Lower bounds for restricted read-once parity branching programs
Matthias Homeister
Theoretical Computer Science
359
(1-3), 2006, pp. 1-14
Maximal pattern complexity of two-dimensional words
Teturo Kamae
,
Hui Rao
,
Yu-Mei Xue
Theoretical Computer Science
359
(1-3), 2006, pp. 15-27
On the edge-bandwidth of graph products
József Balogh
,
Dhruv Mubayi
,
András Pluhár
Theoretical Computer Science
359
(1-3), 2006, pp. 43-57
An efficient algorithm to find a double-loop network that realizes a given L-shape
Chiuyuan Chen
,
James K. Lan
,
Wen-Shiang Tang
Theoretical Computer Science
359
(1-3), 2006, pp. 69-76
Synchronizing groups and automata
Fredrick Arnold
,
Benjamin Steinberg
Theoretical Computer Science
359
(1-3), 2006, pp. 101-110
Newton's method with deflation for isolated singularities of polynomial systems
Anton Leykin
,
Jan Verschelde
,
Ailing Zhao
Theoretical Computer Science
359
(1-3), 2006, pp. 111-122
Improved bounds and schemes for the declustering problem
Benjamin Doerr
,
Nils Hebbinghaus
,
Sören Werth
Theoretical Computer Science
359
(1-3), 2006, pp. 123-132
k
-spine, 1-bend planarity
Emilio Di Giacomo
,
Walter Didimo
,
Giuseppe Liotta
,
Matthew Suderman
Theoretical Computer Science
359
(1-3), 2006, pp. 148-175
A note on dimensions of polynomial size circuits
Xiaoyang Gu
Theoretical Computer Science
359
(1-3), 2006, pp. 176-187
Vertex disjoint paths on clique-width bounded graphs
Frank Gurski
,
Egon Wanke
Theoretical Computer Science
359
(1-3), 2006, pp. 188-199
Algorithmic combinatorics based on slicing posets
Vijay K. Garg
Theoretical Computer Science
359
(1-3), 2006, pp. 200-213
Word assembly through minimal forbidden words
Gabriele Fici
,
Filippo Mignosi
,
Antonio Restivo
,
Marinella Sciortino
Theoretical Computer Science
359
(1-3), 2006, pp. 214-230
Seiten
<
1
2
3
4
5
6
7
8
9
10
11
12
>