000			01749 a2200181 4500
003			Nust
005			20220727125746.0
020			_a3540180990
040			_cNust
082			_a004.35,LEC
100			_aJung.H, Albrecht .A _995468
245			_aLecture Notes in Computer Science / _hA.Albrecht , H . Jung k.Mehlhorn Editer
260			_aBerlin _bSpringer-Verlag _c1987
300			_a205p .:
505			_aDeterministic Simulation of Idealized Parallel Computer on More Realistic ones (Page-11), Convex hull of randomly chosen Points from a Poly tope (Page-16), Data flow Computing (Page-25), Parallel in Sequence Towards the architecture of an elementary cortical Processor (Page-37), Parallel Algorithms Processing of Combinatorial Search (Page-60) Cost Parallel Algorithms for the Single function Coarsest Partition Problem (Page-70), Aystolic Algorithms of Computing the Visibility Polygon and Triangulation of a Polygonal Region (Page-77), A Recurstive layout Computing System (Page-86), Parallel Linear Conflict-free Subtree Access (Page-89) A Formal definition for systolic Systems (Page-97), Parallel Recognition of Outer planer Graphs (Page-105), Solutions for the Distributed Termination Problem (Page-114), Memories for Prallel Subtree-Access (Page-122), A Multi-Processor Lisp Machine with Parallel Garbage Collector (Page-131), A note on Optical Parallel Transformation of Regular Expressions to nondeterministic Finite automate (Page-138), Optical Prallel Parsing of Bracket Languages (Page-146), On reliable networks from unreliable Gates (Page-155) Area-time tradeoffs for Selection (Page-163), Optimization of Special Permutation Networks Using Simple (Page-169).
650			_aComputer Science
942			_2ddc _cBK _k004.35,LEC
999			_c176313 _d176313