Notes on Randomized Algorithms

These are notes for the Yale course CPSC 469/569 Randomized Algorithms.

**Tag(s):**
Algorithms and Data Structures

**Publication date**: 29 Oct 2020

**ISBN-10**:
n/a

**ISBN-13**:
n/a

**Paperback**:
459 pages

**Views**: 12,294

**Type**: Lecture Notes

**Publisher**:
n/a

**License**:
Creative Commons Attribution-ShareAlike 4.0 International

**Post time**: 03 Mar 2021 01:00:00

Notes on Randomized Algorithms

These are notes for the Yale course CPSC 469/569 Randomized Algorithms.

You are free to:

Share — copy and redistribute the material in any medium or format

Adapt — remix, transform, and build upon the material for any purpose, even commercially.

The licensor cannot revoke these freedoms as long as you follow the license terms.

Click**here** to read the full license.

Share — copy and redistribute the material in any medium or format

Adapt — remix, transform, and build upon the material for any purpose, even commercially.

The licensor cannot revoke these freedoms as long as you follow the license terms.

Click

From the Preface:

James Aspnes wrote:

James Aspnes wrote:

These are notes for the Yale course CPSC 469/569 Randomized Algorithms. This document also incorporates the lecture schedule and assignments, as well as some sample assignments from previous semesters. Because this is a work in progress, it will be updated frequently over the course of the semester.

Much of the structure of the course follows Mitzenmacher and Upfals's Probability and Computing: Randomized Algorithms and Probabilistic Analysis [MU05], with some material from Motwani and Raghavan's Randomized Algorithms [MR95]. In most cases you'll find these textbooks contain much more detail than what is presented here, so it is probably better to consider this document a supplement to them than to treat it as your primary source of information.

The most recent version of these notes will be available at http://www.cs.yale.edu/homes/aspnes/classes/469/notes.pdf. More stable archival versions may be found at https://arxiv.org/abs/2003.01902.

I would like to thank my many students and teaching fellows over the years for their help in pointing out errors and omissions in earlier drafts of these notes.

Tweet

About The Author(s)

James Aspnes is a professor in the Computer Science Department at Yale. He is also the Director of Undergraduate Studies for the Computer Science department. His main area of research is distributed algorithms.

Book Categories

Computer Science
Introduction to Computer Science
Introduction to Computer Programming
Algorithms and Data Structures
Artificial Intelligence
Computer Vision
Machine Learning
Neural Networks
Game Development and Multimedia
Data Communication and Networks
Coding Theory
Computer Security
Information Security
Cryptography
Information Theory
Computer Organization and Architecture
Operating Systems
Image Processing
Parallel Computing
Concurrent Programming
Relational Database
Document-oriented Database
Data Mining
Big Data
Data Science
Digital Libraries
Compiler Design and Construction
Functional Programming
Logic Programming
Object Oriented Programming
Formal Methods
Software Engineering
Agile Software Development
Information Systems
Geographic Information System (GIS)

Mathematics
Mathematics
Algebra
Abstract Algebra
Linear Algebra
Number Theory
Numerical Methods
Precalculus
Calculus
Differential Equations
Category Theory
Proofs
Discrete Mathematics
Theory of Computation
Graph Theory
Real Analysis
Complex Analysis
Probability
Statistics
Game Theory
Queueing Theory
Operations Research
Computer Aided Mathematics

Supporting Fields
Web Design and Development
Mobile App Design and Development
System Administration
Cloud Computing
Electric Circuits
Embedded System
Signal Processing
Integration and Automation
Network Science
Project Management

Operating System
Programming/Scripting
Ada
Assembly
C / C++
Common Lisp
Forth
Java
JavaScript
Lua
Rexx
Microsoft .NET
Perl
PHP
R
Python
Rebol
Ruby
Scheme
Tcl/Tk

Miscellaneous
Sponsors