


default search action
Theoretical Computer Science, Volume 416
Volume 416, January 2012
- Flavio D'Alessandro, Benedetto Intrigila, Stefano Varricchio:

Quasi-polynomials, linear Diophantine equations and semi-linear sets. 1-16 - Zoltán Ésik, Szabolcs Iván

:
On Müller context-free grammars. 17-32 - Svante Janson:

Renewal theory in the analysis of tries and strings. 33-54 - Rohit Khandekar, Guy Kortsarz, Zeev Nutov:

Approximating fault-tolerant group-Steiner problems. 55-64 - Jiangxu Kong, Weifan Wang, Xuding Zhu:

The surviving rate of planar graphs. 65-70 - Alexander Okhotin

, Oksana Yakimova:
Language equations with complementation: Expressive power. 71-86 - Marcus Poggi, David Sotelo

:
A linear time approximation algorithm for permutation flow shop scheduling. 87-94

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














