Fellowships

ARC supports competitive research projects put forth by graduate students.

Details of the fellowships awarded, listing student, semester, title, and advisor.
Student(s) Semester Awarded Fellowship Title Advisor(s)sort descending
Qie He, ISyE 2010 Fall A Polyhedral Study of Stochastic Integer Programming Shabbir Ahmed and George Nemhauser, ISyE
Zhehui Chen (ISyE) 2018 Spring Online Generalized Eigenvalue Decomposition: Min-max Formulation, Primal Dual Landscape and Efficient Optimization Tuo Zhao (ISyE)
Ravi S. Ganti CS 2010 Spring Design and Analysis of Local Kernel Machines Alexander G. Gray, CSE
Tianxin Tang (CS PhD, CS), ARC-IISP Fellowship 2016 Fall Keyless Fuzzy Search on Encrypted Data Alexandra Boldyreva
David Cash, CS 2009 Spring Circular-Secure Encryption from Learning Problems Alexandra Boldyreva, CS
Vinod Cheriyan, ISyE 2010 Fall A Model of Asset Price Bubbles that Shows Chaotic Dynamics Anton J. Kleywegt, ISyE and Federico Bonetto, Math
Rui Gao (ISyE) 2018 Spring Wasserstein Distributional Robustness and Generalization Anton Kleywegt (ISyE)
Robert Krone (Math) 2014 Spring Algorithms for Equivariant Ideals and Varieties Anton Leykin
Cristóbal Guzmán, ISyE 2013 Spring A New Model for Image Regularization Arkadi Nemirovski, ISyE
Sara Krehbiel (CS) 2014 Spring Paying for Privacy Chris Peikert
Abhishek Banerjee, CS 2011 Spring Efficient Cryptographic Pseudorandom Generators Chris Peikert, CS
Sara Krehbiel, ACO/CS 2011 Fall Threshold Lattice Cryptography Chris Peikert, CS
George Kerchev (Math) 2018 Spring Asymptotic behavior of the length of the longest common subsequence in hidden Markov models Christian Houdre (Math)
Sarah Miracle (CS) 2014 Spring Markov Chains to Model Segregation and Biased Surfaces Dana Randall
Prateek Bhakta (ACO PhD, CS) 2011 Fall Markov Chain Convergence in Discrete and Continuous Spaces Dana Randall
Prateek Bhakta (ACO PhD, CS) 2012 Fall Mixing Times of the Schelling Segretation Model and Biased Permutations Dana Randall
Amanda Pascoe 2009 Fall Cluster Algorithms for Discrete Models of Colloids Dana Randall, CS
Di Wu (OR PhD, ISyE) 2017 Spring Computing Budget Allocation Under Input Uncertainty Enlu Zhou
Andreas Galanis (CS) 2014 Spring Hardness of Approximately Counting Colorings Eric Vigoda
Linji Yang, CS 2011 Spring Analysis of the Hard-core Model on Square Lattices Beyond the Tree Uniqueness Threshold Eric Vigoda, CS
Da Kuang, CSE 2010 Spring Matrix Factorization for Clustering: NMF and Beyond Haesun Park, CSE
Adrian Rivera Cardoso (ISyE) 2018 Spring Online Risk Averse Minimization with Bandit Feedback Huan Xu (ISyE)
Jun-Kun Wang (CS) 2018 Spring Online Frank-Wolfe and its Application in Herding Jacob Abernethy (CS)
Marcel Celaya (ACO PhD, Math) 2017 Spring An Algorithmic Approach to the Gohberg-Markus-Hadwiger Conjecture Josephine Yu
Bo Xie (CSE) 2015 Fall Convergence of Non-Convex Optimization in Deep Learning Le Song
He Guo (Math) 2018 Spring Semi-Random Algorithmic Constructions Lutz Warnke (Math)
Andrew Massimino (ECE) 2014 Spring Constrained Adaptive Sensing Mark Davenport
Spencer Backman (Math) 2014 Spring A Complex Valued Hypergraph Laplachain Matt Baker
Farbod Shokrieh, Math/ECE 2010 Fall A Torelli Theorem and a New Set of Invariants for Graphs Matt Baker, Math
Farbod Shokrieh, Math 2012 Fall Random Basis Algorithm for Regular Matroids Matt Baker, Math
Gagan Goel, CS 2009 Spring Efficient Allocations when the Agents have Submodular Utility/Cost Function Milena Mihail and Vijay Vazirani
Uthaipon Tantipongpipat (CS) 2018 Spring Design and Analysis of Approximation Algorithms for Optimal Design Mohit Singh (ISyE)
Luyi Gui, ISyE 2009 Fall Collaboration Mechanism Design under Data Uncertainty in Multicommodity Flow Networks Ozlem Ergun
Ning Tan, ACO/Math 2011 Fall Constraint Satisfaction Problems with Global Constraints Prasad Raghavendra, CS
Emma Cohen (Math) 2015 Fall Mixing with Monotone Censoring Prasad Tetali
Ricardo Restrepo, Math 2009 Spring Reconstruction in Random Factor Graphs Prasad Tetali (GT Math) and Andrea Montanari (Stanford)
Ioannis Pannageas 2014 Fall Replicator dynamics, Equilibria and Diversity in Evolution Prasad Tetali (Math)
Ricardo Restrepo, Math 2011 Spring Spatial Mixing: Refinements and Applications Prasad Tetali, CS/Math
Ricardo Restrepo, Math 2010 Spring Convergence of Local Interactions in Catalan Structures Prasad Tetali, CS/Math
Arindam Khan 2012 Fall Algorithms for 3-D Geometric Bin Packing Prasad Tetali, CS/Math and Henrik I. Christensen, IC
Camilo Ortiz, ISyE 2011 Fall Implementation of Fast First-Order Methods for Solving Large-Scale Convex Optimization Problem Renato Monteiro, ISyE
Atish Das Sarma, CS 2009 Spring Efficient Approaches for Random Walks Richard J. Lipton, CS
Atish Das Sarma, CS 2009 Fall Walk Fast Distributively and Learn Despite Byzantine Failures Richard J. Lipton, CS
David Durfee (ACO PhD, CS) 2016 Fall Vertex Elimination Techniques and their Applications to Graph Algorithms Richard Peng
Chun-Hung Liu, Math 2013 Spring Well-quasi-ordering Graphs by the Immersion Relation Robin Thomas, Math
Chun-Hung Liu and Peter Whalen, Math 2011 Fall Tiny Robots: A Resource Allocation Problem Robin Thomas, Math
Burak Kocuk (ISyE) 2014 Fall A Polyhedral Study of DC Transmission Switching Problem Santanu Dey and Andy Sun (ISyE)
Diego Morán, ISyE 2013 Spring On Cutting Planes for Convex Mixed-integer Programs Santanu Dey, ISyE
Samira Samadi (CS PhD) ARC-IISP Fellowship 2017 Spring Human Computation with Application to Humanly Usable and Secure Password Methods Santosh Vempala
Kevin Lai (ACO PhD, CS) 2016 Fall Parameter Estimation for Mixtures of Gaussians with Adversarial Noise Santosh Vempala
Ben Cousins (ACO PhD, CS) 2016 Spring Theoretical and Applied Tools for High-dimensional Sampling Santosh Vempala
Ying Xiao, CS/ACO 2010 Fall Tensors and Random Constraint Satisfaction Problems Santosh Vempala, CS
Daniel Dadush, ISyE 2009 Fall Towards the KLS Conjecture for Convex Bodies Santosh Vempala, CS
Daniel Dadush, ISyE 2011 Fall Towards Faster Integer Programming Santosh Vempala, CS
Karthekeyan Chandrasekaran, CS/ACO 2010 Fall The Complexity of Cutting Plane Methods for Random Integer Programs Santosh Vempala, CS
Anand Louis, CS 2012 Fall A New Approach Towards Graph Coloring Santosh Vempala, CS and Prasad Tetali, Math
Anand Louis, CS 2011 Spring Towards a Spectral Algorithm for Small-set Expansion and Graph Multi-partitioning Santosh Vempala, Prasad Raghavendra, CS and Prasad Tetali, CS/Math
Aurko Roy (ISyE) 2014 Spring Learning a Polytope Sebastian Pokutta
Alfredo Torrico (OR PhD, ISyE) 2017 Spring Online Constrained Submodular Minimization with Bandit Feedback Sebastian Pokutta
Xie Weijun (ISyE) 2016 Spring On Distributionally Robust Joint Chance-Constrained Problems Shabbir Ahmed
Ezgi Karabulut (OR PhD, ISyE) 2016 Fall Auction Algorithms for Distributed Integer Programming Shabbir Ahmed and George Nemhauser
Gustavo Angulo (ISyE) 2014 Spring A polyhedral study of all-different polytopes Shabbir Ahmed and Santanu S. Dey
Guido Lagos (ISyE) 2014 Fall Exact Sampling of Random Walk Paths up to the Maximum Ton Dieker
Xuefeng Gao, ISyE 2011 Spring Capacity Allocation in Queueing Networks Ton Dieker
Xuefeng Gao (ISyE) 2010 Spring Capacity Allocation in Queueing Networks Ton Dieker, ISyE
Tung Mai (ACO PhD, CS), 2016 Fall Approximating the Non-symmetric Nash Social Welfare Vijay Vazirani
Sadra Yazdanbod (ACO PhD, CS) 2016 Spring A Market for Scheduling, with Applications to Cloud Computing Vijay Vazirani
Pushkar Tripathi, CS 2011 Fall Simple Randomized Algorithms for Assignment Problems Vijay Vazirani, CS
Stas Minsker, Math 2010 Fall Plug-in Approach to Active Learning Vladimir Koltchinskii, Math