Elektronische Informationsverarbeitung und Kybernetik, Band 26

Volume 26, Number 1/2, January / February 1990

• Juraj Procházka: Systolic Systems for Polynomial GCD Computation. 5-18
• Magnus Steinby: A Formal Theory of Errors in Tree Representations of Patterns. 19-32
• Hans-Dieter Ehrich, Amílcar Sernadas, Cristina Sernadas: From Data Types to Object Types. 33-48
• Erzsébet Csuhaj-Varjú, Jürgen Dassow: On Cooperating/Distributed Grammar Systems. 49-63
• Mathias Bull, Armin Hemmerling: Finite Embedded Trees and Simply Connected Mazes cannot be Searched by Halting Finite Automata. 65-73
• Jürgen Lampe: Local Parse - A Base for Realistic Parallelisation of Compilers. 75-84
• Bernd Reichel: Some Classifications of Indian Parallel Languages. 85-99
• Lutz Voelkel: Graphs and Automata in the Theory of Signature Analysis. 101-117

Volume 26, Number 3, March 1990

• Erkki Mäkinen: On Breadth-first Context-free Grammars. 129-135
• Jovisa D. Zunic: Approximate Convex Hull Algorithm - Efficiency Evaluations. 137-148
• Jean-Louis Krivine, Michel Parigot: Programming with Proofs. 149-167
• Djamil Sarni: Lambda-Calculus on Occurrence The Theory and its Combinatorial Counterpart. 169-187

Volume 26, Number 4, April 1990

• Marisa Venturini Zilli: Net Algebras on Process Algebras. 201-212
• Masami Ito, Huei-Jan Shyr: p-Languages and p-Representations. 213-228
• Dietmar Wätjen: On k-uniformly-limited T0L Systems and Languages. 229-238
• Dietmar Schweigert: Clone Homomorphisms and Reductions. 239-247
• Peter Schatte: On the Stochastic Behaviour of the Floating Point Mantissas of Sums. 249-254

Volume 26, Number 5/6, May / June 1990

• Stephan Waack: The Parallel Complexity of Some Constructions in Combinatorial Group Theory. 265-281
• Dietmar Wätjen, Erwin Unruh: On Extended k-uniformly-limited T0L Systems and Languages. 283-299
• Lothar Budach, Ernst-Günter Giessmann, Hubert Grassmann, Bernd Graw, Christoph Meinel, Burkhard Molzan, Uwe Schäfer, Steffen Zahn, Peter Zienicke: RELACS - a Recursive Layout Computing System. 315-335
• Walter Issel, Thomas Fischer: NBSF - eine Sprache zur strukturellen Beschreibung von Schaltkreisen. 337-357

Volume 26, Number 7, July 1990

• Manfred Koebe, Jens Knöchel: On the Block Alignment Problem. 377-387
• Christoph Meinel, Lothar Budach, Frank Balfanz, Steffen Zahn, Peter Zienicke: Entwurfserfahrungen mit dem rekursiven Layoutentwurfssystem RELACS; I. 389-414
• Martin Sonntag: Hamiltonicity of the Normal Product of Hypergraphs. 415-433

Volume 26, Number 8/9, August / September 1990

• Eberhard Bertsch: Preservation of LL- and LR-properties in Flattened Grammars. 443-450
• André Arnold, Damian Niwinski: Fixed Point Characterization of Büchi Automata on Infinite Trees. 451-459
• Elisabeth Pelz: Logic Versus Sequential and Concurrent Net Behaviour. 461-472
• Uwe Jansen: An Efficient Way of Calculating the Distribution Function Density, and Moments of Phase Type Distributions. 473-484
• Christoph Meinel, Lothar Budach, Frank Balfanz, Steffen Zahn, Peter Zienicke: Entwurfserfahrungen mit dem rekursiven Layoutentwurfssystem RELACS; II. 501-515

Volume 26, Number 10, October 1990

• Elena Stöhr: Optimal Book Embeddings of Depth-k K_n-cylinders. 525-536
• Bernhard Goetze, Eduard N. Gordejev, Werner Nehrlich, Dimitri W. Kochetkov: Maximal Empty Boxes in Higher-dimensional Spaces. 537-545
• Bernd Becker, Joachim Hartmann: Optimal-Time Multipliers and C-Testability. 547-561
• Helmut Jürgensen, S. S. Yu: Solid Codes. 563-574

Volume 26, Number 11/12, November / Dezember 1990

• Reiner Kolla: Minimal Area Sizing of Power Supply Nets in VLSI Circuits. 585-605
• Ulrike Baumann, Manfred Lesch: Equivalent Colourings and Partitions of Graphs. 607-614
• Michael Löwe: Implementing Algebraic Specifications by Graph Transformation Systems. 615-641
• Gabriele Steidl: Existence and Construction of Self-complementary Normal Bases. 643-651