


default search action
Theoretical Computer Science, Volume 558
Volume 558, November 2014
Editorial
- Nader H. Bshouty, Gilles Stoltz, Nicolas Vayatis, Thomas Zeugmann:

Guest Editors' foreword. 1-4
- Ziyuan Gao, Frank Stephan

:
Confident and consistent partial learning of recursive functions. 5-17 - Christophe Costa Florêncio, Sicco Verwer:

Regular inference as vertex coloring. 18-34 - Rahim Samei, Pavel Semukhin

, Boting Yang, Sandra Zilles:
Algebraic methods proving Sauer's bound for teaching complexity. 35-50 - Shalev Ben-David, Lev Reyzin

:
Data stability in clustering: A closer look. 51-61 - Ronald Ortner

, Daniil Ryabko, Peter Auer
, Rémi Munos:
Regret bounds for restless Markov bandits. 62-76 - Alexandra Carpentier

, Rémi Munos:
Minimax number of strata for online stratified sampling: The case of noisy samples. 77-106 - Edward Moroshko, Koby Crammer:

Weighted last-step min-max algorithm with improved sub-logarithmic regret. 107-124 - Tor Lattimore, Marcus Hutter

:
Near-optimal PAC bounds for discounted MDPs. 125-143 - Wouter M. Koolen, Vladimir Vovk

:
Buy low, sell high. 144-158 - Manfred K. Warmuth, Wojciech Kotlowski, Shuisheng Zhou

:
Kernelization of matrix updates, when and how? 159-178

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.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














