External Links

    Journal: Theory Comput. Syst.

    Volume 26, Issue 4

    313 -- 326Jonathan Goldstine, John K. Price, Detlef Wotschke. On Reducing the Number of Stack Symbols in a PDA
    327 -- 341Laura A. Sanchis. On the Effective Generation of Set Elements Within Specified Ranges
    343 -- 356Fabrizio Luccio, Linda Pagli. A Model of Sequential Computation with Pipelines Access to Memory
    357 -- 378Hsu-Chun Yen, Namhee Pak. Complexity Analysis of Propositional Concurrent Programs Using Domino Tiling
    379 -- 395Chandra M. R. Kintala, Kong-Yee Pun, Detlef Wotschke. Concise Representations of Regular Languages by Degree and Probabilistic Finite Automata

    Volume 26, Issue 3

    237 -- 269Jean-Camille Birget. State-Complexity of Finite-State Devices, State Compressibility and Incompressibility
    271 -- 291Fred S. Annexstein, Marc Baumslag. On the Diameter and Bisector Size of Cayley Graphs
    271 -- 291Fred S. Annexstein, Marc Baumslag. On the Diameter and Bisector Size of Cayley Graphs
    293 -- 310Richard Beigel, Richard Chang, Mitsunori Ogiwara. A Relationship Between Difference Hierarchies and Relativized Polynomial Hierarchies

    Volume 26, Issue 2

    157 -- 167Haiko Müller. A Note on Balanced Immunity
    169 -- 185Andreas Weber. Distance Automata Having Large Finite Distance or Finite Ambiguity
    187 -- 202Bin Fu. On Lower Bounds of the Closeness Between Complexity Classes
    203 -- 214Osamu Watanabe, Seinosuke Toda. Structural Analysis of the Complexity of Inverse Functions
    215 -- 233Frederic Green. On the Power of Deterministic Reductions to C=P

    Volume 26, Issue 1

    3 -- 19Piotr Berman, Juan A. Garay. Cloture Votes: n/4-Resilient Distributed Consensus in t+1 Rounds
    21 -- 39Amotz Bar-Noy, Danny Dolev. A Partial Equivalence Between Shared-Memory and Message-Passing in an Asynchronous Fail-Stop Distributed Environment
    41 -- 102Vassos Hadzilacos, Joseph Y. Halpern. Message-Optimal Protocols for Byzantine Agreement
    103 -- 129Vassos Hadzilacos, Joseph Y. Halpern. The Failure Discovery Problem
    131 -- 154Brian A. Coan, Jennifer L. Welch. Modular Cosntruction of an Efficient 1-Bit Byzantine Agreement Protocol
    runs on