Mathematical Systems Theory, Volume 25

Volume 25, Number 1, 1992

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

Volume 25, Number 2, 1992

• Peter Clote: A Time-Space Hierarchy Between Polynomial Time and Polynomial Space. 77-92 BibTeX
• Ravi Janardan, Siu-Wing Cheng: Efficient Distributed Algorithms for Single-Source Shortest Paths and Related Problems on Plane Networks. 93-122 BibTeX
• Evangelos Kranakis, Paul M. B. Vitányi: A Note on Weighted Distributed Match-Making. 123-140 BibTeX
• Sandy 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? 141-159 BibTeX

Volume 25, Number 3, 1992

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

Volume 25, Number 4, 1992

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