Randomized algorithms Rajeev Motwani; Prabhakar Raghavan

By:

Motwani, Rajeev; Raghavan, Prabhakar

Material type: Text

TextPublication details: Cambridge ; New York ; New Delhi : Cambridge University Press, 1995.Edition: 1st ed. South Asia EditionDescription: xiv, 476 pages : illustrations, 24 cmISBN:

9780521613903

Subject(s):

DDC classification:

004.015 MOT

Contents:

1. Introduction -- 2. Game-Theoretic Techniques -- 3. Moments and Deviations -- 4. Tail Inequalities -- 5. The Probabilistic Method -- 6. Markov Chains and Random Walks -- 7. Algebraic Techniques -- 8. Data Structures -- 9. Geometric Algorithms and Linear Programming -- 10. Graph Algorithms -- 11. Approximate Counting -- 12. Parallel and Distributed Algorithms -- 13. Online Algorithms -- 14. Number Theory and Algebra --

List(s) this item appears in: New Arrivals January March 2022

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings ( 5 )
Title notes ( 1 )
Comments ( 0 )

Holdings
Item type	Current library	Collection	Call number	Status	Barcode
Books	IIITDM Kurnool General Stacks	Non-fiction	004.015 MOT (Browse shelf(Opens below))	Available	0004409
Books	IIITDM Kurnool General Stacks	Non-fiction	004.015 MOT (Browse shelf(Opens below))	Available	0004410
Books	IIITDM Kurnool General Stacks	Non-fiction	004.015 MOT (Browse shelf(Opens below))	Available	0004411
Books	IIITDM Kurnool General Stacks	Non-fiction	004.015 MOT (Browse shelf(Opens below))	Available	0004412
Reference	IIITDM Kurnool Reference	Reference	004.015 MOT (Browse shelf(Opens below))	Not For Loan	0004413

Browsing IIITDM Kurnool shelves, Shelving location: General Stacks, Collection: Non-fiction Close shelf browser (Hides shelf browser)

Previous								Next
Previous	004.015 CHA Mathematical Foundations of Computer Science (Discrete Structures)	004.015 MOT Randomized algorithms	004.015 MOT Randomized algorithms	004.015 MOT Randomized algorithms	004.015 MOT Randomized algorithms	004.056 STA Cryptography and network security:principles and practice	004.056 STA Cryptography and network security:principles and practice	Next

1. Introduction --
2. Game-Theoretic Techniques --
3. Moments and Deviations --
4. Tail Inequalities --
5. The Probabilistic Method --
6. Markov Chains and Random Walks --
7. Algebraic Techniques --
8. Data Structures --
9. Geometric Algorithms and Linear Programming --
10. Graph Algorithms --
11. Approximate Counting --
12. Parallel and Distributed Algorithms --
13. Online Algorithms --
14. Number Theory and Algebra --

There are no comments on this title.

to post a comment.