Aviad Rubinstein
Assistant Professor of Computer Science
2024-25 Courses
- Design and Analysis of Algorithms
CS 161 (Aut) - Incentives in Computer Science
CS 269I, MS&E 206 (Spr) -
Independent Studies (8)
- 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) - Independent Project
CS 399 (Aut, Win, Spr) - Independent Work
CS 199 (Aut, Win, Spr) - Part-time Curricular Practical Training
CS 390D (Aut, Win, Spr) - Research
PHYSICS 490 (Aut, Win, Spr)
- Advanced Reading and Research
-
Prior Year Courses
2023-24 Courses
- Design and Analysis of Algorithms
CS 161 (Aut) - Incentives in Computer Science
CS 269I, MS&E 206 (Spr)
2022-23 Courses
- Design and Analysis of Algorithms
CS 161 (Aut) - Incentives in Computer Science
CS 269I (Win)
2021-22 Courses
- Design and Analysis of Algorithms
CS 161 (Aut) - Problem-Solving Lab for CS161
CS 161A (Aut) - Topics in Intractability: Unfulfilled Algorithmic Fantasies
CS 354 (Win)
- Design and Analysis of Algorithms
Stanford Advisees
-
Doctoral Dissertation Reader (AC)
Dorsa Fathollahi -
Doctoral Dissertation Advisor (AC)
Mohammad Roghani -
Master's Program Advisor
Nolawi Ayelework, Sidhant Bansal, Naama Bejerano, Winnie Chow, Hongyue Li, Peter Ling, Jasdeep Sidhu -
Doctoral Dissertation Co-Advisor (AC)
Jabari Hastings -
Doctoral (Program)
Ruiquan Gao, Xiao Mao, Jack Zhou
All Publications
-
An Optimal Approximation for Submodular Maximization Under a Matroid Constraint in the Adaptive Complexity Model
OPERATIONS RESEARCH
2021
View details for DOI 10.1287/opre.2021.2170
View details for Web of Science ID 000737449800001
-
Does Preprocessing Help in Fast Sequence Comparisons?
ASSOC COMPUTING MACHINERY. 2020: 657–70
View details for DOI 10.1145/3357713.3384300
View details for Web of Science ID 000614624700053
-
Smoothed Complexity of 2-player Nash Equilibria
IEEE. 2020: 271-282
View details for DOI 10.1109/FOCS46700.2020.00034
View details for Web of Science ID 000652333400026
-
The Randomized Communication Complexity of Revenue Maximization
ACM SIGECOM EXCHANGES
2021; 19 (2): 75-83
View details for Web of Science ID 000727767800005
-
Constant-Factor Approximation of Near-Linear Edit Distance in Near-Linear Time For
ASSOC COMPUTING MACHINERY. 2020: 685–98
View details for DOI 10.1145/3357713.3384282
View details for Web of Science ID 000614624700055
-
Communication complexity of Nash equilibrium in potential games (extended abstract)
IEEE. 2020: 1439-1445
View details for DOI 10.1109/FOCS46700.2020.00137
View details for Web of Science ID 000652333400127
-
Reducing approximate Longest Common Subsequence to approximate Edit Distance
ASSOC COMPUTING MACHINERY. 2020: 1591–1600
View details for Web of Science ID 000554408101042
-
Reductions in PPP
INFORMATION PROCESSING LETTERS
2019; 145: 48–52
View details for DOI 10.1016/j.ipl.2018.12.009
View details for Web of Science ID 000461533600009
-
Approximation Algorithms for LCS and LIS with Truly Improved Running Times
IEEE COMPUTER SOC. 2019: 1121–45
View details for DOI 10.1109/FOCS.2019.00071
View details for Web of Science ID 000510015300062
-
An Optimal Approximation for Submodular Maximization under a Matroid Constraint in the Adaptive Complexity Model
ASSOC COMPUTING MACHINERY. 2019: 66–77
View details for DOI 10.1145/3313276.3316304
View details for Web of Science ID 000523199100007
-
Near-Linear Time Insertion-Deletion Codes and (1+epsilon)-Approximating Edit Distance via Indexing
ASSOC COMPUTING MACHINERY. 2019: 697–708
View details for DOI 10.1145/3313276.3316371
View details for Web of Science ID 000523199100063
-
Satisfiability and Evolution
IEEE. 2014: 524–30
View details for DOI 10.1109/FOCS.2014.62
View details for Web of Science ID 000366324300054