ARC Student Fellowships
How to apply for Spring 2010 Funding:
Interested students should submit a brief (2 page maximum) description of a research project, including its goal(s) and proposed approach, and indicating the mentor(s)/advisor(s). Research topics in the broad areas of algorithms, randomness and complexity are suitable and could range from purely theoretical investigations to system building based on new algorithmic ideas. Projects could be based on collaborative efforts between two or more groups/faculty members.
Funding decisions will be made by the ARC committee consisting of Bill Cook, Chandler family Professor, ISYE; Ton Dieker, Asst. Professor, ISYE; Vladimir Koltchinskii, Professor, Mathematics; Milena Mihail, Assoc. Professor, CS; Prasad Tetali (chair), Professor, Mathematics and CS; and Eric Vigoda, Professor, CS. Applications should be sent by email to Elizabeth Ndongi (ndongi@cc.gatech.edu) no later than Monday, Oct 26th, 2009 at noon. Preference will be given to projects that are in line with ARC's mission and typical awards will be matching grants, i.e., the mentor/advisor supports half an RA and ARC provides the other half. The committee's general policy is to pick the best applications. However, if a student already received ARC funding in the current academic year, then he/she would have lower priority than others who have not been funded by ARC in the current year, but are judged worthy of funding.
The following projects were funded for Fall, 2009:
Amanda Pascoe (Math), Cluster Algorithms for Discrete Models of Colloids (Mentor - D. Randall)
How to apply for Fall 2009 Funding:
Interested students should submit a brief (2 pages) description of a research problem/project and indicate their faculty mentor(s). A mentor does not have to be the student's advisor.
Funding decisions will be made by a committee. Applications should be sent by email to Elizabeth Ndongi only (ndongi@cc.gatech.edu) no later than July 27, 2009 with "Fellowship application" as the subject header.
Preference will be given to projects that are in line with ARC's mission (http://www.arc.gatech.edu) and typical awards will be matching grants, i.e., the mentor/advisor supports half an RA and ARC provides the other half.
The following projects were funded for Spring, 2009:
David Cash, CS (Mentor Boldyreva) - Circular-Secure Encryption from Learning Problems
Ricardo Restrepo, Math (Mentor Tetali) - Reconstruction in Random Factor Graphs
Atish Das Sarma, CS (Mentor Lipton) - Efficient Approaches for Random Walks
The following projects were funded in Summer, 2008:
Georgios Amanatidis, Math (Mentor Milena Mihail) - Models for Routing and Social Complex Networks
Deeparnab Chakrabarty, CS (Mentor Vijay Vazirani) - Budget-Constrained Auctions
Sam Greenberg, Math (Mentor Dana Randall) - Random Sampling via Geometric Coupling
Kael Stilp, ISYE (Mentor Ozlem Ergun) -
Searching for the Core with Column Generation
The following projects were funded in Spring 2008:
Shiva Kintali Prasad (Mentor: H. Venkateswaran) - routing protocol
Justin Melvin (Mentor: M. Furst) - protein structure/hit-and-run sampling
Anirudh Ramachandran (Mentor: N. Feamster/S. Vempala) - spam filtering
