default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 350
Volume 350, Number 1, 18 January 2006
- Nicolò Cesa-Bianchi, Rüdiger Reischuk, Thomas Zeugmann:
Foreword. 1-2 - Kazuyuki Amano, Akira Maruoka:
On learning monotone Boolean functions under the uniform distribution. 3-12 - Rocco A. Servedio:
On learning embedded midbit functions. 13-23 - Nader H. Bshouty, Lynn Burroughs:
Maximizing agreements and coagnostic learning. 24-39 - Jürgen Forster, Hans Ulrich Simon
:
On the smallest possible dimension and the largest possible margin of linear arrangements representing given concept classes. 40-48 - Johannes Köbler, Wolfgang Lindner:
The complexity of learning concept classes with polynomial general dimension. 49-62 - Yusuke Suzuki, Takayoshi Shoudai, Tomoyuki Uchida, Tetsuhiro Miyahara:
Ordered term tree languages which are polynomial time inductively inferable from positive data. 63-90 - Daniel Reidenbach:
A non-learnable class of E-pattern languages. 91-102 - Eric Martin, Arun Sharma, Frank Stephan:
Unifying logic, topology and learning in Parametric logic. 103-124 - Susumu Hayashi:
Mathematics based on incremental learning - Excluded middle and inductive inference. 125-139 - Bertram Fronhöfer, Akihiro Yamamoto:
Hypothesis finding with proof theoretical appropriateness criteria. 140-162
Volume 350, Numbers 2-3, 7 February 2006
- Donald Sannella:
Preface. 163 - Mikolaj Bojanczyk, Thomas Colcombet:
Tree-walking automata cannot be determinized. 164-173 - Anuj Dawar, Erich Grädel, Stephan Kreutzer:
Backtracking games and inflationary fixed points. 174-187 - Yuxin Deng, Davide Sangiorgi:
Towards an algebraic theory of typed mobile processes. 188-212 - Claudia Faggian:
Interactive observability in Ludics: The geometry of tests. 213-233 - Dan R. Ghica, Andrzej S. Murawski, C.-H. Luke Ong:
Syntactic control of concurrency. 234-251 - Esfandiar Haghverdi, Philip J. Scott:
A categorical model for the geometry of interaction. 252-274 - Jack A. Laird:
A calculus of coroutines. 275-291 - Keye Martin:
Entropy as a fixed point. 292-324 - Nicole Schweikardt:
On the expressive power of monadic least fixed point logic. 325-344 - Olivier Serre:
Games with winning conditions of high Borel complexity. 345-372
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-02 23:29 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
