UID:
almafu_9961989722202883
Umfang:
1 online resource (210 p.)
Ausgabe:
Reprint 2021
ISBN:
9783112481240
,
3112481240
Serie:
Mathematical Research : Mathematische Forschung ; 38
Inhalt:
Keine ausführliche Beschreibung für "Parallel Algorithms and Architectures" verfügbar.
Anmerkung:
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
,
Issued also in print.
,
In German.
Weitere Ausg.:
ISBN 9783112481233
Weitere Ausg.:
ISBN 3112481232
Sprache:
Deutsch
DOI:
10.1515/9783112481240
Bookmarklink