Parallel Algorithms and Architectures 1987: Suhl, GDR

Andreas Alexander Albrecht, Hermann Jung, Kurt Mehlhorn (Eds.): Parallel Algorithms and Architectures, International Workshop, Suhl, GDR, May 25-30, 1987, Proceedings. Lecture Notes in Computer Science 269 Springer 1987, ISBN 3-540-18099-0

@proceedings{DBLP:conf/paa/1987,
  editor    = {Andreas Alexander Albrecht and
               Hermann Jung and
               Kurt Mehlhorn},
  title     = {Parallel Algorithms and Architectures, International Workshop,
               Suhl, GDR, May 25-30, 1987, Proceedings},
  booktitle = {Parallel Algorithms and Architectures},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {269},
  year      = {1987},
  isbn      = {3-540-18099-0},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Invited Papers

Helmut Alt, Torben Hagerup, Kurt Mehlhorn, Franco P. Preparata: Deterministic Simulation of Idealized Parallel Computers on more Realistic Ones. 11-15
Rex A. Dwyer, Ravi Kannan: Convex Hull of Randomly Chosen Points from A Polytope. 16-24
Jayantha A. Herath, Toshitsugu Yuba, Nobuo Saito: Dataflow Computing. 25-36
Edgar Körner, T. Tsuda, H. Shimizu: Parallel in Sequence - Towards the Architecture of an Elementary Cortical Processor. 37-47
Nikolay N. Mirenkov: Parallel Algorithms and Static Analysis of Parallel Programs. 48-59
Burkhard Monien, Oliver Vornberger: Parallel Processing of Combinatorial Search. 60-69

Communications

Alberto Apostolico, Costas S. Iliopoulos, Robert Paige: On O(n log n) Cost Parallel Algorithm for the Single Function Coarsest Partition Problem. 70-76
Tetsuo Asano, Hiroshi Umeo: Systolic Algorithms for Computing the Visibility Polygon and Triangulation of A Polygonal Region. 77-85
Lothar Budach, Ernst-Günter Giessmann, Hubert Grassmann, Bernd Graw, Christoph Meinel: RELACS - A Recursive Layout Computing System. 86-88
Reiner Creutzburg: Parallel Linear Conflict-Free Subtree Access. 89-96
D. De Baer, Jan Paredaens: A Formal Definition for Systolic Systems. 97-104
Krzysztof Diks: Parallel Recognition of Outerplanar Graphs. 105-113
Didier Ferment, Brigitte Rozoy: Solutions for the Distributed Termination Problem. 114-121
Michael Gössel, R. Rebel: Memories for Parallel Subtree-Access. 122-130
Shogo Matsui, Yoshinobu Kato, Shinsuke Teramura, Tomoyuki Tanaka, Nobuyuki Mohri, Atsushi Maeda, Masakazu Nakanishi: SYNAPSE: A Multi-Microprocessor Lisp Machine with Parallel Garbage Collector. 131-137
Wojciech Rytter: A Note on Optimal Parallel Transformations of Regular Expressions to Nondeterministic Finite Automata. 138-145
Wojciech Rytter, Raffaele Giancarlo: Optimal Parallel Parsing of Bracket Languages. 146-154
Dietmar Uhlig: On Reliable Networks from Unreliable Gates. 155-162
Imrich Vrto: Area-time Tradeoffs for Selection. 163-168
F. Wächter: Optimization of Special Permutation Networks Using Simple Algebraic Relations. 169-174

Invited Papers

Clark D. Thomborson, Linda L. Deneen, Gary M. Shute: Computing a Rectilinear Steiner Minimal Tree in n^O(sqrt(n)) Time. 176-183
Chee-Keng Yap: What Can be Parallelized in Computational Geometry?. 184-195

Communication

Akihiko Konagaya, Ryosei Nakazaki, Mamoru Umemura: A Co-Operative Programming Environment for a Back-End Type Sequential Inference Machine CHI. 196-205