Journal: Theory Comput. Syst.

Volume 49, Issue 2

225 -- 226Andrei S. Morozov, Klaus Wagner. Editorial
227 -- 245Daniil Musatov, Andrei E. Romashchenko, Alexander Shen. Variations on Muchnik s Conditional Complexity Theorem
246 -- 272B. V. Raghavendra Rao, Jayalal M. N. Sarma. On the Complexity of Matroid Isomorphism Problem
273 -- 282Magnus Wahlström. New Plain-Exponential Time Classes for Graph Homomorphism
283 -- 305Niko Haubold, Markus Lohrey. Compressed Word Problems in HNN-extensions and Amalgamated Products
306 -- 318Galina Jirásková. Concatenation of Regular Languages and Descriptional Complexity
319 -- 342Artur Jez, Alexander Okhotin. One-Nonterminal Conjunctive Grammars over a Unary Alphabet
343 -- 354Maurice Jansen. Lower Bounds for the Determinantal Complexity of Explicit Low Degree Polynomials
355 -- 364Christian Choffrut, Juhani Karhumäki. Unique Decipherability in the Monoid of Languages: An Application of Rational Relations
365 -- 366Albert Atserias, Mikolaj Bojanczyk, Balder ten Cate, Ronald Fagin, Floris Geerts, Kenneth Ross. Foreword
367 -- 428Bogdan Cautis, Alin Deutsch, Nicola Onose. Querying Data Sources that Export Infinite Sets of Views
429 -- 459Todd J. Green. Containment of Conjunctive Queries on Annotated Relations
460 -- 488Todd J. Green, Zachary G. Ives, Val Tannen. Reconcilable Differences
489 -- 564Marcelo Arenas, Pablo Barceló, Juan L. Reutter. Query Languages for Data Exchange: Beyond Unions of Conjunctive Queries