Randomized Algorithms

CSCI-4030

State-of-the-art in contemporary algorithm design, randomized algorithms are algorithms that use randomness as part of their functioning. They are typically simple, often easy to analyze, and work well in practice. They have numerous applications in many fields of computer science and mathematics. Randomized algorithms represent an active and vibrant research area with many exciting new results contributed every year.

4 credits

Cross-listed with:

CSCI-6220 Randomized Algorithms

Prereqs:

CSCI-4020 Design and Analysis of Algorithms

Past Term Data

Offered

Not Offered

Offered as Cross-Listing Only

No Term Data

Simple View Detailed View

	Summer		Fall
	(Session 1)	(Session 2)
2023
2022
2021
2020
2019			Randomized Algorithms (4c) Alex Algernon Theodore Gittens Seats Taken: 8/40
2018			Randomized Algorithms (4c) Alex Algernon Theodore Gittens Seats Taken: 3/20
2017			Randomized Algorithms (4c) Alex Algernon Theodore Gittens Seats Taken: 7/20
2016
2015
2014
2013
2012
2011
2010
2009
2008
2007