Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen
Sign in
Register
Dashboard
Search
Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen
Sign in
Register
Dashboard
Search
82
views
0
references
Top references
cited by
280
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
2,964
similar
All similar
Record
: found
Abstract
: not found
Book
: not found
Randomized Algorithms
monograph
Author(s):
Rajeev Motwani
,
Prabhakar Raghavan
Publication date
(Online):
2009
Publisher:
Cambridge University Press
Read this book at
Publisher
Buy book
Review
Review book
Invite someone to review
Bookmark
Cite as...
There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
ScienceOpen Research
Author and book information
Book
ISBN:
9780511814075
Publication date (Print):
1995
Publication date (Online):
2009
DOI:
10.1017/CBO9780511814075
SO-VID:
b0e76934-bfd2-40cd-8db5-8bcae740a61a
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. ix
Preface
pp. 3
Introduction
pp. 28
Game-Theoretic Techniques
pp. 43
Moments and Deviations
pp. 67
Tail Inequalities
pp. 101
The Probabilistic Method
pp. 127
Markov Chains and Random Walks
pp. 161
Algebraic Techniques
pp. 197
Data Structures
pp. 234
Geometric Algorithms and Linear Programming
pp. 278
Graph Algorithms
pp. 306
Approximate Counting
pp. 335
Parallel and Distributed Algorithms
pp. 368
Online Algorithms
pp. 392
Number Theory and Algebra
pp. 429
Notational Index
pp. 433
Mathematical Background
pp. 438
Basic Probability Theory
pp. 447
References
Similar content
2,964
Intra-and-Inter Species Biomass Prediction in a Plantation Forest: Testing the Utility of High Spatial Resolution Spaceborne Multispectral RapidEye Sensor and Advanced Machine Learning Algorithms
Authors:
Timothy Dube
,
Onisimo Mutanga
,
Elhadi Adam
…
A prioriconvergence of the Greedy algorithm for the parametrized reduced basis method
Authors:
Christophe Prud’homme
,
Yvon Maday
,
Anthony Patera
…
QPSO-Based Adaptive DNA Computing Algorithm
Authors:
Mehmet Karakose
,
Ugur Cigdem
See all similar
Cited by
273
Quantum walks: a comprehensive review
Authors:
Salvador Elías Venegas-Andraca
IMPROVED ANALYSIS OF THE SUBSAMPLED RANDOMIZED HADAMARD TRANSFORM
Authors:
JOEL A. TROPP
User-Friendly Tail Bounds for Sums of Random Matrices
Authors:
Joel A. Tropp
See all cited by