Ashish Goel
Professor of Management Science and Engineering and, by courtesy, of Computer Science
Bio
Ashish Goel is a Professor of Management Science and Engineering and (by courtesy) Computer Science at Stanford University. He received his PhD in Computer Science from Stanford in 1999, and was an Assistant Professor of Computer Science at the University of Southern California from 1999 to 2002. His research interests lie in the design, analysis, and applications of algorithms.
Academic Appointments

Professor, Management Science and Engineering

Professor (By courtesy), Computer Science

Member, BioX
Honors & Awards

Sloan Research Fellowship, Alfred P. Sloan Foundation

Frederick E. Terman Fellow, Stanford University

CAREER Award, National Science Foundation (2002)
Professional Education

PhD, Stanford University, Computer Science (1999)
201920 Courses
 Computational Social Choice
MS&E 336 (Win)  Introduction to Optimization
ENGR 62, MS&E 111, MS&E 211 (Spr)  Senior Project
MS&E 108 (Win)  The Socioeconomic Impact of the Novel Coronavirus on the Developing World
MS&E 433 (Spr) 
Independent Studies (19)
 Advanced Reading and Research
CS 499 (Aut, Win, Spr, Sum)  Advanced Reading and Research
CS 499P (Aut, Win, Spr, Sum)  Advanced Reading and Research
SCCM 499 (Win, Sum)  Computer Laboratory
CS 393 (Aut, Win, Spr, Sum)  Curricular Practical Training
CS 390A (Aut, Win, Spr, Sum)  Curricular Practical Training
CS 390B (Aut, Win, Spr, Sum)  Curricular Practical Training
CS 390C (Aut, Win, Spr, Sum)  Directed Reading and Research
MS&E 408 (Aut, Win, Spr, Sum)  Independent Database Project
CS 395 (Aut, Win, Spr, Sum)  Independent Project
CS 399 (Aut, Win, Spr, Sum)  Independent Project
CS 399P (Aut, Win, Spr, Sum)  Independent Work
CS 199 (Aut, Win, Spr, Sum)  Independent Work
CS 199P (Aut, Win, Spr, Sum)  Master's Research
CME 291 (Win, Spr)  Parttime Curricular Practical Training
CS 390D (Aut, Win, Spr)  Programming Service Project
CS 192 (Aut, Win, Spr, Sum)  Senior Project
CS 191 (Aut, Win, Spr, Sum)  Supervised Undergraduate Research
CS 195 (Spr)  Writing Intensive Senior Project (WIM)
CS 191W (Aut, Win, Spr)
 Advanced Reading and Research

Prior Year Courses
201819 Courses
 Introduction to Optimization
ENGR 62, MS&E 111, MS&E 211 (Spr)  Optimization and Algorithmic Paradigms
CS 261 (Win)  Topics in Social Algorithms
MS&E 332 (Spr)
201617 Courses
 Introduction to Optimization
ENGR 62, MS&E 111 (Spr)  Optimization and Algorithmic Paradigms
CS 261 (Win)
 Introduction to Optimization
Stanford Advisees

Doctoral Dissertation Reader (AC)
Vivek Bagaria, Suleyman Kerimov 
Doctoral Dissertation Advisor (AC)
Nikhil Garg, Lodewijk Gelauff, Sukolsak Sakshuwong 
Master's Program Advisor
Asrat Alemu, Nicolas Hochschild, Shivani Joshi, Hao Li, Dianelys Perez Morales, Aarya Suryavanshi, Caterina Wu 
Doctoral (Program)
Ben Plaut, Geoff Ramseyer
All Publications
 Fast Incremental and Personalized PageRank. To appear in VLDB 2011
 Liquidity in Credit Networks: A Little Trust Goes a Long Way. Preliminary version presented at NetEcon 2010
 Similarity Search and Locality Sensitive Hashing using TCAMs. ACM SIGMOD 2010
 Hybrid keyword search auctions. 2009
 An incentivebased architecture for social recommendations. RecSys 2009
 Towards programmable molecular machines. Presented (by Holin) at FNANO 2008
 Reducing Maximum Stretch in Compact Routing. IEEE Infocom 2008
 Advertisement Allocation for Generalized Second Pricing Schemes. fourth Workshop on Ad Auctions 2008
 Toward Minimum Size SelfAssembled Counters. and journal of natural compting 2007; 7 (3): 317334
 SelfAssembling Tile Systems that Heal from Small Fragments. Presented at the thirteenth International meeting on DNA based computers (DNA), (winner of the best student paper award – congratulations, Holin and Chris). 2007
 Asking the right questions: Modeldriven Optimization using Probes. 2006
 Pricing for fairness: distributed resource allocation for multiple objectives. 2006
 Truthful auctions for pricing search keywords. 2006
 Avoiding ballotstuffing in eBaylike reputation systems. Third international workshop on economics of peertopeer systems 2005
 Multiprocessor scheduling to minimize flow time with εresource augmentation. 2004
 Optimal selfassembly of counters at temperature two. 2004
 Set KCover Algorithms for Energy Efficient Monitoring in Wireless Sensor Networks. 2004
 Invadable SelfAssembly: Combining Robustness with Efficiency. 2004
 Sharp thresholds for monotone properties in random geometric graphs. 2004
 The Design of a Distributed Rating Scheme for Peertopeer Systems. Workshop on Economic Issues in PeertoPeer Systems 2003
 Incrementally Improving Lookup Latency in Distributed Hash Table Systems. ACM Sigmetrics, A more complete version with proofs is available as USC Computer Science technical report 03786. 2003
 Oblivious AQM and Nash Equilibria. IEEE Infocom 2003
 Simultaneous Optimization for Concave Costs: Single Sink Aggregation or Single Source BuyatBulk. 2003
 Exact Sampling of TCP Window States. IEEE Infocom 2002
 Using the SmallWorld Model to Improve Freenet Performance. IEEE Infocom 2002
 Energyefficient Broadcast in Wireless Adhoc Networks: Lower bounds and Algorithms. Journal of Interconnection Networks 2002; 34 (3): 149166
 SCADDAR: An Efficient Randomized Technique to Reorganize Continuous Media Blocks. 2002
 Combinatorial optimization problems in selfassembly. 2002
 Reductions Among High Dimensional Proximity Problems. 2001
 Exact sampling in machine scheduling problems. RANDOM 2001
 Source routing and scheduling in packet networks. IEEE Foundations of Computer Science 2001
 Linear selfassemblies: Equilibria, entropy, and convergence rates. edited by Elaydi, Ladas, Aulbach 2001
 Efficient computation of delaysensitive routes from one source to all destinations. IEEE Infocom 2001
 Using approximate majorization to characterize protocol fairness. This is the full version of a poster paper in ACM SIGMETRICS, and does not actually appear in print anywhere. 2001
 Running time and program size for selfassembled squares. 2001
 Extending Greedy Multicast Routing to Delay Sensitive Applications. 2000
 Combining Fairness with Throughput: Online Routing with Multiple Objectives. 2000
 Algorithms for Network Routing, Multicasting, Switching, and Design. Computer Science Department 1999
 Stochastic Load Balancing and Related Problems. In IEEE Foundations of Computer Science 1999
 Stochastic Analysis of Stable Marriages in Combined Input Output Queued Switches. 1999
 Scheduling Data Transfers in a Network and the Set Scheduling Problem. 1999
 Approximating arbitrary metrics by O(n log n) trees. IEEE Foundations of Computer Science 1998
 Online ThroughputCompetitive Algorithm for Multicast Routing and Admission Control. 1998
 Rounding via trees: deterministic approximation algorithms for group Steiner trees and kmedian. 1998
 Approximation Algorithms for Directed Steiner Problems. 1998