Di Wang

Contact information

Telephone: 607-379-1538
Email:

I am a second year PhD student in Theoretical Computer Science at UC Berkeley, advised by Satish Rao. Before coming to Berkeley, I did my undergraduate studies in computer science at Cornell University, advised by Robert Kleinberg. My resume can be found here.

Research Interests

• Design and analysis of algorithms, especially graph and spectral algorithms
• Theoretical aspects of machine learning
• Social computation
• Online markets and algorithmic game theory

Papers

• Analyzing Quadratic Unconstrained Binary Optimization Problems Via Multicommodity Flows
  Di Wang and Robert Kleinberg.
  Discrete Applied Mathematics 157 (18) (2009) 3746-3753.

Links

• Dan Spielman's course on spectral graph theory
• The Design of Approximation Algorithms by David P. Williamson and David B. Shmoys
• Spectral Algorithms by Ravi Kannan and Santosh Vempala
• Stanford Network Analysis Platform (SNAP)
• Networks, Crowds, and Markets by David Easley and Jon Kleinberg
• Sanjeev Arora's course on learning theory