Qi Ge ()

Room 728, Computer Studies Building
Department of Computer Science
University of Rochester
Rochester, NY 14627-0226

Office phone number: (585) 275-9499
Email: qge (at) cs (dot) rochester (dot) edu

I'm a Ph.D. candidate, supervised by Prof. Daniel Stefankovic, in the theory group at UofR. My research interests focus on the design and analysis of efficient algorithms and computational complexity theory. I'm now working on designing efficient (randomized) algorithms, especially by using Markov chain Monte Carlo methods, for counting problems (generally partition functions of weighted combinatorial structures), and the complexity (mainly with respect to approximability) of these counting problems. I received my B.S. and M.S. in Department of Computer Science and Engineering from Fudan University in 2003 and 2006, respectively.

Publications

My DBLP link

Teaching

  • Summer 2009
  • Fall 2008
    • CSC 486 Computational Complexity (TA)
      Office hours: M/W 3:15pm-4:15pm, Tu 5:00pm-6:00pm, F 3:00pm-4:00pm
      Review session: Th 3:30pm-4:30pm (in CSB 632)
  • Spring 2008
    • CSC 484 Advanced Algorithms (TA)
      Office hours: Wednesday 11am-12noon, Friday 11am-12noon.
  • Fall 2007
    • CSC 282 Design and Analysis of Efficient Algorithms (TA)
      Office hours: Monday 4pm-5pm, Wednesday 4pm-5pm.

Courses

  • Spring 2008
    • CSC 458 Parallel & Distributed Systems
  • Fall 2007
    • CSC 448 Statistical Speech and Language Processing
    • CSC 487 Advanced Modes of Computation
  • Spring 2007
    • CSC 446 Mathematical Foundations of Artificial Intelligence
    • CSC 456 Operating Systems
    • CSC 484 Advanced Algorithms
  • Fall 2006

Links


Last updated: Oct. 19, 2009