


default search action
Theoretical Computer Science, Volume 452
Volume 452, September 2012
- Noga Alon, Yuval Emek, Michal Feldman, Moshe Tennenholtz:

Bayesian ignorance. 1-11 - Hind Castel-Taleb, Lynda Mokdad, Nihal Pekergin:

An algorithm approach to bounding aggregations of multidimensional Markov chains. 12-20 - Christophe Costa Florêncio, Henning Fernau

:
On families of categorial grammars of bounded value, their learnability and related complexity questions. 21-38 - Peter Damaschke, Leonid Molokov:

Parameterized reductions and algorithms for a graph editing problem that generalizes vertex cover. 39-46 - Adam R. Day:

Process and truth-table characterisations of randomness. 47-55 - Yuval Emek, Michal Feldman:

Computing optimal contracts in combinatorial agencies. 56-74 - Rudolf Fleischer, Gerhard J. Woeginger:

An algorithmic analysis of the Honey-Bee game. 75-87 - MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Julián Mestre:

The checkpoint problem. 88-99 - Aleksandar Ilic, Sandi Klavzar

, Yoomi Rho:
The index of a binary word. 100-106 - Alexander Kesselman, Stefano Leonardi:

Game-theoretic analysis of Internet switching with selfish users. 107-116 - Stavros D. Nikolopoulos, Leonidas Palios

:
An O(nm)-time certifying algorithm for recognizing HHD-free graphs. 117-131 - Iain A. Stewart

:
A general technique to establish the asymptotic conditional diagnosability of interconnection networks. 132-147

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














