4. Parcella 1988: Berlin, GDR

@proceedings{DBLP:conf/parcella/1988,
  editor    = {Gottfried Wolf and
               Tam{\'a}s Legendi and
               Udo Schendel},
  title     = {Parcella '88, Fourth International Workshop on Parallel Processing
               by Cellular Automata and Arrays, Berlin, GDR, October 17-21,
               1988, Proceedings},
  booktitle = {Parcella},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {342},
  year      = {1989},
  isbn      = {3-540-50647-0},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Invited Papers

• Wolfgang Händler: Multiprocessor arrays: Topology, efficiency and fault-tolerance. 15-32
• Victor Aladyev, Aida Krasnoproshina, Vladimir Kryschanovskii: Unsolved theoretical problems in homogeneous structures. 33-49
• Andreas Alexander Albrecht: On simulaneous realizations of Boolean functions, with applications. 51-56
• Olga L. Bandman, S. V. Piskunov: Parallel microprogramming as a tool for multi-microprocessor systems. 57-72
• Frank K. H. A. Dehne, Jörg-Rüdiger Sack: A survey of paralle computational geometry algorithms. 73-88
• Michael Gössel, V. V. Kaversnev, Burghard Rebel: Parallel memories for straight line and rectangle access. 89-109
• Chris R. Jesshope, Philip Miller, Jelio Yantchev: Programming with active data. 111-129
• Péter Kacsuk: Prolog implementations for cellular architectures. 131-146
• Vadim E. Kotov: Modular highly-parallel computation and architectures. 147-155
• U. Schendel: Parallel computation and supercomputers and applications. 157-176
• Paul G. Spirakis: Fast parallel algorithms and the complexity of parallelism (Basic issues and recent advances). 177-189
• Leonard Uhr: Process-structured architectures to transform information flowing through. 191-203
• Roland Vollmar: Basic research for cellular processing. 205-222
• Wolfgang Wilhelmi: Parallel algorithms in image processing. 223-238

Submitted Papers

• Valeriu Beiu: VLSI arrays implementing parallel line-drawing algorithms. 241-247
• Reiner Creutzburg: Parallel conflict-free optimal access to complete extended q-ary trees. 248-255
• David J. Evans, Graham M. Megson: Systolic preconditioning algorithms for the Jacobi iterative solution of sparse linear systems. 256-265
• Gerhard Fritsch, Jens Volkert: Multiprocessor systems for large numerical applications. 266-273
• Michael A. Frumkin: Systolic array for eigenvalue of Jacobi matrix. 274-284
• Endre Katona: A transitive closure algorithm for a 16-state cellprocessor. 285-290
• Edgar Körner, M. Gross, Andreas Richter, H. Shimizu: Control of sensory processing - a hypothesis on and simulation of the architecture of an elementary cortical prosessor. 291-297
• Manfred Kunde: Bounds for 1-selection and related problem on grids of processors. 298-307
• Christoph Meinel, Peter Zienicke: Recursive design of communication schemes for parallel computation with RELACS. 308-310
• Kálmán Palágyi: Solution of dense systems of linear equations using cellular processors. 311-316
• Nikolay Petkov: Running order statistics on a bit-level systolic array. 317-325
• Reinhard Pöschel, F. Wächter, Ferdinand Börner: Realization of sets of permutations by permutation networks. 326-331
• Thorsten Pöschel, Werner Ebeling, Thorsten Boseniuk: Simulation of learning networks. 332-339
• Hartmut Schmeck, Andreas Dittrich: Given's rotation on an instruction systolic array. 340-346
• Thomas Tensi: Worst case analysis for reducing algorithms on instruction systolic arrays with simple instruction sets. 347-352
• Nandor Toth: Self-checking processing elements in cellular arrays. 353-359
• Roman Trobec: Cellular diagnostic in parallel systems. 360-365
• Dietmar Uhlig: Reliable networks for Boolean functions with small complexity. 366-371
• Karl-Heinz Zimmermann: Pipeline-automata - a model for acyclic systolic systems. 372-379