Faculty

Michelangelo Grigni
Associate Professor
Office: W426
Phone: 404-727-7922
Research groups: Discrete Mathematics & Theoretical Computer Science
Office hours
  • Monday: 8:30am - 11:30am
  • Wednesday: 8:30am - 11:30am
  • Friday: 8:30am - 11:30am
  • and by appointment
Teaching: Spring 2010
  • CS 153 (000): Computing for Bioinformatics, MWF 12:50pm - 1:40pm
  • CS 526 (000): Algorithms, MWF 10:40am - 11:30am
Research
  • Theory of Computation, Circuit Complexity, Geometric Algorithms, Approximation Algorithms
Recent publications
  • Michelangelo Grigni, Vincent Mirelli, and Christos Papadimitriou. On the difficulty of designing good classifiers. SIAM Journal on Computing, 30(1):318-323, 2000. Michelangelo Grigni. Approximate TSP in graphs with forbidden minors. In 27th International Colloqium on Automata, Languages and Programming (ICALP), v.510 of Lecture Notes in Computer Science, pp 869-877, July 2000. Michelangelo Grigni, Stefan Boettcher, and Allon Percus. Optimizing through co-evolutionary avalanches. In 6th International Conferences on Parallel Problem Solving from Nature (PPSN), 2000. A Sperner lemma complete for PPA. Information Processing Letters, v.77(5-6), pp 255-259, March 2001. Michelangelo Grigni, Leonard J. Schulman, Monica Vazirani, and Umesh Vazirani. Quantum mechanical algorithms for the nonabelian hidden subgroup problem. In 33rd Annual ACM Symposium on the Theory of Computing (STOC), 2001.
Education
  • Ph.D. (1991) Massachusetts Institute of Technology (Applied Mathematics)
Activities
  • Member: ACM, AMS