External Links

    Journal: Theory Comput. Syst.

    Volume 49, Issue 4

    671 -- 0Michael A. Bender, Seth Gilbert. Guest Editorial: Parallelism in Algorithms and Architectures
    672 -- 697Patrik Floréen, Marja Hassinen, Joel Kaasinen, Petteri Kaski, Topi Musto, Jukka Suomela. Local Approximability of Max-Min and Min-Max Linear Programs
    698 -- 719Hagit Attiya, Eshcar Hillel, Alessia Milani. Inherent Limitations on Disjoint-Access Parallel Implementations of Transactional Memory
    720 -- 737Aviv Nisgav, Boaz Patt-Shamir. Finding Similar Users in Social Networks
    738 -- 756Yossi Azar, Uriel Feige, Iftah Gamzu, Thomas Moscibroda, Prasad Raghavendra. Buffer Management for Colored Packets with Deadlines
    757 -- 780MohammadHossein Bateni, Lukasz Golab, MohammadTaghi Hajiaghayi, Howard J. Karloff. Scheduling to Minimize Staleness and Stretch in Real-Time Data Warehouses
    781 -- 816Fabian Kuhn, Thomas Locher, Rotem Oshman. Gradient Clock Synchronization in Dynamic Networks
    817 -- 833Ho-Leung Chan, Jeff Edmonds, Kirk Pruhs. Speed Scaling of Processes with Arbitrary Speedup Curves on a Multiprocessor
    834 -- 856Harald Räcke, Adi Rosén. Approximation Algorithms for Time-Constrained Scheduling on Line Networks

    Volume 49, Issue 3

    565 -- 575Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer. Area, Curve Complexity, and Crossing Resolution of Non-Planar Graph Drawings
    576 -- 587Maw-Shang Chang, Chuang-Chieh Lin, Peter Rossmanith. A Property Tester for Tree-Likeness of Quartet Topologies
    588 -- 600Chien-Hung Lin, Jia Jie Liu, Yue-Li Wang, William Chung-Kung Yen. The Hub Number of Sierpiński-Like Graphs
    601 -- 614Ryan C. Harkins, John M. Hitchcock. Dimension, Halfspaces, and the Density of Hard Sets
    615 -- 631Davide Bilò, Luca Forlizzi, Guido Proietti. Approximating the Metric TSP in Linear Time
    632 -- 638Akitoshi Kawamura. Generalized Semimagic Squares for Digital Halftoning
    639 -- 670Marcelo Arenas, Pablo Barceló, Leonid Libkin. Regular Languages of Nested Words: Fixed Points, Automata, and Synchronization

    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

    Volume 49, Issue 1

    1 -- 2Marios Mavronicolas. Preface: Algorithmic Game Theory
    3 -- 23Johanne Cohen, Christoph Dürr, Nguyen Kim Thang. Non-clairvoyant Scheduling Games
    24 -- 45Vittorio Bilò, Angelo Fanelli, Michele Flammini, Luca Moscardelli. Performance of One-Round Walks in Linear Congestion Games
    46 -- 70Tobias Harks, Max Klimm, Rolf H. Möhring. Characterizing the Existence of Potential Functions in Weighted Congestion Games
    71 -- 97Ronald Koch, Martin Skutella. Nash Equilibria and the Price of Anarchy for Flows over Time
    98 -- 138Elliot Anshelevich, Bugra Caskurlu. Price of Stability in Survivable Network Design
    139 -- 161Felix Brandt, Markus Brill, Felix A. Fischer, Jan Hoffmann 0002. The Computational Complexity of Weak Saddles
    162 -- 181Felix Brandt, Markus Brill, Felix A. Fischer, Paul Harrenstein. On the Complexity of Iterated Weak Dominance in Constant-Sum Games
    182 -- 195Hyunwoo Jung, Kyung-Yong Chwa. The Balloon Popping Problem Revisited: Lower and Upper Bounds
    196 -- 223Clemens Thielen, Sven Oliver Krumke. Truthful Mechanisms for Selfish Routing and Two-Parameter Agents
    runs on