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, Bio-X
-
Faculty Affiliate, Institute for Human-Centered Artificial Intelligence (HAI)
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)
2024-25 Courses
- Applied Optimization
MS&E 114, MS&E 214 (Aut) - Networks
MS&E 135 (Win) -
Independent Studies (15)
- Advanced Reading and Research
CS 499 (Aut, Win, Spr) - Advanced Reading and Research
CS 499P (Aut, Win, Spr) - Curricular Practical Training
CS 390A (Aut, Win, Spr) - Curricular Practical Training
CS 390B (Aut, Win, Spr) - Curricular Practical Training
CS 390C (Aut, Win, Spr) - Directed Reading and Research
MS&E 408 (Aut, Win, Spr) - Independent Project
CS 399 (Aut, Win, Spr) - Independent Project
CS 399P (Aut, Win, Spr) - Independent Work
CS 199 (Aut, Win, Spr) - Independent Work
CS 199P (Aut, Win, Spr) - Master's Research
CME 291 (Aut, Win, Spr) - Part-time Curricular Practical Training
CS 390D (Aut, Win, Spr) - Programming Service Project
CS 192 (Aut, Win, Spr) - Senior Project
CS 191 (Aut, Win, Spr) - Writing Intensive Senior Research Project
CS 191W (Aut, Win, Spr)
- Advanced Reading and Research
-
Prior Year Courses
2023-24 Courses
- Advanced Applied Optimization
MS&E 214 (Spr) - Artificial Intelligence and Deliberative Democracy
MS&E 10SC (Sum) - Computational Social Choice
CS 366, MS&E 336 (Win) - Optimization and Algorithmic Paradigms
CS 261 (Aut)
2022-23 Courses
- Algorithms for Decentralized Finance
MS&E 339 (Aut) - Artificial Intelligence and Deliberative Democracy
MS&E 10SC (Sum) - Introduction to Optimization
ENGR 62, MS&E 111, MS&E 211 (Win)
2021-22 Courses
- Bridging Policy and Tech Through Design
CS 184 (Spr) - Computational Social Choice
CS 366, MS&E 336 (Aut) - Introduction to Optimization
ENGR 62, MS&E 111, MS&E 211 (Win) - Optimization and Algorithmic Paradigms
CS 261 (Spr)
- Advanced Applied Optimization
Stanford Advisees
-
Doctoral Dissertation Advisor (AC)
Mohak Goyal, Zhihao Jiang, Sahasrajit Sarmasarkar -
Master's Program Advisor
Elaine Chang, Eric Gao, Vedant Garg, Andrew Hong, Sri Jaladi, Trevor Leon, Jack Liu, Emily Molins, Dev Narang, Yusra O, Ethan Yuen -
Doctoral (Program)
Nishka Arora, Wenqian Xing
All Publications
-
Opinion Change or Differential Turnout: Austin’s Budget Feedback Exercise and the Police Department
EAAMO '22: Equity and Access in Algorithms, Mechanisms, and Optimization
2022
View details for DOI 10.1145/3551624.3555295
- 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 incentive-based 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 Self-Assembled Counters. and journal of natural compting 2007; 7 (3): 317-334
- Self-Assembling 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: Model-driven Optimization using Probes. 2006
- Pricing for fairness: distributed resource allocation for multiple objectives. 2006
- Truthful auctions for pricing search keywords. 2006
- Avoiding ballot-stuffing in eBay-like reputation systems. Third international workshop on economics of peer-to-peer systems 2005
- Multi-processor scheduling to minimize flow time with ε-resource augmentation. 2004
- Optimal self-assembly of counters at temperature two. 2004
- Set K-Cover Algorithms for Energy Efficient Monitoring in Wireless Sensor Networks. 2004
- Invadable Self-Assembly: Combining Robustness with Efficiency. 2004
- Sharp thresholds for monotone properties in random geometric graphs. 2004
- The Design of a Distributed Rating Scheme for Peer-to-peer Systems. Workshop on Economic Issues in Peer-to-Peer Systems 2003
- Oblivious AQM and Nash Equilibria. IEEE Infocom 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 03-786. 2003
- Simultaneous Optimization for Concave Costs: Single Sink Aggregation or Single Source Buy-at-Bulk. 2003
- Combinatorial optimization problems in self-assembly. 2002
- Energy-efficient Broadcast in Wireless Ad-hoc Networks: Lower bounds and Algorithms. Journal of Interconnection Networks 2002; 3-4 (3): 149-166
- SCADDAR: An Efficient Randomized Technique to Reorganize Continuous Media Blocks. 2002
- Exact Sampling of TCP Window States. IEEE Infocom 2002
- Using the Small-World Model to Improve Freenet Performance. IEEE Infocom 2002
- Reductions Among High Dimensional Proximity Problems. 2001
- Linear self-assemblies: Equilibria, entropy, and convergence rates. edited by Elaydi, Ladas, Aulbach 2001
- Exact sampling in machine scheduling problems. RANDOM 2001
- Source routing and scheduling in packet networks. IEEE Foundations of Computer Science 2001
- Efficient computation of delay-sensitive 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 self-assembled squares. 2001
- Combining Fairness with Throughput: Online Routing with Multiple Objectives. 2000
- Extending Greedy Multicast Routing to Delay Sensitive Applications. 2000
- Algorithms for Network Routing, Multicasting, Switching, and Design. Computer Science Department 1999
- Scheduling Data Transfers in a Network and the Set Scheduling Problem. 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
- Approximating arbitrary metrics by O(n log n) trees. IEEE Foundations of Computer Science 1998
- Online Throughput-Competitive Algorithm for Multicast Routing and Admission Control. 1998
- Rounding via trees: deterministic approximation algorithms for group Steiner trees and k-median. 1998
- Approximation Algorithms for Directed Steiner Problems. 1998