Algorithms: Sequential, Parallel, and Distibuted

Kenneth A. Berman, Jerome L. Paul - Collection Course Technology

962 pages, parution le 15/02/2005

Ajouter à une liste

Indisponible

Résumé

This groundbreaking text, a thoroughly updated version of the authors' previous work. Fundamentals of Sequential and Parallel Algorithms, offers a significant amount of new material designed to cover some of the most important recent algorithmic developments. The parallel algorithms material is now covered in one section, allowing instructors the option to cover as little or as much of this material as desired. An introduction to the Internet and distributed algorithms is included, as well as new appendixes that contain supplementary material. Berman and Paul's text will teach students how to create new algorithms or modify existing algorithms, thereby enhancing the student's ability to think independently.

Features

Intended for a core upper-division undergraduate course or first-year graduate course in the design and analysis of algorithms,
Provides the reader with a large tool kit of fundamental sequential, parallel, and distributed algorithmic solutions to frequently encountered problems.
Offers a five-part organizational structure that allows for instructor flexibility, as well as creating a natural flow of content.
Includes sufficient material on parallel and distributed algorithms to prepare students for advanced graduate study in this area.

To view Course Technology's entire collection of computer science titles including Discrete Mathematics, Theory of Computation, Modern Software Development, and more, please visit www.course.com/computerscience

L'auteur - Kenneth A. Berman

Kenneth A. Berman is a Professor of Computer Science and Engineering at the University of Cincinnati. He is a co-director of the Laboratory for Networks and Applied Graph Theory and coordinator of the UC research group Internet Computing and Information Science. He has published over 50 research papers, and has taught both undergraduate and graduate courses in networks and algorithms for many years.

L'auteur - Jerome L. Paul

Jerome L. Paul is a Professor of Computer Science and Engineering at the University of Cincinnati. He was head of UC's Computer Science Department for 10 years, and is currently the director of the Laboratory for Integrated Networked Computing (LINC). He has published over 30 research papers, and has taught both undergraduate and graduate courses in sequential and parallel algorithms for many years.

Sommaire

Introduction to Algorithms
- Introduction and Preliminaries
- Design and Analysis Fundamentals
- Mathematical Tools for Algorithm Analysis
- Trees and Applications to Algorithms
- More on Sorting Algorithms
- Probability and Average Complexity of Algorithms
Major Design Strategies
- The Greedy Method
- Divide-and-Conquer
- Dynamic Programming
- Backtracking and Branch-and-Bound
Graph and Network Algorithms
- Graphs and Digraphs
- Minimum Spanning Tree and Shortest-Path Algorithms
- Graph Connectivity and Fault-Tolerance of Networks
- Matching and Network Flow Algorithms
Parallel an Distributed Algorithms
- Introduction to Parallel and Architectures
- Parallel Design Strategies
- Internet Algorithms
- Distributed Computation Algorithms
- Distributed Network Algorithms
Special Topics
- String Matching and Document Processing
- Balanced Search Trees
- The Fast Fourier Transform
- Heuristic Search Strategies: A*-Search and Game Trees
- Probabilistic and Randomized Algorithms
- Lower-Bound Theory
- NP-Complete Problems
- Approximation Algorithms
Appendix A: Mathematical Notation and Background
Appendix B: Linear Data Structures
Appendix C: Interpolating Asymptotic Behavior
Appendix D: Random Walks in Digraphs
Appendix E: Elementary Probability Theory
Appendix F: Examples of Message-Passing Interface Code
Appendix G: Pseudocode Conventions

Voir tout

Replier

Caractéristiques techniques

	PAPIER
Éditeur(s)	Thomson
Auteur(s)	Kenneth A. Berman, Jerome L. Paul
Collection	Course Technology
Parution	15/02/2005
Nb. de pages	962
Format	19 x 24
Couverture	Relié
Poids	1661g
Intérieur	Noir et Blanc
EAN13	9780534420574
ISBN13	978-0-534-42057-4