Journals in DBLP
Maciej Liskiewicz , Rüdiger Reischuk Preface. [Citation Graph (0, 0)][DBLP ] Theory Comput. Syst., 2007, v:41, n:2, pp:209-210 [Journal ] Matthias P. Krieger On the Incompressibility of Monotone DNFs. [Citation Graph (0, 0)][DBLP ] Theory Comput. Syst., 2007, v:41, n:2, pp:211-231 [Journal ] Tomasz Jurdzinski , Krzysztof Lorys Leftist Grammars and the Chomsky Hierarchy. [Citation Graph (0, 0)][DBLP ] Theory Comput. Syst., 2007, v:41, n:2, pp:233-256 [Journal ] Daniel Meister Polynomial-Space Decidable Membership Problems for Recurrent Systems over Sets of Natural Numbers. [Citation Graph (0, 0)][DBLP ] Theory Comput. Syst., 2007, v:41, n:2, pp:257-289 [Journal ] Holger Spakowski , Rahul Tripathi On the Power of Unambiguity in Alternating Machines. [Citation Graph (0, 0)][DBLP ] Theory Comput. Syst., 2007, v:41, n:2, pp:291-326 [Journal ] Till Tantau Logspace Optimization Problems and Their Approximability Properties. [Citation Graph (0, 0)][DBLP ] Theory Comput. Syst., 2007, v:41, n:2, pp:327-350 [Journal ] Birgit Schelm Average-Case Non-Approximability of Optimisation Problems. [Citation Graph (0, 0)][DBLP ] Theory Comput. Syst., 2007, v:41, n:2, pp:351-368 [Journal ] Michael Brinkmeier A Simple and Fast Min-Cut Algorithm. [Citation Graph (0, 0)][DBLP ] Theory Comput. Syst., 2007, v:41, n:2, pp:369-380 [Journal ] Fedor V. Fomin , Pinar Heggernes , Dieter Kratsch Exact Algorithms for Graph Homomorphisms. [Citation Graph (0, 0)][DBLP ] Theory Comput. Syst., 2007, v:41, n:2, pp:381-393 [Journal ]