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.
State space reduction for process algebra specifications
Hubert Garavel
,
Wendelin Serwe
Theoretical Computer Science
351
(2), 2006, pp. 131-145
A language for configuring multi-level specifications
Gillian Hill
,
Steven Vickers
Theoretical Computer Science
351
(2), 2006, pp. 146-166
Formal design and verification of operational transformation algorithms for copies convergence
Abdessamad Imine
,
Michaël Rusinowitch
,
Gérald Oster
,
Pascal Molli
Theoretical Computer Science
351
(2), 2006, pp. 167-183
Specification and refinement of mobile systems in MTLA and mobile UML
Alexander Knapp
,
Stephan Merz
,
Martin Wirsing
,
Júlia Zappe
Theoretical Computer Science
351
(2), 2006, pp. 184-202
Modelling concurrent interactions
Juliana Küster-Filipe
Theoretical Computer Science
351
(2), 2006, pp. 203-220
Compatibility of unrooted phylogenetic trees is FPT
David Bryant
,
Jens Lagergren
Theoretical Computer Science
351
(3), 2006, pp. 296-302
Simplifying the weft hierarchy
Jonathan F. Buss
,
Tarique Islam
Theoretical Computer Science
351
(3), 2006, pp. 303-313
On miniaturized problems in parameterized complexity theory
Yijia Chen
,
Jörg Flum
Theoretical Computer Science
351
(3), 2006, pp. 314-336
Parameterized enumeration, transversals, and imperfect phylogeny reconstruction
Peter Damaschke
Theoretical Computer Science
351
(3), 2006, pp. 337-350
On finding short resolution refutations and small unsatisfiable subsets
Michael R. Fellows
,
Stefan Szeider
,
Graham Wrightson
Theoretical Computer Science
351
(3), 2006, pp. 351-359
Chordless paths through three vertices
Robert Haas
,
Michael Hoffmann
Theoretical Computer Science
351
(3), 2006, pp. 360-371
Trees, grids, and MSO decidability: From graphs to matroids
Petr Hlinȇý
,
Detlef Seese
Theoretical Computer Science
351
(3), 2006, pp. 372-393
On learning monotone Boolean functions under the uniform distribution
Kazuyuki Amano
,
Akira Maruoka
Theoretical Computer Science
350
(1), 2006, pp. 3-12
Maximizing agreements and coagnostic learning
Nader H. Bshouty
,
Lynn Burroughs
Theoretical Computer Science
350
(1), 2006, pp. 24-39
On the smallest possible dimension and the largest possible margin of linear arrangements representing given concept classes
Jürgen Forster
,
Hans Ulrich Simon
Theoretical Computer Science
350
(1), 2006, pp. 40-48
The complexity of learning concept classes with polynomial general dimension
Johannes Köbler
,
Wolfgang Lindner
Theoretical Computer Science
350
(1), 2006, pp. 49-62
Mathematics based on incremental learning - Texcluded middle and inductive inference
Susumu Hayashi
Theoretical Computer Science
350
(1), 2006, pp. 125-139
Hypothesis finding with proof theoretical appropriateness criteria
Bertram Fronhöfer
,
Akihiro Yamamoto
Theoretical Computer Science
350
(1), 2006, pp. 140-162
Tree-walking automata cannot be determinized
Mikoƚaj Bojańczyk
,
Thomas Colcombet
Theoretical Computer Science
350
(2-3), 2006, pp. 164-173
Backtracking games and inflationary fixed points
Anuj Dawar
,
Erich Grädel
,
Stephan Kreutzer
Theoretical Computer Science
350
(2-3), 2006, pp. 174-187
Towards an algebraic theory of typed mobile processes
Yuxin Deng
,
Davide Sangiorgi
Theoretical Computer Science
350
(2-3), 2006, pp. 188-212
Interactive observability in Ludics: The geometry of tests
Claudia Faggian
Theoretical Computer Science
350
(2-3), 2006, pp. 213-233
Syntactic control of concurrency
D.R. Ghica
,
A.S. Murawski
,
C.-H.L. Ong
Theoretical Computer Science
350
(2-3), 2006, pp. 234-251
A categorical model for the geometry of interaction
Esfandiar Haghverdi
,
Philip Scott
Theoretical Computer Science
350
(2-3), 2006, pp. 252-274
A calculus of coroutines
J. Laird
Theoretical Computer Science
350
(2-3), 2006, pp. 275-291
Seiten
<
1
2
3
4
5
6
7
8
9
10
11
12