My Account
Log in Registration
All
Cart
Highlights
Fiction Books
Non-Fiction Books
Children's Books
Rare Books
Music
DVD & Blu-Ray
Video Games
Category
Wishlists
Cart
All
Free US shipping over $10
Trustpilot
Proud to be B-Corp

Algorithms Jerome Paul

Algorithms By Jerome Paul

Algorithms by Jerome Paul

Reviews:
$23.09
Condition - Good
Only 1 left
Good

Summary

Provides in-depth coverage of traditional and current topics in sequential algorithms, as well as a solid foundation in the theory of parallel algorithms. Features mathematical techniques that assess the performance and correctness of algorithms.

Faster Shipping

Get this product faster from our US warehouse

Algorithms Summary

Algorithms: Sequential, Parallel, and Distributed by Jerome Paul

Algorithms: Sequential, Parallel, and Distributed offers in-depth coverage of traditional and current topics in sequential algorithms, as well as a solid introduction to the theory of parallel and distributed algorithms.

Table of Contents

Part 1: Introduction to Algorithms 1. Introduction to Preliminaries 2. Design and Analysis Fundamentals 3. Mathematical Tools for Algorithm Analysis 4. Trees and Applications to Algorithms 5. More on Sorting Algorithms 6. Probability and Average Complexity of Algorithms Part 2: Major Design Strategies 7. The Greedy Method 8. Divide-and-Conquer 9. Dynamic Programming 10. Backtracking and Branch-and-Bound Part 3: Graph and Network Algorithms 11. Graphs and Digraphs 12. Minimum Spanning Tree and Shortest-Path Algorithms 13. Graph Connectivity and Fault-Tolerance of Networks 14. Matching and Network Flow Algorithms Part 4: Parallel and Distributed Algorithms 15. Introduction to Parallel Algorithms and Architectures 16. Parallel Design Strategies 17. Internet Algorithms 18. Distributed Computation Algorithms 19. Distributed Network Algorithms Part 5: Special Topics 20. String Matching and Document Processing 21. Balanced Search Trees 22. The Fast Fourier Transform 23. Heuristic Search Strategies: A*-Search and Game Trees 24. Probabilistic and Randomized Algorithms 25. Lower-Bound Theory 26. NP-Complete Problems 27. Approximation Algorithms Appendices A: Mathematical Notation and Background B: Linear Data Structures C: Interpolating Asympotic Behavior D: Random Walks in Digraphs E: Elementary Probability Theory F: Examples of Message-Passing Interface Code G: Pseudocode Conventions

Additional information

CIN0534420575G
9780534420574
0534420575
Algorithms: Sequential, Parallel, and Distributed by Jerome Paul
Jerome Paul
Used - Good
Hardback
Cengage Learning, Inc
20041001
996
N/A
Book picture is for illustrative purposes only, actual binding, cover or edition may vary.
This is a used book - there is no escaping the fact it has been read by someone else and it will show signs of wear and previous use. Overall we expect it to be in good condition, but if you are not entirely satisfied please get in touch with us

Customer Reviews - Algorithms