Journal: Theory Comput. Syst.

Volume 61, Issue 4

945 -- 947Ernst W. Mayr. Editorial: Special Issue on "Theoretical Aspects of Computer Science" (STACS 2015)
948 -- 986Sayan Bhattacharya, Wolfgang Dvorák, Monika Henzinger, Martin Starnberger. Welfare Maximization with Friends-of-Friends Network Externalities
987 -- 1010Andrew V. Goldberg, Sagi Hed, Haim Kaplan, Robert E. Tarjan. Minimum-Cost Flows in Unit-Capacity Networks
1011 -- 1036Telikepalli Kavitha. New Pairwise Spanners
1037 -- 1053Jakub Lacki, Piotr Sankowski. Optimal Decremental Connectivity in Planar Graphs
1054 -- 1083Jacob Holm, Eva Rotenberg. Dynamic Planar Embeddings of Dynamic Graphs
1084 -- 1127Pascal Schweitzer. Towards an Isomorphism Dichotomy for Hereditary Graph Classes
1128 -- 1177Joan Boyar, Lene M. Favrholdt, Christian Kudahl, Jesper W. Mikkelsen. The Advice Complexity of a Class of Hard Online Problems
1178 -- 1213Martin Delacourt, Benjamin Hellouin de Menibus. Characterisation of Limit Measures of Higher-Dimensional Cellular Automata
1214 -- 1236Mathieu Hoyrup, Cristobal Rojas. On the Information Carried by Programs About the Objects they Compute
1237 -- 1251Neeraj Kayal, Chandan Saha 0001. Multi-k-ic Depth Three Circuit Lower Bound
1252 -- 1253Andrew Lewis-Pye, Wolfgang Merkle. Guest Editorial: Tenth International Conference on Computability, Complexity and Randomness (CCR 2015)
1254 -- 1287Sanjay Jain, Bakhadyr Khoussainov, Frank Stephan 0001, Dan Teng, Siyuan Zou. Semiautomatic Structures
1288 -- 1314Ludwig Staiger. Exact Constructive and Computable Dimensions
1315 -- 1336Bruno Bauwens, Alexander Shen, Hayato Takahashi. Conditional Probabilities and van Lambalgen's Theorem Revisited
1337 -- 1352Tom F. Sterkenburg. A Generalized Characterization of Algorithmic Probability
1353 -- 1375Laurent Bienvenu, Mathieu Hoyrup, Alexander Shen. Layerwise Computability and Image Randomness
1376 -- 1426Vasco Brattka, Matthew Hendtlass, Alexander P. Kreuzer. On the Uniform Computational Content of Computability Theory
1427 -- 1439Bjørn Kjos-Hanssen. On the Complexity of Automatic Complexity
1440 -- 1450Nikolai K. Vereshchagin. Short lists with short programs from programs of functions and strings