SCS Ph.D. Graduation 2019

Doctoral Degrees Conferred

Academic Year: 2014-2015
Name Thesis Advisor(s) Thesis Title
Michelle Leah Goodstein Todd Mowry Dataflow Analysis-Based Dynamic Parallel Monitoring
Jennifer Hyde Jessica Hodgins, Sara Kiesler Designing Animated Human Characters as Conversational Partners: The Effect of Facial Expressiveness on Social Outcomes
Anvesh Komuravelli Edmund Clarke Compositional Verification with Abstraction, Learning, and SAT Solving
Jayant Krishnamurthy Tom Mitchell Learning to Understand Natural Languages with Less Human Effort
Seunghak Lee Eric Xing Structured Sparse Models and Algorithms for Genetic Analysis
Brendan Meeder Manuel Blum, Luis Von Ahn Network Structure and its Influence on User Behavior
Jamie Morgenstern Avrim Blum, Frank Pfenning Market Algorithms: Incentives, Learning, and Privacy
Ankit Sharma Avrim Blum, Anupam Gupta Resource Allocation under Incentive, Information, and Complexity Constraints
Julian Shun Guy Blelloch Shared Memory Parallelism Can Be Simple, Fast, and Scalable
Matthew Luchak Stanton Adrien Treuille, Kayvon Fatahalian Data-Driven Methods for Interactive Simulation of Complex Phenomena
Leigh Ann Sudol-DeLyser Mark Stehlik, Sharon Carver AbstractTutor: Increasing Algorithm Implementation Expertise for Novices Through Algorithmic Feedback
Ekaterina Taralova Martial Hebert, Fernando De la Torre Feature Quantization and Pooling for Videos
Bernardo Parente Coutinho Fernandes Toninho Frank Pfenning, Luis Caires A Logical Foundation for Session-based Concurrent Copmutation
Yuan Zhou Venkatesan Guruswami, Ryan O'Donnell New Directions in Approximation Algorithms and Hardness of Approximation
Academic Year: 2013-2014
Name Thesis Advisor(s) Thesis Title
Bin Fan David G. Andersen Algorithmic Engineering Towards More Efficient Key-Value Systems
Bin Fu Jaime Carbonell, Eugene Fink Algorithms for Large-Scale Astronomical Problems
Anshul Gandhi Mor Harchol-Balter Dynamic Server Provisioning for Data Center Power Management
Alexander Grubb J. Andrew Bagnell Anytime Prediction: Efficient Ensemble Methods for Any Computational Budget
Severin Benedict Hans Hacker Roger Dannenberg Duolingo: Learning a Language While Translating the Web
Ning Hu Roger Dannenberg Automatic Construction of Synthetic Musical Instruments and Performers
Gunhee Kim Eric Xing Reconstruction and Applications of Collective Storylines from Web Photo Collections
William Klieber Ed Clarke Formal Verification Using Quantified Boolean Formulas (QBF)
Aapo Kyrola Guy Blelloch, Carlos Guestrin Large-scale Graph Computation on Just a PC
Nan Li William Cohen, Kenneth Koedinger Integrating Representation Learning and Skill Learning in a Human-Like Intelligent Agent
Jialiu Lin Jason Hong, Norman Sadeh Understanding and Capturing People's Mobile App Privacy Preferences
Iulian Moraru David Andersen Egalitarian Distributed Consensus
Richard Peng Gary Miller Algorithm Design Using Spectral Graph Theory
Pongsin Poosankam Dawn Song Scaling Dynamic Symbolic Execution of Binary Programs for Security Applications
Or Sheffet Avrim Blum Beyond Worst-Case Analysis in Privacy and Clustering: Exploiting Explicit and Implicit Assumptions
Harsha Vardhan Simhadri Guy Blelloch Program-Centric Cost Models For Locality and Parallelism
Jiří Šimša Randal Bryant, Garth Gibson Systematic and Scalable Testing of Concurrent Programs
Academic Year: 2012-2013
Name Thesis Advisor(s) Thesis Title
Leman Akoglu Christos Faloutsos Mining and Modeling Real-world Networks: Patterns, Anomalies, and Tools
Khalid El-Arini Carlos Guestrin Beyond Keyword Search: Representations and Models for Personalization
Dongsu Han Srinivasan Seshan Supporting Long Term Evolution in an Internet Architecture
Sue Ann Hong Geoffrey Gordon Distributed Market-Based Algorithms for Multi-Agent Planning with Shared Resources
Neelakantan R. Krishnaswami Stephen Brookes, John Reynolds Verifying Higher-Order Imperative Programs with Higher-Order Separation Logic
Steven Okamoto Katia Sycara Allocating Virtual and Physical Flows for Multiagent Teams in Mutable, Networked Environments
Swapnil Patil Garth Gibson Scale and Concurrency of Massive File System Directories
Amar Phanishayee David Andersen Chaining For Flexible And High-Performance Key-Value Systems
B. Aditya Prakash Christos Faloutsos Understanding and Managing Propagation on Large Neworks-Theory, Algorithms, and Models
Olatunji O. Ruwase Todd Mowry Improving Device Driver Reliability through Decoupled Dynamic Binary Analysis
Dafna Shahaf Carlos Guestrin Automatic Generation of Issue Maps: Structured, Interactive Outputs for Complex Information Needs
Robert J. Simmons Frank Pfenning Substructural Logical Specifications
Kami Vaniea Lorrie Cranor, Lujo Bauer Proximity Displays for Access Control
Academic Year: 2011-2012
Name Thesis Advisor(s) Thesis Title
Eric Blais Ryan O'Donnell Testing Properties of Boolean Functions
Jason Douglas Franklin Anupam Datta Abstractions for Model Checking System Security
Anthony Gitter Ziv Bar-Joseph Identifying the Signaling Cascades and Regulatory Mechanisms that Control Stress Responses
Fan Guo Christos Faloutsos Mining and Querying Multimedia Data
U Kang Christos Faloutsos Mining Tera-Scale Graphs: Theory, Engineering and Discoveries
Kevin S. Killourhy Roy Maxion A Scientific Understanding of Keystroke Dynamics
Ravishankar Krishnaswamy Anupam Gupta Approximation Techniques for Stochastic Combinatorial Optimzation Problems
Lei Li Christos Faloutsos Fast Algorithms for Mining Co-evolving Time Series
Abraham Othman Tuomas Sandholm Automated Market Making: Theory and Practice
Stephanie L. Rosenthal Anind Dey, Manuela M. Veloso Human-Centered Planning for Effective Task Autonomy
Donald R. Sheehy Gary Miller Mesh Generation and Geometric Persistent Homology
Ali Kemal Sinop Venkatesan Guruswami, Ryan O'Donnell Graph Partitioning and Semi-definite Programming Hierarchies
Ronit Slyper Jessica Hodgins Sensing Through Structure
Kyung-Ah Sohn Eric P. Xing Learning Ancestral Genetic Processes using Nonparametric Bayesian Models
Kanat Tangwongsan Guy Blelloch, Anupam Gupta Efficient Parallel Approximation Algorithms
Michael Carl Tschantz Anupam Datta, Jeannette Wing Formalizing and Enforcing Purpose Restrictions
Vijay R. Vasudevan David Andersen Energy-efficient Data-intensive Computing with a Fast Array of Wimpy Nodes
Matthew Wachs Greg Ganger Performance Insulation: more predictable shared storage
Xin Zhang Hui Zhang, Adrian Perrig Secure and Efficient Network Fault Localization
Academic Year: 2010-2011
Name Thesis Advisor(s) Thesis Title
Sarah Aboutalib Manuela Veloso Multiple-Cue Object Recognition for Interactionable Objects
Mukesh Agrawal Srinivasan Seshan Spare a Little Change? Towards a 5-Nines Internet in 250 Lines of Code
Debabrata Dash Anastasia Ailamaki Automated Physical Design: A Combinatorial Optimzation Approach
Michael Dinitz Anupam Gupta Algorithms and Models for Problems in Networking
Varun Gupta Mor Harchol-Balter Stochastic Models and Analysis for Resource Management in Server Farms
Sumit Kumar Jha Chrisopher J. Langmead Model Validation and Discovery for Complex Stochastic Systems
Hetunandan Kamichetty Chris J. Langmead, Eric P. Xing Structured Probabilistic Models of Proteins across Spatial and Fitness Landscapes
Hyang-Ah Kim David R. O’Hallaron, Peter Steenkiste Privacy-Preserving Distributed, Automated Signature-Based Detection of New Internet Worms
Ruy Ley-Wild Guy Blelloch Programmable Self-Adjusting Computation
Daniel R. Licata Robert Harper Dependently Typed Programming with Domain-Specific Logics
Xi Liu Srinivasan Seshan, Peter Steenkiste Maximizing Spatial Reuse in Indoor Environments
William Lovas Frank Pfenning Refinement Types for Logical Frameworks