CS 222 -- Algorithms at the End of the Wire

Handouts and Class Materials

Announcements

[7/30] I'll have a Piazza page up soon. This will be for class questions; we'll probably use a separate tool for class discussion issues.
[7/30] We will plan to use Gradescope+Canvas to turn in assignments. Please make sure you are signed up to Gradescope+Canvas. (This probably won't be set up for a couple weeks into the class.)

Basic Class Information

Assignments

[7/30] No assignments currently, but you might check out the class pre-readings below.

Readings

All reading dates are tentative and will be confirmed in class. We may go faster, we may go slower. We may have to move things for other reasons. You should consider the assigned papers a minimum of what you should be reading for this class. Feel free to explore on the Web or otherwise (and additional suggested readings for each topic will be listed as well). We are just touching the surface of these topics; there's much more out there.

Unit 0: Fun Stuff to Start us off

Please read all these, preferably before class begins, to see if you're interested.

Class 0: Network Applications of Bloom Filters: A Survey. by Broder and Mitzenmacher. This will be our first paper, covering background material.
Class 0 How to read a research paper notes.
Class 0: On your own background, make sure you know Markov chains.
Start with wikipedia. The fourth external link is to a useful book chapter on Markov chains.