## Probabilistic analysis of algorithms: on computing methodologies for computer algorithms performance evaluation"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. |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Other editions - View all

Probabilistic Analysis of Algorithms: On Computing Methodologies for ... Micha Hofri Limited preview - 2012 |

Probabilistic Analysis of Algorithms: On Computing Methodologies for ... Micha Hofri No preview available - 2011 |

### Common terms and phrases

2-sorted Abramowitz and Stegun algorithm analytic approximation asymptotic estimate asymptotic notation binomial coefficient bound cartesian product Chebyshev's inequality combinatorial components compute consider convergence counting cycle definition denote derivation determine differentiation distribution elements entire function equal equation 12 equation 9 evaluate example Exercises and Complements expected value explicit exponential expression finite gf's hence Hofri identity implies independent inequality input integral inversion table Knuth Linear Probing sort Markov chain Mellin transform nodes notation Note number of inversions Obtain equation operation packets packing pairs partitions permutation Poisson Poisson transform polynomials power series Prob probability problem produce proof properties protocol provides random variables realizable configurations recursion relation representation result right-hand side satisfy Section sequence Shell sort Show side of equation simple slot solution Stirling numbers subsets substituting Theorem total number transform users variance vector