Mathematical Systems Theory, Volume 28

Volume 28, January/February 1995

• Prabhakar Raghavan: Robust Algorithms for Packet Routing in a Mesh. 1-11 BibTeX
• Josep Rifà, Joan Borrell: A Fast Algorithm To Compute Irreducible and Primitive Polynomials in Finite Fields. 13-20 BibTeX
• Christoph Meinel, Stephan Waack: Separating Complexity Classes Related to Bounded Alternating \omega-Branching Programs. 21-39 BibTeX
• Igor Litovsky, Yves Métivier, Eric Sopena: Different Local Controls for Graph Relabeling Systems. 41-65 BibTeX
• Hubert Comon: On Unification of Terms with Integer Exponents. 67-88 BibTeX

Volume 28, Number 2, March/April 1995

• Alberto Apostolico, Maxime Crochemore: Fast Parallel Lyndon Factorization with Applications. 89-108 BibTeX
• Jie Wang: Productive Functions and Isomorphisms. 109-116 BibTeX
• Carme Àlvarez, José L. Balcázar, Birgit Jenner: Adaptive Logspace Reducibility and Parallel Time. 117-140 BibTeX
• Jyrki Kivinen: Learning Reliably and with One-Sided Error. 141-172 BibTeX

Volume 28, Number 3, May/June 1995

• Richard Chang, Jim Kadin: On Computing Boolean Connectives of Characteristic Functions. 173-198 BibTeX
• Michael A. Palis, Sunil M. Shende: Pumping Lemmas for the Control Language Hierarchy. 199-213 BibTeX
• Jeff I. Chu, Georg Schnitger: Communication Complexity of Matrix Computation over Finite Fields. 215-228 BibTeX
• Kenneth W. Regan, James S. Royer: On Closure Properties of Bounded Two-Sided Error Complexity Classes. 229-243 BibTeX
• Emanuela Fachini, Jozef Gruska, Margherita Napoli, Domenico Parente: Power of Interconnections and of Nondeterminism in Regular Y-Tree Systolic Automata. 245-266 BibTeX
• Sanjay Jain, Arun Sharma: Prudence in Vacillatory Language Identification. 267-279 BibTeX

Volume 28, Number 4, July/August 1995

• Frederic Green: A Lower Bound for Monotone Perceptrons. 283-298 BibTeX
• Timothy J. Long, Ming-Jye Sheu: A Refinement of the Low and High Hierarchies. 299-327 BibTeX
• Maciej Liskiewicz: On the Power of 1-Tape Off-Line ATMs Running in a Bounded Number of Reversals. 329-339 BibTeX
• Celia Wrathall, Volker Diekert: On Confluence of One-Rule Trace-Rewriting Systems. 341-361 BibTeX
• Friedrich Otto: On Confluence Versus Strong Confluence for One-Rule Trace-Rewriting Systems. 363-384 BibTeX

Volume 28, Number 5, September/October 1995

• Franz Aurenhammer, Johann Hagauer: Recognizing Binary Hamming Graphs in O(n² log n) Time. 387-395 BibTeX
• Christian Choffrut, Leucio Guerra: Logical Definability of Some Rational Trace Languages. 397-420 BibTeX
• Shimon Even, Sergio Rajsbaum: Unison, Canon, and Sluggish Clocks in Networks Controlled by a Synchronizer. 421-435 BibTeX
• Christian Choffrut, Massimiliano Goldwurm: Rational Transductions and Complexity of Counting Problems. 437-450 BibTeX
• Jeffery Westbrook, Dicky C. K. Yan: The Performance of Greedy Algorithms for the On-Line Steiner Tree and Related Problems. 451-468 BibTeX
• Amos Israeli, Amnon Shaham, Asaf Shirazi: Linear-Time Snapshot Implementations in Unbalanced Systems. 469-486 BibTeX

Volume 28, Number 6, November/December 1995

• William I. Gasarch, Mark W. Krentel, Kevin J. Rappoport: OptP as the Normal Behavior of NP-Complete Problems. 487-514 BibTeX
• Bruno Courcelle, Joost Engelfriet: A Logical Characterization of the Sets of Hypergraphs Defined by Hyperedge Replacement Grammars. 515-552 BibTeX
• Matthias Krause, Stephan Waack: Variation Ranks of Communication Matrices and Lower Bounds for Depth-Two Circuits Having Nearly Symmetric Gates with Unbounded Fan-In. 553-564 BibTeX