Previous Fellowships

How to apply for Spring 2012 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). In addition, one of the project advisors should submit a one-paragraph letter of recommendation (to be submitted separately from the proposal) in which (s)he succinctly argues that the student(s) and the project are worthy of support. 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. Please see the ARC webpages for previously funded projects.

A proposal should describe a focused research problem, and its importance and significance should be made evident to non-expert readers. It should also contain a clear description of the approach to be taken, make a convincing case that this approach is particularly attractive, and detail potential research outcomes. Proposals should describe well-developed ideas which can be explored further during at least one semester. Proposals that are precise in explaining the problem(s) (for example which include sufficient mathematical details to state the problem) and also which are well-motivated and are clearly understandable by non-experts have been most successful in the past. Students are strongly encouraged to have their advisor(s) review the proposal before submitting it.

Funding decisions will be made by the ARC committee consisting of Alexandra Boldyreva, CS; Santanu Dey, ISYE; Ton Dieker (chair), ISYE; Vladimir Koltchinskii, Mathematics; Milena Mihail, CS; and Dana Randall, CS and Math (Adjunct). Applications and advisor's paragraphs should be sent by email to Elizabeth Ndongi (ndongi@cc.gatech.edu) no later than 20 October, 2011. 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 a preceding semester (SPRING/FALL), 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.

Spring 2011 Fellowships

• Abhishek Banerjee, CS (mentor: Chris Peikert, CS) "Efficient Cryptographic Pseudorandom Generators"
• Anand Louis, CS (mentors: Santosh Vempala, Prasad Raghavendra, CS and Prasad Tetali, Math+CS) "Towards a spectral algorithm for Small-set expansion and Graph multi-partitioning"
• Ricardo Restrepo, Math (mentor: Prasad Tetali, Math+CS) "Spatial mixing: Refinements and Applications"
• Linji Yang, CS (mentor: Eric Vigoda, CS) "Analysis of the Hard-core Model on Square Lattices beyond the Tree Uniqueness Threshold"

Fall 2010 Fellowships

• Karthik Chandrasekaran, CS/ACO (mentor: Santosh Vempala, CS) "The Complexity of Cutting Plane Methods for Random Integer Programs"
• Vinod Cheriyan, ISYE, (mentor: Anton J. Kleywegt, ISYE; Federico Bonetto, Math) - "A Model of Asset Price Bubbles that Shows Chaotic Dynamics"
• Qie He, ISYE, (mentors: Shabbir Ahmed; George Nemhauser, ISYE) "A Polyhedral Study of Stochastic Integer Programming
• Stas Minsker, Math, (mentor: Vladimir Koltchinskii, Math) "Plug-in Approach to Active Learning"
• Farbod Shokrieh, Math/ECE (mentor: Matt Baker, Math) "A Torelli Theorem and a New Set of Invariants for Graphs"
• Ying Xiao, CS/ACO, (mentor: Santosh Vempala, CS) "Tensors and Random Constraint Satisfaction Problems"

Spring 2010 Fellowships

• Da Kuang (CSE), Matrix Factorization for Clustering: NMF and Beyond (Mentor: Haesun Park)
  
• Karthik Chandrasekaran (CS/ACO), A probabilistic analysis for the Feedback Vertex Set problem: (Mentor Santosh Vempala)
  
• Ravi Ganti (CS), Design and Analysis of Local Kernel Machines (Mentor Alex Gray)
  
• Ricardo Restrepo (Math), Convergence of local interactions in catalan structures (Mentor Prasad Tetali)
  
• Xuefeng Gao (ISYE), Capacity Allocation in Queueing Networks (Ton Dieker)