Discrete Math Track
Welcome to the Discrete Math refresher course. This refresher is designed to refresh (or create afresh) your intuition about the basic tools of discrete math and graph theory. We expect to cover the bread and butter of discrete mathematics, while also reserving time to discuss a few active research questions in our brief tour through the territory. In the end, you should find yourself with a deepened understanding of combinatorics, sorting, graph theory fundamentals, breadth- and depth-first search, minimum spanning trees, flow algorithms, complexity theory and notation, approximation algorithms, and current research areas in discrete math and graph theory.
We take the view that algorithms and analysis are easiest to internalize when coupled with applications, and approach each new technique with an example firmly in mind. We will not shy away from proofs, but will do our best to nurture the novice while exerting the expert.
Time and Location