Journal: Theory Comput. Syst.

Volume 60, Issue 4

581 -- 614Christoph Berkholz, Paul S. Bonsma, Martin Grohe. Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement
615 -- 636Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Erik Jan van Leeuwen, Marcin Wrochna. Polynomial Kernelization for Removing Induced Claws and Diamonds
637 -- 670Spyros Angelopoulos 0001, Diogo Arsénio, Christoph Dürr, Alejandro López-Ortiz. Multi-processor Search and Scheduling Problems with Setup Cost
671 -- 676Alexander Rybalov. On the Generic Undecidability of the Halting Problem for Normalized Turing Machines
677 -- 694Achour Mostéfaoui, Matoula Petrolia, Michel Raynal, Claude Jard. Atomic Read/Write Memory in Signature-Free Byzantine Asynchronous Message-Passing Systems
695 -- 736Benedikt Bollig, Dietrich Kuske, Roy Mennicke. The Complexity of Model Checking Multi-Stack Systems
737 -- 758Nadia Creignou, Arne Meier, Julian-Steffen Müller, Johannes Schmidt 0001, Heribert Vollmer. Paradigms for Parameterized Enumeration
759 -- 783Takuya Yoshino, Kouichi Hirata. Tai Mapping Hierarchy for Rooted Labeled Trees Through Common Subforest

Volume 60, Issue 3

377 -- 0. Editor's Note
378 -- 395Dmitry Gavinsky, Pavel Pudlák. Partition Expanders
396 -- 420Mathieu Hoyrup. Genericity of Weakly Computable Objects
421 -- 437Benoit Monin. Higher Randomness and Forcing with Closed Sets
438 -- 472Georg Zetzsche, Dietrich Kuske, Markus Lohrey. On Boolean Closed Full Trios and Rational Kripke Frames
473 -- 497Francine Blanchet-Sadri, Michelle Bodnar, Benjamin De Winkle. New Bounds and Extended Relations Between Prefix Arrays, Border Arrays, Undirected Graphs, and Indeterminate Strings
498 -- 520Timo Kötzing. A Solution to Wiehagen's Thesis
521 -- 551Matthew Anderson, Anuj Dawar. On Symmetric Circuits and Fixed-Point Logics
552 -- 579Adeline Pierrot, Dominique Rossin. 2-Stack Sorting is Polynomial

Volume 60, Issue 2

129 -- 171Joost Engelfriet, Zoltán Fülöp 0001, Andreas Maletti. Composition Closure of Linear Extended Top-down Tree Transducers
172 -- 193Marcus Schaefer, Daniel Stefankovic. Fixed Points, Nash Equilibria, and the Existential Theory of the Reals
194 -- 221Niloofar Fazlollahi, David Starobinski. Distance Vector-based Advance Reservation with Delay Performance Guarantees
222 -- 252Anja Rey, Jörg Rothe, Adrian Marple. Path-Disruption Games: Bribery and a Probabilistic Model
253 -- 279Laurent Bulteau, Stefan Fafianie, Vincent Froese, Rolf Niedermeier, Nimrod Talmon. The Complexity of Finding Effectors
280 -- 298Luis Filipe Coelho Antunes, Bruno Bauwens, André Souto, Andreia Teixeira. Sophistication vs Logical Depth
299 -- 313Siddharth Bhaskar. A Difference in Complexity Between Recursion and Tail Recursion
314 -- 323Bruno Bauwens. Conditional Measure and the Violation of Van Lambalgen's Theorem for Martin-Löf Randomness
324 -- 345Louay Bazzi, Nagi Nahas. Small-Bias is Not Enough to Hit Read-Once CNF
346 -- 376Frank Gurski. The Behavior of Clique-Width under Graph Operations and Graph Transformations

Volume 60, Issue 1

1 -- 2Alan L. Selman, Arnold L. Rosenberg. 50 Years of TOCS
3 -- 19Bernard Mans, Luke Mathieson. Incremental Problems in the Parameterized Complexity Setting
20 -- 32Suguru Tamaki, Osamu Watanabe 0001. Local Restrictions from the Furst-Saxe-Sipser Paper
33 -- 52Fabrizio Luccio. Arithmetic for Rooted Trees
53 -- 111Michelle Porter, Adam Day, Rodney G. Downey. Notes on Computable Analysis
112 -- 127Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis. On the Chromatic Number of Non-Sparse Random Intersection Graphs