Contents: Invited Papers: H. Alt, T. Hagerup, K. Mehlhorn, F.P. Preparata: Deterministic simulation of idealized parallel computers on more realistic ones.- R. Dwyer, R. Kannan: Convex hull of randomly chosen points from a polytope.- J. Herath, T. Yuba, N. Saito: Dataflow computing.- E. Koerner, I. Tsuda, H. Shimizu: Parallel in sequence - Towards the architecture of an elementary cortical processor.- N.N. Mirenkov: Parallel algorithms and static analysis of parallel programs.- B. Monien, O. Vornberger: Parallel processing of combinatorial search.- Communications: A. Apostolico, C.S. Iliopoulos, R. Paige: An O(nlogn) cost parallel algorithms for the single function coarsest partition problem.- T. Asano, H. Umeo: Systolic algorithms for computing the visibility polygon and triangulation of a polygonal region.- L. Budach, E.G. Giessmann, H. Grassmann, B. Graw, C. Meinel: RELACS - A recursive layout computing system.- R. Creutzburg: Parallel linear conflict-free subtree access.- D. De Baer, J. Paredaens: A formal definition for systolic systems.- K. Diks: Parallel recognition of outerplanar graphs.- D. Ferment, B. Rozoy: Solutions for the distributed termination problem.- M. Gössel, B. Rebel: Memories for parallel subtree-access.- S. Matsui, Y. Kato, S. Teramura, T. Tanaka, N. Mohri, A. Maeda, M. Nakanishi: SYNAPSE: A multi-microprocessor Lisp machine with parallel garbage collector.- W. Rytter: A note on optimal parallel transformations of regular expressions to nondeterministic finite automata.- W. Rytter, R. Giancarlo: Optimal parallel parsing of bracket languages.- D. Uhlig: On reliable networks from unreliable gates.- I. Vrto: Area-time tradeoffs for selection.- F. Wächter: Optimization of special permutation networks using simple algebraic relations.- Invited Papers: C.D. Thomborson, L.L. Deneen, G.M. Shute: Computing a rectilinear Steiner minimal tree in n0(n) time.- C.K. Yap: What can be parallelized in computational geometry'.- Communication: A. Konagaya, R. Nakazaki, M. Umemura: A co-operative programming environment for a back-end type sequential inference machine CHI.
- ISBN:
- 9783540180999
- 9783540180999
-
Category:
- Computer architecture & logic design
- Format:
- Paperback
- Publication Date:
-
09-12-1987
- Language:
- English
- Publisher:
- Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
- Country of origin:
- Germany
- Pages:
- 200
- Dimensions (mm):
- 279x216x11mm
- Weight:
- 0.67kg
This title is in stock with our Australian supplier and should arrive at our Sydney warehouse within 1 - 2 weeks of you placing an order.
Once received into our warehouse we will despatch it to you with a Shipping Notification which includes online tracking.
Please check the estimated delivery times below for your region, for after your order is despatched from our warehouse:
ACT Metro: 2 working days
NSW Metro: 2 working days
NSW Rural: 2-3 working days
NSW Remote: 2-5 working days
NT Metro: 3-6 working days
NT Remote: 4-10 working days
QLD Metro: 2-4 working days
QLD Rural: 2-5 working days
QLD Remote: 2-7 working days
SA Metro: 2-5 working days
SA Rural: 3-6 working days
SA Remote: 3-7 working days
TAS Metro: 3-6 working days
TAS Rural: 3-6 working days
VIC Metro: 2-3 working days
VIC Rural: 2-4 working days
VIC Remote: 2-5 working days
WA Metro: 3-6 working days
WA Rural: 4-8 working days
WA Remote: 4-12 working days
Share This Book: