Designing Sorting Networks: A New Paradigm
Autor Sherenaz W. Al-Haj Baddar, Kenneth E. Batcheren Limba Engleză Hardback – 4 noi 2011
This book also outlines new ideas and techniques for designing faster sorting networks using Sortnet, and illustrates how these techniques were used to design faster 12-key and 18-key sorting networks through a series of case studies.
Finally, it examines and explains the mysterious behavior exhibited by the fastest-known 9-step 16-key network. Designing Sorting Networks: A New Paradigm is intended for advanced-level students, researchers and practitioners as a reference book. Academics in the fields of computer science, engineering and mathematics will also find this book invaluable.
| Toate formatele și edițiile | Preț | Express |
|---|---|---|
| Paperback (1) | 312.79 lei 6-8 săpt. | |
| Springer – 25 ian 2014 | 312.79 lei 6-8 săpt. | |
| Hardback (1) | 318.67 lei 6-8 săpt. | |
| Springer – 4 noi 2011 | 318.67 lei 6-8 săpt. |
Preț: 318.67 lei
Preț vechi: 398.33 lei
-20% Nou
Puncte Express: 478
Preț estimativ în valută:
56.38€ • 66.28$ • 49.38£
56.38€ • 66.28$ • 49.38£
Carte tipărită la comandă
Livrare economică 28 ianuarie-11 februarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9781461418504
ISBN-10: 146141850X
Pagini: 200
Ilustrații: XII, 136 p.
Dimensiuni: 155 x 235 x 15 mm
Greutate: 0.39 kg
Ediția:2011
Editura: Springer
Colecția Springer
Locul publicării:New York, NY, United States
ISBN-10: 146141850X
Pagini: 200
Ilustrații: XII, 136 p.
Dimensiuni: 155 x 235 x 15 mm
Greutate: 0.39 kg
Ediția:2011
Editura: Springer
Colecția Springer
Locul publicării:New York, NY, United States
V-ar putea interesa
-
Modeling the Agile Data Warehouse with Data VaultHans Hultgren-20%Preț: 444.27 lei555.33 lei -
Business Database TriageFrank Oberle-20%Preț: 195.46 lei244.32 lei -
Data Analysis for Database DesignDavid Howe-20%Preț: 274.98 lei343.72 lei -
Preț: 235.76 lei -
Modele Conceptuel de DonneesPierre-Andre Sunier-20%Preț: 104.70 lei130.87 lei -
Korrekte Zugriffe zu verteilten DatenH. Bender-20%Preț: 399.27 lei499.08 lei -
Bibliography on Abstract Data TypesB. Kutzler-20%Preț: 617.68 lei772.10 lei -
-20%Preț: 1246.20 lei1557.75 lei -
-20%Preț: 329.60 lei412.00 lei -
The Unnormalized Relational Data Model: For Office Form Processor DesignHiroyuki Kitagawa-20%Preț: 315.80 lei394.74 lei
Public țintă
Professional/practitionerCuprins
Preface.- Early History.- Software Implementations.- POSETS.- The 0/1-Principle.- A 16-Key Sorting Network.- The Sortnet Program.- Divide & Conquer.- Counting Strangers.- Finding Better Networks.- Lattice Theory.- The AKS Sorting Network.- Ideas For Faster Networks.- BOOL(N).- Sorting Networks For Large N.- Another Way Of Handling Strangers.- Thoughts On Minimizing Strangers.- Case Studies.- Appendix I: Proofs of Theorems.- Index.
Caracteristici
Illustrates recent proofs of Bitonic and Odd-Even merge sorting algorithms, presented directly by the original developer of these parallel sorting algorithms Provides an in-depth analysis of the use of 0/1 cases, partial order sets and Haase diagrams in designing and analyzing sorting networks Outlines new ideas and techniques for designing faster sorting networks using Sortnet, and highlights how these techniques helped design faster 12-key and 18-key sorting networks Includes supplementary material: sn.pub/extras