External Links

    Journal: Theory Comput. Syst.

    Volume 46, Issue 4

    619 -- 0Sergei N. Artëmov, Volker Diekert, Alexander A. Razborov. Preface
    620 -- 635Jirí Fiala, Daniël Paulusma. Comparing Universal Covers in Polynomial Time
    636 -- 661Roman Kuznets. Self-Referential Justifications in Epistemic Logic
    662 -- 672Yury Savateev. Unidirectional Lambek Grammars in Polynomial Time
    673 -- 689Ugo Dal Lago, Martin Hofmann. A Semantic Proof of Polytime Soundness of Light Affine Logic
    690 -- 706Markus Bläser, Holger Dell, Johann A. Makowsky. Complexity of the Bollobás-Riordan Polynomial. Exceptional Points and Uniform Reductions
    707 -- 722Marius Zimand. Two Sources Are Better than One for Increasing the Kolmogorov Complexity of Infinite Sequences
    723 -- 736Mingyu Xiao. Simple and Improved Parameterized Algorithms for Multiterminal Cuts
    737 -- 760Nicolas Bedon, Alexis Bès, Olivier Carton, Chloe Rispal. Logic and Rational Languages of Words Indexed by Linear Orderings
    761 -- 791Uffe Flarup, Laurent Lyaudet. On the Expressive Power of Permanents and Perfect Matchings of Matrices of Bounded Pathwidth/Cliquewidth

    Volume 46, Issue 3

    397 -- 0Wolfgang Thomas, Pascal Weil. Preface of STACS 2007 Special Issue
    398 -- 415Jin-yi Cai, Pinyan Lu. On Symmetric Signatures in Holographic Algorithms
    416 -- 442Artur Czumaj, Christian Sohler. Small Space Representations for Metric Min-sum ::::k::::-Clustering and Their Applications
    443 -- 478Jean Berstel, Luc Boasson, Olivier Carton, Isabelle Fagnot. Sturmian Trees
    479 -- 498Enrico Formenti, Petr Kurka, Ondrej Zahradník. A Search Algorithm for Subshift Attractors of Cellular Automata
    499 -- 522Nutan Limaye, Meena Mahajan, B. V. Raghavendra Rao. Arithmetizing Classes Around NC/textsf{NC}:::1::: and L/textsf{L}
    523 -- 565Amin Coja-Oghlan, Michael Krivelevich, Dan Vilenchik. Why Almost All ::::k::::-Colorable Graphs Are Easy to Color
    566 -- 597Hans L. Bodlaender, Thomas C. van Dijk. A Cubic Kernel for Feedback Vertex Set and Loop Cutset
    598 -- 617Laurent Bienvenu. Kolmogorov-Loveland Stochasticity and Kolmogorov Complexity

    Volume 46, Issue 2

    157 -- 173Tetsuo Asano, Peter Brass, Shinji Sasahara. Disc Covering Problem with Application to Digital Halftoning
    174 -- 192Florin Manea, Maurice Margenstern, Victor Mitrana, Mario J. Pérez-Jiménez. A New Characterization of NP, P, and PSPACE with Accepting Hybrid Networks of Evolutionary Processors
    193 -- 221Rahul Tripathi. The 1-Versus-2 Queries Problem Revisited
    222 -- 245Piotr Faliszewski, Mitsunori Ogihara. On the Autoreducibility of Functions
    246 -- 260Leah Epstein, Csanád Imreh, Asaf Levin. Class Constrained Bin Covering
    261 -- 283Peter Damaschke. Fixed-Parameter Enumerability of Cluster Editing and Related Problems
    284 -- 300Saverio Caminiti, Emanuele G. Fusco, Rossella Petreschi. Bijective Linear Time Coding and Decoding for ::::k::::-Trees
    301 -- 310Stasys Jukna. Entropy of Operators or why Matrix Multiplication is Hard for Depth-Two Circuits
    311 -- 339Michael R. Fellows, Jörg Flum, Danny Hermelin, Moritz Müller, Frances A. Rosamond. W-Hierarchies Defined by Symmetric Gates
    340 -- 350Valentin V. Andreev, Timothy H. McNicholl. Computing Interpolating Sequences
    351 -- 369Christian Choffrut, Flavio D Alessandro, Stefano Varricchio. On Bounded Rational Trace Languages
    370 -- 395Peter Jonsson, Gustav Nordh. Approximability of Clausal Constraints

    Volume 46, Issue 1

    1 -- 0Sergei N. Artëmov, Volker Diekert, Dima Grigoriev. Preface
    2 -- 8Alexander Rybalov. Generic Complexity of Presburger Arithmetic
    9 -- 26Meena Mahajan, Jayalal M. N. Sarma. On the Complexity of Matrix Rank and Rigidity
    27 -- 58Artur Jez, Alexander Okhotin. Conjunctive Grammars over a Unary Alphabet: Undecidability and Unbounded Growth
    59 -- 79Maxim A. Babenko. A Fast Algorithm for the Path 2-Packing Problem
    80 -- 103Christian Glaßer, Katrin Herr, Christian Reitwießner, Stephen D. Travers, Matthias Waldherr. Equivalence Problems for Circuits over Sets of Natural Numbers
    104 -- 119Benjamin Hoffmann, Mikhail Lifshits, Yury Lifshits, Dirk Nowotka. Maximal Intersection Queries in Randomized Input Models
    120 -- 142Qi Cheng, Sergey P. Tarasov, Mikhail N. Vyalyi. Efficient Algorithms for Sparse Cyclotomic Integer Zero Testing
    143 -- 156Harry Buhrman, Lance Fortnow, Michal Koucký, John D. Rogers, Nikolai K. Vereshchagin. Does the Polynomial Hierarchy Collapse if Onto Functions are Invertible?
    runs on