Parallel Algorithms and Architectures: International Workshop Suhl, GDR, May 25-30, 1987; Proceedings
1111333340
Parallel Algorithms and Architectures: International Workshop Suhl, GDR, May 25-30, 1987; Proceedings
49.99 In Stock
Parallel Algorithms and Architectures: International Workshop Suhl, GDR, May 25-30, 1987; Proceedings

Parallel Algorithms and Architectures: International Workshop Suhl, GDR, May 25-30, 1987; Proceedings

Parallel Algorithms and Architectures: International Workshop Suhl, GDR, May 25-30, 1987; Proceedings

Parallel Algorithms and Architectures: International Workshop Suhl, GDR, May 25-30, 1987; Proceedings

Paperback(1987)

$49.99 
  • SHIP THIS ITEM
    In stock. Ships in 6-10 days.
  • PICK UP IN STORE

    Your local store may have stock of this item.

Related collections and offers

Product Details

ISBN-13: 9783540180999
Publisher: Springer Berlin Heidelberg
Publication date: 12/15/1987
Series: Lecture Notes in Computer Science , #269
Edition description: 1987
Pages: 200
Product dimensions: 8.50(w) x 10.98(h) x 0.02(d)

Table of Contents

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 of parallel programs.- Parallel processing of combinatorial search trees.- An O(nlogn) cost parallel algorithm for the single function coarsest partition problem.- Systolic algorithms for computing the visibility polygon and triangulation of a polygonal region.- RELACS — A recursive layout computing system.- Parallel linear conflict-tree 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 from unreliable gates.- Area-time tradeoffs for selection.- Optimization of special permutation networks using simple algebraic relations.- Computing a rectilinear steiner minimal tree in $$nsub{O(\sqrt n )}$$ time.- What can be parallelized in computational geometry?.- A co-operative programming environment for a back-end type sequential inference machine CHI.
From the B&N Reads Blog

Customer Reviews