External Links

    Journal: J. Comput. Syst. Sci.

    Volume 35, Issue 3

    269 -- 284Michael L. Fredman, Thomas H. Spencer. Refined Complexity Analysis for Heap Operations
    285 -- 310Friedrich Otto. On Deciding the Confluence of a Finite String-Rewriting System on a Given Congruence Class
    311 -- 320Joffroy Beauquier, Meera Blattner, Michel Latteux. On Commutative Context-Free Languages
    321 -- 364Nicole Bidoit. The Verso Algebra or How to Answer Queries with Fewer Joins
    365 -- 400David B. Benson, Irène Guessarian. Algebraic Solutions to Recursion Schemes

    Volume 35, Issue 2

    145 -- 152Seinosuke Toda. Sigma_2 SPACE(n) is Closed under Complement
    153 -- 162László Babai, Péter Hajnal, Endre Szemerédi, György Turán. A Lower Bound for Read-Once-Only Branching Programs
    163 -- 191Gheorghe Stefanescu. On Flowchart Theories. I. The Deterministic Case
    192 -- 205Michael G. Main, Grzegorz Rozenberg. Handle NLC Grammars and R.E. Languages
    206 -- 228Józef Winkowski, Andrea Maggiolo-Schettini. An Algebra of Processes
    229 -- 242Vera Trnková, Jan Reiterman. Dynamic Algebras with Test
    243 -- 267Jean-Michel Autebert, Luc Boasson, Géraud Sénizergues. Groups and NTS Languages

    Volume 35, Issue 1

    1 -- 22Joachim Biskup, Renate Meyer. Design of Relational Database Schemes by Deleting Attributes in the Canonical Decomposition
    23 -- 58David Peleg. Communication in Concurrent Dynamic Logic
    59 -- 71Robert P. Kurshan. Complementing Deterministic Büchi Automata in Polynomial Time
    72 -- 95Francesco Parisi-Presicce. Union and Actualization of Module Specifications: Some Compatibility Results
    96 -- 144Toshimasa Watanabe, Akira Nakamura. Edge-Connectivity Augmentation Problems
    runs on