 |
|
|
Item Details
| Title:
|
HANDBOOK OF RANDOMIZED COMPUTING
VOLUME I/II |
| By: |
Sanguthevar Rajasekaran (Editor), Panos M. Pardalos (Editor), J. H. Reif (Editor) |
| Format: |
Hardback |
| List price:
|
£72.00 |
|
We currently do not stock this item, please contact the publisher directly for
further information.
|
|
|
|
|
|
| ISBN 10: |
0792369599 |
| ISBN 13: |
9780792369592 |
| Publisher: |
SPRINGER |
| Pub. date: |
1 July, 2001 |
| Edition: |
2001 ed. |
| Series: |
Combinatorial Optimization 9 |
| Pages: |
969 |
| Description: |
Randomization techniques have been employed to solve numerous problems of computing. This two-volume handbook is a collection of articles covering a wide spectrum of issues in Randomization. It is a reference for the important areas of algorithm design, including those essential to its applications in computer science and engineering. |
| Synopsis: |
The technique of randomization has been employed to solve numerous prob- lems of computing both sequentially and in parallel. Examples of randomized algorithms that are asymptotically better than their deterministic counterparts in solving various fundamental problems abound. Randomized algorithms have the advantages of simplicity and better performance both in theory and often is a collection of articles written by renowned experts in practice. This book in the area of randomized parallel computing. A brief introduction to randomized algorithms In the analysis of algorithms, at least three different measures of performance can be used: the best case, the worst case, and the average case. Often, the average case run time of an algorithm is much smaller than the worst case. 2 For instance, the worst case run time of Hoare's quicksort is O(n ), whereas its average case run time is only O(nlogn). The average case analysis is conducted with an assumption on the input space. The assumption made to arrive at the O(n logn) average run time for quicksort is that each input permutation is equally likely. Clearly, any average case analysis is only as good as how valid the assumption made on the input space is. Randomized algorithms achieve superior performances without making any assumptions on the inputs by making coin flips within the algorithm. Any analysis done of randomized algorithms will be valid for all possible inputs. |
| Illustrations: |
XXVII, 969 p. |
| Publication: |
Netherlands |
| Imprint: |
Springer |
| Returns: |
Returnable |
|
|
|
 |
Ramadan and Eid al-Fitr
A celebratory, inclusive and educational exploration of Ramadan and Eid al-Fitr for both children that celebrate and children who want to understand and appreciate their peers who do.
|
|
|
|
|
|
|
|
|
|
|