External Links

    Journal: J. Comput. Syst. Sci.

    Volume 29, Issue 2

    133 -- 152W.-J. Hsu, M. W. Du. New Algorithms for the LCS Problem
    153 -- 159Antonio Restivo, Christophe Reutenauer. On Cancellation Properties of Languages which are Supports of Ration Power Series
    160 -- 170Albert R. Meyer, Jerzy Tiuryn. Equivalences among Logics of Programs
    171 -- 182Hiromi Miyajima, Masateru Harao, Shoichi Noguchi. Indecomposable Maps in Tessellation Structures of Arbitrary Dimension
    183 -- 197Yaacov Yesha. Time-Space Tradeoffs for Matrix Multiplication and the Discrete Fourier Transform on any General Sequential Random-Access Computer
    198 -- 206Sara Porat, Michael Yoeli. Towards a Hierarchy of Nets
    207 -- 224Shojiro Muro, Tiko Kameda, Toshimi Minoura. Multi-version Concurrency Control Scheme for a Database System
    225 -- 242Simeon C. Ntafos, Teofilo F. Gonzalez. On the Computational Complexity of Path Cover Problems
    243 -- 273John E. Savage. The Performance of Multilective VLSI Algorithms
    274 -- 301John H. Reif. The Complexity of Two-Player Games of Incomplete Information
    runs on