| Probabilistic Analysis of Algorithms: On Computing Methodologies for Computer Algorithms Performance Evaluation Softcover Repri Edition Contributor(s): Hofri, Micha (Author) |
|
 |
ISBN: 1461291607 ISBN-13: 9781461291602 Publisher: Springer OUR PRICE: $52.24 Product Type: Paperback - Other Formats Published: October 2011 |
| Additional Information |
| BISAC Categories: - Computers | Programming - General - Computers | Machine Theory - Computers | Software Development & Engineering - General |
| Dewey: 005.12 |
| Series: Monographs in Computer Science |
| Physical Information: 0.55" H x 6.14" W x 9.21" (0.82 lbs) 240 pages |
| Descriptions, Reviews, Etc. |
| Publisher Description: Probabilistic Analysis of Algorithms begins with a presentation of the "tools of the trade" currently used in probabilistic analyses, and continues with an applications section in which these tools are used in the analysis ofr selected algorithms. The tools section of the book provides the reader with an arsenal of analytic and numeric computing methods which are then applied to several groups of algorithms to analyze their running time or storage requirements characteristics. Topics covered in the applications section include sorting, communications network protocols and bin packing. While the discussion of the various algorithms is sufficient to motivate their structure, the emphasis throughout is on the probabilistic estimation of their operation under distributional assumptions on their input. Probabilistic Analysis of Algorithms assumes a working knowledge of engineering mathematics, drawing on real and complex analysis, combinatorics and probability theory. While the book is intended primarily as a text for the upper undergraduate and graduate student levels, it contains a wealth of material and should also prove an important reference for researchers. As such it is addressed to computer scientists, mathematicians, operations researchers, and electrical and industrial engineers who are interested in evaluating the probable operation of algorithms, rather than their worst-case behavior. |