Mathematical Systems Theory, Volume 26

Volume 26, Number 1, 1993

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

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

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

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