Parallel Algorithms and Architectures - 8 Angebote vergleichen
Preise | 2017 | 2018 | 2019 | 2020 | 2021 |
---|---|---|---|---|---|
Schnitt | € 29,57 | € 33,75 | € 14,69 | € 31,04 | € 29,99 |
Nachfrage |
Parallel Algorithms and Architectures: International Workshop Suhl, Gdr, May 25-30, 1987; Proceedings: Proceedings of the International Workshop on.(Lecture Notes in Computer Science) (2008)
ISBN: 9783540180999 bzw. 3540180990, vermutlich in Englisch, 1987. Ausgabe, Springer, Taschenbuch, gebraucht.
Von Händler/Antiquariat, Anybook Ltd. Lincoln, [RE:4].
This book has soft covers. Ex-library, With usual stamps and markings, In good all round condition. Please note the Image in this listing is a stock photo and may not match the covers of the actual item, 500grams, ISBN: 3540180990. Trade paperback, 1987 ed.
Parallel Algorithms and Architectures (1987)
ISBN: 9783540180999 bzw. 3540180990, in Deutsch, Springer, Taschenbuch, neu.
International Workshop Suhl, GDR, May 25-30, 1987; Proceedings, 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. Taschenbuch, 09.12.1987.
Parallel Algorithms and Architectures. -
ISBN: 9783540180999 bzw. 3540180990, in Deutsch, Springer, Berlin, neu.
Parallel Algorithms and Architectures. 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 form... Buch.
Parallel Algorithms and Architectures (1987)
ISBN: 9783540180999 bzw. 3540180990, vermutlich in Englisch, Springer Berlin, Taschenbuch, neu.
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. Taschenbuch, 09.12.1987.
Parallel Algorithms and Architectures (1987)
ISBN: 9783540180999 bzw. 3540180990, vermutlich in Englisch, Springer Berlin, Taschenbuch, neu.
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. Taschenbuch, 09.12.1987.
Parallel algorithms and architectures : international workshop Suhl, GDR, May 25 - 30, 1987 ; proceedings ( Lecture Notes in Computer Science; 269) (1987)
ISBN: 9783540180999 bzw. 3540180990, vermutlich in Englisch, Springer, Berlin [u.a.], Taschenbuch, gebraucht.
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen
Parallel algorithms architectures: international workshop Suhl, GDR, May 25 - 30, 1987 ; proceedings. Lecture notes in computer science; Vol. 269 (1987)
ISBN: 9783540180999 bzw. 3540180990, Band: 269, vermutlich in Englisch, Berlin; Heidelberg; New York; London; Paris; Tokyo: Springer, gebraucht.
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen
Parallel Algorithms and Architectures: International Workshop Suhl, GDR, May 25-30, 1987; Proceedings (1987)
ISBN: 9783540180999 bzw. 3540180990, in Deutsch, Springer Berlin Heidelberg, Taschenbuch, neu.
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen