External Links

    Journal: Theory Comput. Syst.

    Volume 37, Issue 6

    639 -- 640Georg Gottlob, Miki Hermann, Michaël Rusinowitch. 2nd International Workshop on Complexity in Automated Deduction (CiAD) - Foreword
    641 -- 674Achim Blumensath, Erich Grädel. Finite Presentations of Infinite Structures: Automata and Interpretations
    675 -- 694Dietmar Berwanger, Erich Grädel. Fixed-Point Logics and Solitaire Games
    695 -- 715Lefteris M. Kirousis, Phokion G. Kolaitis. A Dichotomy in the Complexity of Propositional Circumscription
    717 -- 740Manfred Schmidt-Schauß, Jürgen Stuber. The Complexity of Linear and Stratified Context Matching Problems

    Volume 37, Issue 5

    559 -- 584Dominique Barth, Pascal Berthomé. Periodic Gossiping in Commuted Networks
    585 -- 607Danny Krizanc, Flaminia L. Luccio, Rajeev Raman. Compact Routing Schemes for Dynamic Ring Networks
    609 -- 638Keijo Ruohonen. Chomskian Hierarchies of Families of Sets of Piecewise Continuous Functions

    Volume 37, Issue 4

    481 -- 0Arnold L. Rosenberg. Obituary: Shimon Even
    483 -- 502Marie-Pierre Béal, Olivier Carton. Determinization of Transducers over Infinite Words: The General Case
    503 -- 518Kohei Hatano. A Simple Boosting Algorithm Using Multi-Way Branching Decision Trees
    519 -- 525Serge Burckel, Marianne Morillon. Quadratic Sequential Computations of Boolean Mappings
    527 -- 546Ka Wong Chong, Stavros D. Nikolopoulos, Leonidas Palios. An Optimal Parallel Co-Connectivity Algorithm
    547 -- 556Wei-Mei Chen, Gen-Huey Chen, D. Frank Hsu. Generalized Diameters of the Mesh of Trees

    Volume 37, Issue 3

    321 -- 0Pilar de la Torre, Michael Mitzenmacher, Rajmohan Rajaraman, Berthold Vöcking. Foreword
    323 -- 341Chiu-Yuen Koo, Tak Wah Lam, Tsuen-Wan Ngan, Kar-Keung To. Extra Processors versus Future Information in Optimal Deadline Scheduling
    343 -- 370Friedhelm Meyer auf der Heide, Christian Schindelhauer, Klaus Volbert, Matthias Grünewald. Congestion, Dilation, and Energy in Radio Networks
    371 -- 396Costas Busch. Õ(Congestion + Dilation) Hot-Potato Routing on Leveled Networks
    397 -- 403Enoch Peserico. The Lazy Adversary Conjecture Fails
    405 -- 440Kirsten Hildrum, John D. Kubiatowicz, Satish Rao, Ben Y. Zhao. Distributed Object Location in a Dynamic Network
    441 -- 456Stephen Alstrup, Cyril Gavoille, Haim Kaplan, Theis Rauhe. Nearest Common Ancestors: A Survey and a New Algorithm for a Distributed Environment
    457 -- 478Phillip B. Gibbons, Srikanta Tirthapura. Distributed Streams Algorithms for Sliding Windows

    Volume 37, Issue 2

    249 -- 293Emmanuel Godard, Yves Métivier, Anca Muscholl. Characterizations of Classes of Graphs Recognizable by Local Computations
    295 -- 318Marc Snir. A Note on N-Body Computations with Cutoffs

    Volume 37, Issue 1

    3 -- 27Achim Blumensath. Axiomatising Tree-Interpretable Structures
    29 -- 47Shin Aida, Marcel Crâsmaru, Kenneth W. Regan, Osamu Watanabe. Games with Uniqueness Properties
    49 -- 75Amos Korman, David Peleg, Yoav Rodeh. Labeling Schemes for Dynamic Tree Networks
    77 -- 94Hans-Ulrich Simon. How Many Missing Answers Can Be Tolerated by Query Learners?
    95 -- 109Till Tantau. Comparing Verboseness for Finite Automata and Turing Machines
    111 -- 131Denis Thérien, Thomas Wilke. Nesting Until and Since in Linear Temporal Logic
    133 -- 156Volker Diekert, Markus Lohrey. Existential and Positive Theories of Equations in Graph Products
    157 -- 191Markus Frick. Generalized Model-Checking over Locally Tree-Decomposable Classes
    193 -- 220Martin Grohe, György Turán. Learnability and Definability in Trees and Similar Structures
    221 -- 246Hartmut Klauck. Quantum and Approximate Privacy
    runs on