External Links

    Journal: J. Comput. Syst. Sci.

    Volume 25, Issue 3

    267 -- 284Jan A. Bergstra, J. V. Tucker. Expressiveness and the Completeness of Hoare s Logic
    285 -- 331Takumi Kasai, Raymond E. Miller. Homomorphisms between Models of Parallel Computation
    332 -- 359Christoph M. Hoffmann. Subcomplete Generalizations of Graph Isomorphism
    360 -- 376Wolfgang Thomas. Classifying Regular Events in Symbolic Logic
    377 -- 401Werner Kuich. An Algebraic Characterization of Some Principal Regulated Rational Cones
    402 -- 417Mordechai Ben-Ari, Joseph Y. Halpern, Amir Pnueli. Deterministic Propositional Dynamic Logic: Finite Models, Complexity, and Completeness
    418 -- 435Joost Engelfriet, Sven Skyum. The Copying Power of One-State Tree Transducers

    Volume 25, Issue 2

    130 -- 143Stephen R. Mahaney. Sparse Complete Sets of NP: Solution of a Conjecture of Berman and Hartmanis
    144 -- 170David Harel, Dexter Kozen, Rohit Parikh. Process Logic: Expressiveness, Decidability, Completeness
    171 -- 213Philippe Flajolet, Andrew M. Odlyzko. The Average Height of Binary Trees and Other Simple Trees
    214 -- 238Jon Louis Bentley, Donna J. Brown. A General Class of Resource Tradeoffs
    239 -- 266Gérard P. Huet, Jean-Marie Hullot. Proofs by Induction in Equational Theories with Constructors

    Volume 25, Issue 1

    2 -- 41Mihalis Yannakakis, Christos H. Papadimitriou. Algebraic Dependencies
    42 -- 65Eugene M. Luks. Isomorphism of Graphs of Bounded Valence can be Tested in Polynomial Time
    66 -- 75Michael O. Rabin. N-Process Mutual Exclusion with Bounded Waiting by 4 Log_2 N-Valued Shared Variable
    76 -- 98Neil Immerman. Upper and Lower Bounds for First Order Expressibility
    99 -- 128Ashok K. Chandra, David Harel. Structure and Complexity of Relational Queries
    runs on