The Special Issue on

Algorithmic Learning Theory

for ALT 2013 in

Theoretical Computer Science

ALT 13 Logo

appeared in

Theoretical Computer Science Volume 620, March 21, 2016.

The Special Issue on Algorithmic Learning Theory has been edited by Sanjay Jain, Rémi Munos, Frank Stephan, and Thomas Zeugmann.


Table of Contents


Sanjay Jain, Rémi Munos, Frank Stephan, and Thomas Zeugmann
Guest Editors' Foreword, Free download until April 9, 2016.
pp. 1–3
Jara Uitto and Roger Wattenhofer
On competitive recommendations ,
Abstract.
pp. 4–14
Ziyuan Gao, Frank Stephan, and Sandra Zilles,
Partial learning of recursively enumerable languages,
Abstract.
pp. 15–32
John Case and Timo Kötzing.
Topological separations in inductive inference,
Abstract.
pp. 33–45
Chihiro Shibata and Ryo Yoshinaka.
Probabilistic learnability of context-free grammars with basic distributional properties from positive examples,
Abstract.
pp. 46–72
Malte Darnstädt, Thorsten Kiss, Hans Ulrich Simon, and Sandra Zilles.
Order compression schemes,
Abstract.
pp. 73–90
Anna Choromanska, Krzysztof Choromanski, Geetha Jagannathan, and Claire Monteleoni.
Differentially-private learning of low dimensional manifolds,
Abstract.
pp. 91–104
Lee-Ad Gottlieb, Aryeh Kontorovich, and Robert Krauthgamer.
Adaptive metric dimensionality reduction,
Abstract.
pp. 105–118
Azadeh Khaleghi and Daniil Ryabko.
Nonparametric multiple change point estimation in highly dependent time series,
Abstract.
pp. 119–133



uparrowback to the ALT Archives page;
uparrowback to the Editorial Work page.

Valid HTML 4.1!