External Links

    Journal: Theory Comput. Syst.

    Volume 25, Issue 4

    241 -- 251Friedrich Otto. The Problem of Deciding Confluence on a Given Congruence Class is Tractable for Finite Special String-Rewriting Systems
    253 -- 267Andrew Gleason. Semigroups of Shift Register Counting Matrices
    269 -- 292Ruey-Der Lou, Majid Sarrafzadeh, Chong S. Rim, Kazuo Nakajima, Sumio Masuda. General Circular Permutation Layout
    293 -- 308Michael C. Loui, David R. Luginbuhl. The Complexity of On-Line Simulations Between Multidimensional Turing Machines and Random Access Machines
    309 -- 313Siegfried Lehr. A Result About Languages Concerning Paperfolding Sequences

    Volume 25, Issue 3

    161 -- 175Raymond Greenlaw. The Parallel Complexity of Approximation Algorithms for the Maximum Acyclic Subgraph Problem
    177 -- 201Tomoyuki Yamakami. Structural Properties for Feasibly Computable Classes of Type Two
    203 -- 221Alan L. Selman. A Survey of One-Way Functions in Complexity Theory
    223 -- 237Gerhard Buntrock, Carsten Damm, Ulrich Hertrampf, Christoph Meinel. Structure and Importance of Logspace-MOD Class

    Volume 25, Issue 2

    77 -- 92Peter Clote. A Time-Space Hierarchy Between Polynomial Time and Polynomial Space
    93 -- 122Ravi Janardan, Siu-Wing Cheng. Efficient Distributed Algorithms for Single-Source Shortest Paths and Related Problems on Plane Networks
    123 -- 140Evangelos Kranakis, Paul M. B. Vitányi. A Note on Weighted Distributed Match-Making
    141 -- 159Sandy Irani, Moni Naor, Ronitt Rubinfeld. On the Time and Space Complexity of Computation Using Write-Once Memory Or Is Pen Really Much Worse Than Pencil?

    Volume 25, Issue 1

    3 -- 22Ulrich Huckenbeck. Constructing Sets of Functions Which Have a Given F-Cardinality
    23 -- 36David Eppstein, Lane A. Hemachandra, James Tisdall, Bülent Yener. Simultaneous Strong Separations of Probabilistic and Unambiguous Complexity Classes
    37 -- 60Christiane Frougny. Representations of Numbers and Finite Automata
    61 -- 74Jean-Michel Autebert, Luc Boasson. The Equivalence of pre-NTS Grammars is Decidable
    runs on