Mic's Advisees

Undergraduate CS Majors

I am a CS major advisor. Students preregister through OPUS, but they should first consult their academic advisors for any necessary advice regarding their majors. Consult the registrar for details on registration (like the bidding schedules).

Undergraduate Math Majors

I arrange the Putnam Mathematics Competition at Emory; this is a national six-hour exam on the first Saturday of December. I also arrange the VTRMC, a somewhat easier regional exam in November. These exams target ambitious undergraduates (like: already interested in mathematical contests, or planning a career in mathematical research). I keep some relevant files here, let me know if you are interested.

Undergraduate Research

For undergraduates, the main research opportunities are honors theses, BS/MS theses, summer projects (including SURE), and directed study (497R). If you are an undergraduate interested in some sort of directed research concerning computation (algorithms, information, etc), let me know.

Graduate Research

My previous graduate students have been mostly CS Master's students, and one Math Ph.D:

Keven S. Haynes, CS MS, April 1998, "The Feasibility of an Approximation Algorithm for the Traveling Salesman Problem"
Andrzej P. Woloszyn, CS MS, June 1998, "Weighted Planar Graph Separator"
Baiyu Pan, CS MS, April 1999, "Content-Sensitive Implicit X Compression"
Malgorata (Maggie) Malowinska, CS MS, May 1999, "An Implementation of a Multi-round Algorithm for Synchronizing Files over a Communication Link"
Benjamin Bradford, CS BS/MS, November 2000, "A Refinement Algorithm for the Multiple Alignment of Protein Sequences"
Tao Xu, CS MS, Spring 2002, "Data Structures for Extremal Optimization"
Papa Amar Sissokho, Math Ph.D., June 2003, "Light Spanners and Sparse Pseudorandom Graphs" (co-advised with V. Rödl)
Adam Sherwood, CS BS/MS, Spring 2004, "An Efficient Implementation of Suffix Trees Indexing the Human Genome"
Shufu Xu, CS MS, Summer 2004, "An Improvement to the BitTorrent Peer-to-peer Protocol"
Yogya Sharma, CS MS, Fall 2005, "A Well-Connected Separator for Planar Graphs"
Andre Berger, Math Ph.D., expected summer 2006 (co-advised with O. Parekh)

In general I welcome students with some kind of theoretical interest (algorithms, communication, circuits, etc). M.S. projects may still be quite practical, as the above list shows.

Home. Comments? Last Modified: 14 Feb 2006