Volume 29, Number 1, January/February 1996

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

Volume 29, Number 2, March/April 1996

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

Volume 29, Number 3, May/June 1996

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

Volume 29, Number 4, July/August 1996

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

Volume 29, Number 5, September/October 1996

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

Volume 29, Number 6, November/December 1996

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

last updated on Mon May 20 03:30:57 2013 by the dblp team
data released under the ODC-BY 1.0 license
see also our legal information page