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=350
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On learning monotone Boolean functions under the uniform distribution
Kazuyuki Amano
,
Akira Maruoka
Theoretical Computer Science
350
(1), 2006, pp. 3-12
On learning embedded midbit functions
Rocco A. Servedio
Theoretical Computer Science
350
(1), 2006, pp. 13-23
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
Ordered term tree languages which are polynomial time inductively inferable from positive data
Yusuke Suzuki
,
Takayoshi Shoudai
,
Tomoyuki Uchida
,
Tetsuhiro Miyahara
Theoretical Computer Science
350
(1), 2006, pp. 63-90
A non-learnable class of E-pattern languages
Daniel Reidenbach
Theoretical Computer Science
350
(1), 2006, pp. 91-102
Unifying logic, topology and learning in parametric logic
Éric Martin
,
Arun Sharma
,
Frank Stephan
Theoretical Computer Science
350
(1), 2006, pp. 103-124
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
Entropy as a fixed point
Keye Martin
Theoretical Computer Science
350
(2-3), 2006, pp. 292-324
On the expressive power of monadic least fixed point logic
Nicole Schweikardt
Theoretical Computer Science
350
(2-3), 2006, pp. 325-344
Games with winning conditions of high Borel complexity
Olivier Serre
Theoretical Computer Science
350
(2-3), 2006, pp. 345-372