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=185
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Iferring a DNA sequence from erroneous copies
John Kececioglu
,
Ming Li
,
John Tromp
Theoretical Computer Science
185
(1), 1997, pp. 3-13
Recent advances of grammatical inference
Yasubumi Sakakibara
Theoretical Computer Science
185
(1), 1997, pp. 15-45
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