000			01914nam a2200253Ia 4500
003			NULRC
005			20250520100607.0
008			250520s9999 xx 000 0 und d
020			_a9781133366805
040			_cNULRC
050			_aQA 76.9.A43 .M55 2013
100			_aMiller, Russ. _eauthor
245		0	_aAlgorithms sequential and parallel : _ba unified approach / _cRuss Miller and Laurence Boxer.
250			_aThird edition.
260			_aBoston, Massachusetts : _bCengage Learning Asia Pte Ltd, _cc2013
300			_axxxi, 417 pages : _billustrations ; _c24 cm.
365			_bUSD55.05
504			_aIncludes bibliographical references (pages 403-407) and index.
505			_aDiscrete Mathematics Reference Guide. 1. Asymptotic Analysis. 2. Induction and Recursion. 3. The Master Method. 4. Models of Computation. 5. Combinational Circuits. 6. Matrix Operations. 7. Parallel Prefix. 8. Pointer Jumping. 9. Divide-and-Conquer. 10. Computational Geometry. 11. Image Processing. 12. Graph Algorithms. 13. Numerical Problems. Appendix 1: Proof of Mathematical Induction. Appendix 2: Proof of Master Theorem. Appendix 3: Proof of Expected Running Time of Quicksort. Appendix 4: Expected-Case Running Time of Quicksort.
520			_aEquip yourself for success with a state-of-the-art approach to algorithms available only in Miller/Boxer's ALGORITHMS SEQUENTIAL AND PARALLEL: A UNIFIED APPROACH, 3E. This unique and functional text gives you an introduction to algorithms and paradigms for modern computing systems, integrating the study of parallel and sequential algorithms within a focused presentation. With a wide range of practical exercises and engaging examples drawn from fundamental application domains, this book prepares you to design, analyze, and implement algorithms for modern computing systems.
650			_aPARALLEL ALGORITHMS
700			_aBoxer, Laurence _eco-author
942			_2lcc _cBK
999			_c8944 _d8944