See How Your Research Aligns
Create a free account to analyze your research alignment,
identify potential research gaps, and generate personalized
application documents for this professor.
Create Free Account
Aviad Rubinstein
Game-Theoretic Computation
Computational Complexity Theory
Algorithmic Mechanism Design
Computational Economics
About
Aviad Rubinstein is an Assistant/Associate Professor of Computer Science at Stanford University. He is a theoretical computer scientist whose research focuses on algorithms, computational complexity, and game-theoretic computation, exploring the limits of efficient computation and its applications to economics and decision-making. He earned his Ph.D. from UC Berkeley, receiving the 2017 ACM Doctoral Dissertation Award, and has been recognized with a Sloan Research Fellowship. At Stanford, he teaches courses on algorithms and computational incentives and leads research at the intersection of theory and practical computation.
Research Performance Summary
2007-2026
Active Research Span
First Recorded Paper
Determining sets for the discrete Laplacian
Year:
2007
Citations:
3
Venue:
SIAM review 49 (2)
Latest Recorded Paper
When contracts get complex: Information-theoretic barriers
Year:
2026
Citations:
3
Venue:
Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms
Last 10 Years Publication Activity
This timeline shows the professor's yearly publication activity.
Publication Venues and Collaboration
Journal, Conference, and Book Publication Breakdown
Top Coauthors
Rubinstein
Papadimitriou
Zhao
Research Impact by Period
Papers
7
Citations
65
Avg. Citations / Paper
9.3
H-Index
3
Papers
45
Citations
645
Avg. Citations / Paper
14.3
H-Index
14
Papers
46
Citations
2638
Avg. Citations / Paper
57.3
H-Index
28
Papers
8
Citations
259
Avg. Citations / Paper
32.4
H-Index
6
Papers
1
Citations
3
Avg. Citations / Paper
3
H-Index
1
Contact and Professional Links
Detected Research Keywords
Constant Factor Approximation
Dynamic Mechanism Design
Zero Sum Games
Player Nash Equilibria
Distributed Pcp Theorems
Pcp Theorems Hardness
Theorems Hardness Approximation
Complexity Approximate Nash
Approximate Nash Equilibria
Local Computation Algorithms