| 000 -LEADER |
|---|
| fixed length control field |
01928nam a22003137a 4500 |
| 003 - CONTROL NUMBER IDENTIFIER |
|---|
| control field |
CITU |
| 005 - DATE AND TIME OF LATEST TRANSACTION |
|---|
| control field |
20240325085118.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
|---|
| fixed length control field |
210305b ||||| |||| 00| 0 eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
|---|
| International Standard Book Number |
0534420575 |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
|---|
| International Standard Book Number |
9780534420574 |
| 041 ## - LANGUAGE CODE |
|---|
| Language code of text/sound track or separate title |
eng |
| 082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER |
|---|
| Classification number |
005.1 |
| 100 1# - MAIN ENTRY--PERSONAL NAME |
|---|
| Preferred name for the person |
Berman, Kenneth A. |
| Relator term |
author |
| 245 ## - TITLE STATEMENT |
|---|
| Title |
Algorithms : |
| Remainder of title |
sequential, parallel, and distributed / |
| Statement of responsibility, etc |
Kenneth A. Berman and Jerome L. Paul |
| 264 #1 - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT) |
|---|
| Place of publication, distribution, etc |
Boston : |
| Name of publisher, distributor, etc |
Thomson, |
| Date of publication, distribution, etc |
c2005. |
| 300 ## - PHYSICAL DESCRIPTION |
|---|
| Extent |
xxix, 962 pages : |
| Other physical details |
illustrations ; |
| Dimensions |
25 cm. |
| 336 ## - CONTENT TYPE |
|---|
| Content type term |
text |
| Content type code |
txt |
| Source |
rdaconten |
| 337 ## - MEDIA TYPE |
|---|
| Media type term |
unmediated |
| Media type code |
n |
| Source |
rdamedia |
| 338 ## - CARRIER TYPE |
|---|
| Carrier type term |
volume |
| Source |
rdacarrier |
| Carrier type code |
nc |
| 504 ## - BIBLIOGRAPHY, ETC. NOTE |
|---|
| Bibliography, etc |
Includes bibliographical references and index. |
| 505 0# - CONTENTS |
|---|
| Formatted contents note |
Introduction to Algorithms -- Major Design Strategies -- Graph and Network Algorithms -- Parallel and Distributed Algorithms -- Special Topics -- Appendices : Mathematical Notation and Background , Linear Data Structures, Interpolating Asympotic Behavior, Random Walks in Digraphs, Elementary Probability Theory, Examples of Message-Passing Interface Code, Pseudocode Conventions. |
| 520 ## - SUMMARY, ETC. |
|---|
| Summary, etc |
This book 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. In light of the emergence of modern computing environments such as parallel computers, the Internet, and cluster and grid computing, it is important that computer science students be exposed to algorithms that exploit these technologies. Berman and Pauls text will teach students how to create new algorithms or modify existing algorithms, thereby enhancing students ability to think independently. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name as entry element |
Parallel processing (Electronic computers). |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name as entry element |
Computer algorithms. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name as entry element |
Sequential processing (Computer science). |
| 700 1# - ADDED ENTRY--PERSONAL NAME |
|---|
| Relator code |
Paul, Jerome L. |
| 942 ## - ADDED ENTRY ELEMENTS |
|---|
| Source of classification or shelving scheme |
|
| Item type |
BOOK |
| Issues (borrowed), all copies |
2 |