Parallel Algorithms and Architectures : : Proceedings of the International Workshop on Parallel Algorithms and Architectures held in Suhl (GDR), May 25–30, 1987 / / hrsg. von Kurt Mehlhorn, Hermann Jung, Andreas Albrecht.

• Superior document: Title is part of eBook package: De Gruyter DGBA Physical Sciences <1990
• MitwirkendeR: Albrecht, A.,; Alt, H.,; Apostolico, A.,; Asano, Tetsuo,; Baer, D. De,; Budach, L.,; Creutzburg, Reiner,; Deneen, Linda L.,; Diks, Krzysztof,; Diopouios, C. S.,; Dwyer, Rex,; Ferment, Didier,; Giancarlo, Raffaele,; Glessmann, E. G.,; Grassmann, H.,; Graw, B.,; Gössel, M.,; Hagerup, T.,; Herath, Jayantha,; Jung, H.,; Kannan, Ravi,; Kato, Yoshinobu,; Koernern, E.,; Konagaya, Akihiko,; Maeda, Atsushi,; Matsui, Shogo,; Mehlhorn, K.,; Meinel, C.,; Mirenkov, H. N.,; Mohri, Nobuyuki,; Monien, B.,; Nakanishi, Masakazu,; Nakazaki, Ryousei,; Paige, R.,; Paredaens, J.,; Preparata, F. P.,; Rebel, B.,; Rozoy, Brigitte,; Rytter, Wojciech,; Saito, Nobuo,; Shimizu, H.,; Shute, Gary M.,; Tanaka, Tomoyuki,; Teramura, Shinsuke,; Thomborton, Clark D.,; Tsuda, I.,; Uhlig, Dietmar,; Umemura, Mamoru,; Umeo, Hiroshi,; Vornberger, O.,; Vrťo, Imrich,; Wächter, P.,; Yap, Chee-Keng,; Yuba, Toshitsugu,
• HerausgeberIn: Albrecht, Andreas,; Jung, Hermann,; Mehlhorn, Kurt,
• Place / Publishing House: Berlin ;, Boston : : De Gruyter, , [2022]; ©1987
• Year of Publication: 2022
• Edition: Reprint 2021
• Language: German
• Series: Mathematical Research : Mathematische Forschung ; 38
• Physical Description: 1 online resource (210 p.)

Table of Contents

• Frontmatter
• PREFACE
• TABLE OF CONTENTS
• Invited Papers
• Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones
• CONVEX HULL OF RANDOMLY CHOSEN POINTS FROM A POLYTOPE
• Dataflow Computing
• PARALLEL IN SEQUENCE – TOWARDS THE ARCHITECTURE OF AN ELEMENTARY CORTICAL PROCESSOR
• PARALLEL ALGORITHMS AND STATIC ANALYSIS OP PARALLEL PROGRAMS
• Parallel Processing of Combinatorial Search Trees
• Communications
• AN 0(nlogn) COST PARALLEL ALGORITHM FOR THE SINGLE FUNCTION COARSEST PARTITION PROBLEM (Extended Abstract)
• SYSTOLIC ALGORITHMS FOR COMPUTING THE VISIBILITY POLYGON AND TRIANGULATION OF A POLYGONAL REGION
• RELACS - A RECURSIVE LAYOUT COMPUTINO SYSTEM
• Parallel linear conflict-free subtree access
• A FORMAL DEFINITION FOR SYSTOLIC SYSTEMS
• PARALLEL RECOGNITION OF OUTERPLANAR GRAPHS
• SOLUTIONS FOR THE DISTRIBUTED TERMINATION PROBLEM.
• Memories for Parallel Subtree-Access
• SYNAPSE: A MULTI-MICROPROCESSOR LISP MACHINE WITH PARALLEL GARBAGE COLLECTOR
• A NOTE ON OPTIMAL PARALLEL TRANSFORMATIONS OF REGULAR EXPRESSIONS TO NONDETERMINISTIC FINITE AUTOMATA
• OPTIMAL PARALLEL PARSING OF BRACKET LANGUAGES
• ON RELIABLE NETWORKS PROM UNRELIABLE GATES
• AREA-TINE TRADEOFFS FOR SELECTION
• Optimization of special permutation networks using simple algebraic relations
• LATE PAPERS
• Invited Papers
• Computing a Rectilinear Steiner Minimal Tree in n0(√n) Time
• What can be Parallelized in Computational Geometry?
• Communication
• A Co-Operative Programming Environment for a Back-End Type Sequential Inference Machine CHI
• Backmatter