Mathematical Systems Theory, Volume 29

Volume 29, Number 1, January/February 1996

Catherine C. McGeoch: Experimental Studies of Algorithms. 3-4 BibTeX
S. Jesi, Giovanni Pighizzini, Nicoletta Sabadini: Probabilistic Asynchronous Automata. 5-31 BibTeX
Johannes Köbler, Seinosuke Toda: On the Power of Generalized MOD-Classes. 33-46 BibTeX
Jarkko Kari: Representation of Reversible Cellular Automata with Block Permutations. 47-61 BibTeX
Vikraman Arvind, Johannes Köbler, Martin Mundhenk: Upper Bounds for the Complexity of Sparse and Tally Descriptions. 63-94 BibTeX

Christos H. Papadimitriou, Martha Sideri: The Bisection Width of Grid Graphs. 97-110 BibTeX
Kieran T. Herley: Representing Shared Data in Distributed-Memory Parallel Computers. 111-156 BibTeX
Spyros Tragoudas: Improved Approximations for the Minimum-Cut Ratio and the Flux. 157-167 BibTeX
Giora Slutzki, Sándor Vágvölgyi: A Hierarchy of Deterministic Top-Down Tree Transformations. 169-188 BibTeX

Jean-Camille Birget: Two-Way Automata and Length-Preserving Homomorphisms. 191-226 BibTeX
Wolfgang Golubski, Wolfram-Manfred Lippe: Tree-Stack Automata. 227-244 BibTeX
Jin-yi Cai, Frederic Green, Thomas Thierauf: On the Correlation of Symmetric Functions. 245-258 BibTeX
Takashi Yokomori: Learning Two-Tape Automata from Queries and Counterexamples. 259-270 BibTeX
Vladimir A. Uspensky, A. Shen: Relations Between Varieties of Kolmogorov Complexities. 271-292 BibTeX
Luis B. Morales, John S. Lew: An Enlarged Family of Packing Polynomials on Multidemensional Lattices. 293-303 BibTeX
John S. Lew, Luis B. Morales, A. Sánchez-Flores: Diagonal Polynomials for Small Dimensions. 305-310 BibTeX

Fillia Makedon, Antonios Symvonis: Flit-Serial Packet Routing on Meshes and Tori. 311-330 BibTeX
Masafumi Yamashita, Tiko Kameda: Computing Functions on Asynchronous Anonymous Networks. 331-356 BibTeX , Erratum: Theory of Computing System 31(1): 109 (1998)
Jaikumar Radhakrishnan: Pi-Sigma-Pi Threshold Formulas. 357-374 BibTeX
Amir M. Ben-Amram, Bryant A. Julstrom, Uri Zwick: A Note on Busy Beavers and Other Creatures. 375-386 BibTeX
Tao Jiang, Ming Li: DNA Sequencing and String Learning. 387-405 BibTeX
Yahya Ould Hamidoune, Oriol Serra: On Small Cuts Separating an Abelian Cayley Graph into Two Equal Parts. 407-409 BibTeX
Ulrich Hertrampf, Heribert Vollmer, Klaus W. Wagner: On Balanced Versus Unbalanced Computation Trees. 411-421 BibTeX

Ming-Jye Sheu, Timothy J. Long: UP and the Low and High Hierarchies: A Relativized Separatin. 423-449 BibTeX
Jonathan L. Gross, Jianer Chen: Algebraic Specification of Interconnection Network Relationships by Permutation Voltage Graph Mappings. 451-470 BibTeX
Rainer Feldmann, Peter Mysliwietz: The Shuffle Exchange Network has a Hamiltonian Path. 471-485 BibTeX
Manindra Agrawal, Somenath Biswas: NP-Creative Sets: A New Class of Creative Sets in NP. 487-505 BibTeX
G. Dányi, Zoltán Fülöp: Superlinear Deterministic Top-Down Tree Transducers. 507-534 BibTeX
Lane A. Hemaspaandra, Marius Zimand: Strong Self-Reducibility Precludes Strong Immunity. 535-548 BibTeX

Zevi Miller, Dan Pritikin, Ivan Hal Sudborough: Bounded Dilation Maps of Hypercubes into Cayley Graphs on the Symmetric Group. 551-572 BibTeX
Jin-yi Cai, Zicheng Liu: The Bounded Membership Problem of the Monoid SL_2(N). 573-587 BibTeX
Simon R. Blackburn: Node Bisectors of Cayley Graphs. 589-598 BibTeX
Steffen Lange, Thomas Zeugmann: Set-Driven and Rearrangement-Independent Learning of Recursive Languages. 599-634 BibTeX
Felipe Cucker, Martín Matamala: On Digital Nondeterminism. 635-647 BibTeX
Christoph Meinel, Stephan Waack: Lower Bounds for the Majority Communication Complexity of Various Graph Accessibility Problems. 649-659 BibTeX
Sanjay Gupta: Alternating Time Versus Deterministic Time: A Separation. 661-672 BibTeX