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=1997
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Learning unions of tree patterns using queries
Hiroki Arimura
,
Hiroki Ishizaka
,
Takeshi Shinohara
Theoretical Computer Science
185
(1), 1997, pp. 47-62
Learning deterministic even linear languages from positive examples
Takeshi Koshiba
,
Erkki Mäkinen
,
Yuji Takada
Theoretical Computer Science
185
(1), 1997, pp. 63-79
Probabilistic language learning under monotonicity constraints
Léa Meyer
Theoretical Computer Science
185
(1), 1997, pp. 81-128
Noisy inference and oracles
Frank Stephan
Theoretical Computer Science
185
(1), 1997, pp. 129-157
Learning nested differences in the presence of malicious noise
Peter Auer
Theoretical Computer Science
185
(1), 1997, pp. 159-175
Learning orthogonal
F
-Horn formulas
Eiji Takimoto
,
Akira Miyashiro
,
Akira Maruoka
,
Yoshifumi Sakai
Theoretical Computer Science
185
(1), 1997, pp. 177-190
A framework for incremental learning of logic programs
M.R.K. Krishna Rao
Theoretical Computer Science
185
(1), 1997, pp. 191-213
New Curry-Howard terms for full linear logic
David Albrecht
,
John N. Crossley
,
John S. Jeavons
Theoretical Computer Science
185
(2), 1997, pp. 217-235
Covariant types
C. Barry Jay
Theoretical Computer Science
185
(2), 1997, pp. 237-258
A fully distributed quorum consensus method with high fault-tolerance and low communication overhead
Xuemin Lin
Theoretical Computer Science
185
(2), 1997, pp. 259-275
A first order logic of effects
Ian A. Mason
Theoretical Computer Science
185
(2), 1997, pp. 277-318
Multi-dimensional logic programming: Theoretical foundations
Mehmet A. Orgun
,
Weichang Du
Theoretical Computer Science
185
(2), 1997, pp. 319-345
Many-to-many routing on trees via matchings
Grammati E. Pantziou
,
Alan Roberts
,
Antonis Symvonis
Theoretical Computer Science
185
(2), 1997, pp. 347-377
A corrected 5NF definition for relational database design
Millist W. Vincent
Theoretical Computer Science
185
(2), 1997, pp. 379-391
An order-sorted resolution in theory and practice
Trudy Weibel
Theoretical Computer Science
185
(2), 1997, pp. 393-410
A unifying view for logic programming with non-monotonic reasoning
Antonio Brogi
,
Evelina Lamma
,
Paolo Mancarella
,
Paola Mello
Theoretical Computer Science
184
(1-2), 1997, pp. 1-59
Liminf convergence in
\Omega
-categories
Kim Ritter Wagner
Theoretical Computer Science
184
(1-2), 1997, pp. 61-104
A logical semantics for depth-first Prolog with ground negation
James Andrews
Theoretical Computer Science
184
(1-2), 1997, pp. 105-143
Algebraic transformation of unary partial algebras - I. Double-pushout approach
P. Burmeister
,
F. Rosselló
,
J. Torrens
,
G. Valiente
Theoretical Computer Science
184
(1-2), 1997, pp. 145-193
Dynamic constraints and object migration
Jianwen Su
Theoretical Computer Science
184
(1-2), 1997, pp. 195-236
0-1 laws by preservation
Thierry Lacoste
Theoretical Computer Science
184
(1-2), 1997, pp. 237-245
Insertion and deletion closure of languages
Masami Ito
,
Lila Kari
,
Gabriel Thierrin
Theoretical Computer Science
183
(1), 1997, pp. 3-19
Length considerations in context-free languages
Danny Raz
Theoretical Computer Science
183
(1), 1997, pp. 21-32
On computational complexity of contextual languages
Lucian Ilie
Theoretical Computer Science
183
(1), 1997, pp. 33-44
Sturmian words: Structure, combinatorics, and their artihmetics
Aldo de Luca
Theoretical Computer Science
183
(1), 1997, pp. 45-82
Seiten
<
1
2
3
4
5
6
7
8
9
10
11
12
>