Randomized Algorithms

CSCI-6220

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. Students cannot receive credit for both CSCI 4030 and CSCI 6220.

4 credits

Cross-listed with:

CSCI-4030 Randomized Algorithms

Prereqs:

none

Past Term Data

Offered

Not Offered

Offered as Cross-Listing Only

No Term Data

Simple View Detailed View

	Spring	Summer		Fall
		(Session 1)	(Session 2)
2023
2022
2021
2020
2019				Randomized Algorithms (4c) Alex Algernon Theodore Gittens Seats Taken: 10/20
2018				Randomized Algorithms (4c) Alex Algernon Theodore Gittens Seats Taken: 15/16
2017				Randomized Algorithms (3c) Alex Algernon Theodore Gittens Seats Taken: 7/30
2016	Randomized Algorithms (3c) Petros Drineas Seats Taken: 27/40
2015
2014
2013
2012
2011
2010
2009
2008
2007
2006
2005
2004
2003
2002
2001
2000
1999
1998