Journal: Theory Comput. Syst.

Volume 64, Issue 5

681 -- 734Dibyayan Chakraborty, Mathew C. Francis. On the Stab Number of Rectangle Intersection Graphs
735 -- 753Hans Raj Tiwary. Extension Complexity of Formal Languages
754 -- 782Dimitris Fotakis, Ioannis Milis, Orestis Papadigenopoulos, Vasilis Vassalos, Georgios Zois. Scheduling MapReduce Jobs on Identical and Unrelated Processors
783 -- 798Nicolás Alvarez, Olivier Carton. On Normality in Shifts of Finite Type
799 -- 825Beate Bollig, Matthias Buttkus. On Limitations of Structured (Deterministic) DNNFs
826 -- 827Benny Kimelfeld. Special Issue on the 2018 International Conference on Database Theory
828 -- 860Nofar Carmeli, Markus Kröll. Enumeration Complexity of Conjunctive Queries with Functional Dependencies
861 -- 914Antoine Amarilli, Florent Capelli, Mikaël Monet, Pierre Senellart. Connecting Knowledge Compilation Classes and Width Parameters
915 -- 0Antoine Amarilli, Florent Capelli, Mikaël Monet, Pierre Senellart. Correction to: Connecting Knowledge Compilation Classes and Width Parameters
916 -- 964Pablo Barceló, Miguel Romero 0001, Thomas Zeume. A More General Theory of Static Approximations for Conjunctive Queries
965 -- 998Bas Ketsman, Aws Albarghouthi, Paraschos Koutris. Distribution Policies for Datalog