External Links

    Journal: Theory Comput. Syst.

    Volume 27, Issue 6

    511 -- 546K. Vijay-Shanker, David J. Weir. The Equivalence of Four Extensions of Context-Free Grammars
    547 -- 571Hagit Attiya, Marios Mavronicolas. Efficiency of Semisynchronous Versus

    Volume 27, Issue 5

    381 -- 430Robert F. Chamberlain, Charles M. Fiduccia. Universality of Iterated Networks
    431 -- 452Amotz Bar-Noy, Shlomo Kipnis. Designing Broadcasting Algorithms in the Postal Model for Message-Passing Systems
    453 -- 470Richard J. Anderson. Primitives for Asynchronous List Compression
    471 -- 489Christos Kaklamanis, Giuseppe Persiano. Branch-and-Bound and Backtrack Search on Mesh-Connected Arrays of Processors
    491 -- 508C. Greg Plaxton, Torsten Suel. A Lower Bound for Sorting Networks Based on the Shuffle Permutation

    Volume 27, Issue 4

    285 -- 346Helmut Seidl. Equivalence of Finite-Valued Tree Transducers Is Decidable
    347 -- 356Montserrat Hermo, Elvira Mayordomo. A Note on Polynomial-Size Circuits with Low Resource-Bounded Kolmogorov Complexity
    357 -- 363Alain Hertz. A New Polynomial-Time Algorithm for the Maximum Weighted (/chi(G) - 1)-Coloring Problem in Comparability Graphs
    365 -- 376Ming Li, Paul M. B. Vitányi. Statistical Properties of Finite Sequences with High Kolmogorov Complexity

    Volume 27, Issue 3

    189 -- 200Mitsunori Ogiwara. Generalized Theorems on Relationships Among Reducibility Notions to Certain Complexity Classes
    201 -- 209Ronald V. Book, Jack H. Lutz, Klaus W. Wagner. An Observation on Probability Versus Randomness with Applications to Complexity Classes
    211 -- 229Osamu Watanabe. A Framework for Polynomial-Time Query Learnability
    231 -- 256Osamu Watanabe, Ricard Gavaldà. Structural Analysis of Polynomial-Time Query Learnability
    257 -- 273Dieter Kratsch, Lane A. Hemaspaandra. On the Complexity of Graph Reconstruction
    275 -- 282Daniel Berend, Christiane Frougny. Computability by Finite Automata and Pisot Bases

    Volume 27, Issue 2

    105 -- 124Gudmund Skovbjerg Frandsen, Mark Valence, David A. Mix Barrington. Some Results on Uniform Arithmetic Circuit Complexity
    125 -- 157Iain A. Stewart. On Completeness for NP via Projection Translations
    159 -- 181Andrzej Ehrenfeucht, Grzegorz Rozenberg, Kai Salomaa. Semantics of Trees
    183 -- 186Bin Fu, Hong-Zhou Li, Yong Zhong. An Application of the Translational Method

    Volume 27, Issue 1

    3 -- 28Shimon Even, Ami Litman. On the Capabilities of Systolic Systems
    29 -- 40Geng Lin, Nicholas Pippenger. Parallel Algorithms for Routing in Nonblocking Networks
    41 -- 63Bojana Obrenic. An Approach To Emulating Separable Graphs
    65 -- 84Marios C. Papaefthymiou. Understanding Retiming Through Maximum Avarage-Delay Cycles
    85 -- 101Abhiram G. Ranade. Optimal Speedup for Backtrack Search on a Butterfly Network
    runs on