Koha online

Your cart is empty.
Normal view MARC view ISBD view

Designing Sorting Networks [electronic resource] :A New Paradigm / by Sherenaz W. Al-Haj Baddar, Kenneth E. Batcher.

by Al-Haj Baddar, Sherenaz W [author.]; Batcher, Kenneth E [author.]; SpringerLink (Online service).
Material type: materialTypeLabelBookPublisher: New York, NY : Springer New York, 2011.Description: XII, 136 p. online resource.ISBN: 9781461418511.Subject(s): Computer science | Data structures (Computer science) | Computer Science | Data Structures | Arithmetic and Logic Structures | Models and PrinciplesDDC classification: 005.73 Online resources: Click here to access online
Contents:
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.
In: Springer eBooksSummary: Designing Sorting Networks: A New Paradigm provides an in-depth guide to maximizing the efficiency of sorting networks, and uses 0/1 cases, partially ordered sets and Haase diagrams to closely analyze their behavior in an easy, intuitive manner. 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.
Tags from this library: No tags from this library for this title. Add tag(s)
Log in to add tags.
    average rating: 0.0 (0 votes)
Item type Current location Call number Status Date due Barcode
MAIN LIBRARY
QA76.9.D35 (Browse shelf) Available

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.

Designing Sorting Networks: A New Paradigm provides an in-depth guide to maximizing the efficiency of sorting networks, and uses 0/1 cases, partially ordered sets and Haase diagrams to closely analyze their behavior in an easy, intuitive manner. 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.

There are no comments for this item.

Log in to your account to post a comment.
@ Jomo Kenyatta University Of Agriculture and Technology Library

Powered by Koha