000			01928nam a22003137a 4500
999			_c57972 _d57972
003			CITU
005			20240325085118.0
008			210305b ||||| |||| 00| 0 eng d
020			_a0534420575
020			_a9780534420574
040			_aCITU LRAC _beng
041			_aeng
082			_a005.1
100	1		_aBerman, Kenneth A. _eauthor
245			_aAlgorithms : _bsequential, parallel, and distributed / _cKenneth A. Berman and Jerome L. Paul
264		1	_aBoston : _bThomson, _cc2005.
300			_axxix, 962 pages : _billustrations ; _c25 cm.
336			_atext _btxt _2rdaconten
337			_aunmediated _bn _2rdamedia
338			_avolume _2rdacarrier _bnc
504			_aIncludes bibliographical references and index.
505	0		_aIntroduction 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			_aThis 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	_aParallel processing (Electronic computers).
650		0	_aComputer algorithms.
650		0	_aSequential processing (Computer science).
700	1		_4Paul, Jerome L.
942			_2ddc _cBK _02