Links

    CS 127. Computational Geometry (Spring 2005)

    Basic techniques, data structures, combinatorics, and algorithms for solving geometric problems. Examples are convex hulls, Voronoi diagrams, point set, and polygon triangulation. Range search, linear programming, and point location. Some theoretical and programming exercises.

    CS 222. Algorithms at The End of the Wire (Fall 2012)

    Covers topics related to algorithms for big data, especially related to networks. Themes include compression, cryptography, coding, and information retrieval related to the World Wide Web. Requires a major final project.

    CS 228. Computational Learning Theory (Spring 2014)

    Possibilities of and limitations to performing learning by computational agents. Topics include computational models, polynomial time learnability, learning from examples and learning from queries to oracles. Applications to Boolean functions, automata and geometric functions.

    CS 286r. Topics at the Interface between Computer Science and Economics (Matching and Market Design) (Spring 2014)

    Markets are the basic mechanism by which resources are allocated to agents. In recent years, computer scientists and economists have re-engineered markets with a particular eye towards efficiency (i.e., that the market optimizes the designer's objective) and stability (i.e., that the...

    Read more about CS 286r. Topics at the Interface between Computer Science and Economics (Matching and Market Design) (Spring 2014)

    CS 286r. Topics at the Interface between Computer Science and Economics (Information, Prediction, and Collective Intelligence) (Fall 2012)

    This is a rotating topics course that studies the interplay between computation and economics. Topics covered include electronic commerce, computational social choice, computational mechanism design, peer production, prediction markets and reputation systems. The class is seminar style and...

    Read more about CS 286r. Topics at the Interface between Computer Science and Economics (Information, Prediction, and Collective Intelligence) (Fall 2012)

    CS 286r. Topics at the Interface between Computer Science and Economics (Computational Social Choice) (Fall 2011)

    This is a rotating topics course that studies the interplay between computation and economics. Topics covered include electronic commerce, computational social choice, computational mechanism design, peer production, prediction markets and reputation systems. The class is seminar style and...

    Read more about CS 286r. Topics at the Interface between Computer Science and Economics (Computational Social Choice) (Fall 2011)

    CS 136. Economics and Computation

    he interplay between economic thinking and computational thinking as it relates to electronic commerce, incentives engineering, and networked systems

    CS 221. Computational Complexity

    Computational complexity aims to understand the fundamental limitations and capabilities of efficient computation.  For example, which computational problems inherently require a huge running time to solve, no matter how clever an algorithm one designs? This most basic question of computational complexity is now understood to be both extremely difficult and of great importance, as demonstrated by all the attention given to the famous P vs. NP question.... Read more about CS 221. Computational Complexity

Pages