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=2000
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Sturmian words and words with a critical exponent
Drew Vandeth
Theoretical Computer Science
242
(1-2), 2000, pp. 283-300
On hard instances
Martin Mundhenk
Theoretical Computer Science
242
(1-2), 2000, pp. 301-311
On the competitiveness of the move-to-front rule
Conrado Martínez
,
Salvador Roura
Theoretical Computer Science
242
(1-2), 2000, pp. 313-325
On lengths of words in context-free languages
Lucian Ilie
Theoretical Computer Science
242
(1-2), 2000, pp. 327-359
Families of locally testable languages
Pascal Caron
Theoretical Computer Science
242
(1-2), 2000, pp. 361-376
Tight bounds on the solutions of multidimensional divide-and-conquer maximin recurrences
Biing-Feng Wang
Theoretical Computer Science
242
(1-2), 2000, pp. 377-401
Parametrisation of solutions of parametric equation in free monoid
Gennady S. Makanin
,
Tatiana A. Makanina
Theoretical Computer Science
242
(1-2), 2000, pp. 403-475
A property of left-linear rewrite systems preserving recognizability
Pál Gyenizse
,
Sándor Vágvölgyi
Theoretical Computer Science
242
(1-2), 2000, pp. 477-498
A discipline of evolutionary programming
Paul Vitányi
Theoretical Computer Science
241
(1-2), 2000, pp. 3-23
Improved bounds about on-line learning of smooth-functions of a single variable
Philip M. Long
Theoretical Computer Science
241
(1-2), 2000, pp. 25-35
The learnability of exclusive-or expansions based on monotone DNF formulas
Eiji Takimoto
,
Yoshifumi Sakai
,
Akira Maruoka
Theoretical Computer Science
241
(1-2), 2000, pp. 37-50
Exact learning via teaching assistants
V. Arvind
,
N.V. Vinodchandran
Theoretical Computer Science
241
(1-2), 2000, pp. 51-81
Query learning of bounded-width OBDDs
Atsuyoshi Nakamura
Theoretical Computer Science
241
(1-2), 2000, pp. 83-114
Vacillatory and BC learning on noisy data
John Case
,
Sanjay Jain
,
Frank Stephan
Theoretical Computer Science
241
(1-2), 2000, pp. 115-141
Learning languages and functions by erasing
Sanjay Jain
,
Efim Kinber
,
Steffen Lange
,
Rolf Wiehagen
,
Thomas Zeugmann
Theoretical Computer Science
241
(1-2), 2000, pp. 143-189
Inductive inference of unbounded unions of pattern languages from positive data
Takeshi Shinohara
,
Hiroki Arimura
Theoretical Computer Science
241
(1-2), 2000, pp. 191-209
Some classes of Prolog programs inferable from positive data
M.R.K. Krishna Rao
Theoretical Computer Science
241
(1-2), 2000, pp. 211-234
A transition system semanatics for the control-driven coordination language Manifold
M.M. Bonsangue
,
F. Arbab
,
J.W. de Bakker
,
J.J.M.M. Rutten
,
A. Scutellà
,
G. Zavattaro
Theoretical Computer Science
240
(1), 2000, pp. 3-47
Comparing three semantics for Linda-like languages
Nadia Busi
,
Roberto Gorrieri
,
Gianluigi Zavattaro
Theoretical Computer Science
240
(1), 2000, pp. 49-90
Coordinating action systems
Eric J. Hedman
,
Joost N. Kok
,
Kaisa Sere
Theoretical Computer Science
240
(1), 2000, pp. 91-115
Continuation-based transformations for coordination languages
Suresh Jagannathan
Theoretical Computer Science
240
(1), 2000, pp. 117-146
On modelling mobility
Roberto M. Amadio
Theoretical Computer Science
240
(1), 2000, pp. 147-176
Mobile ambients
Luca Cardelli
,
Andrew D. Gordon
Theoretical Computer Science
240
(1), 2000, pp. 177-213
Resolution of Hartmanis' conjecture for NL-hard sparse sets
Jin-Yi Cai
,
D. Sivakumar
Theoretical Computer Science
240
(2), 2000, pp. 257-269
Inferring evolutionary trees with strong combinatorial evidence
Vincent Berry
,
Olivier Gascuel
Theoretical Computer Science
240
(2), 2000, pp. 271-298
Seiten
<
1
2
3
4
5
6
7
8
9
10
11
12
>