I am a lecturer at the University of Southern California.
Office: SAL 204
I plan to be in or near my office the following weekly hours during the Spring 2018 semester:
During these hours, course-related material will have priority over other items. On Tuesdays and Wednesdays, priority will be given to undergraduate classes. I am happy to make private appointments to meet with students as needed.
- Monday 11:30 - 12:30
- Tuesday 2:30 - 3:30
- Wednesday 10:30 - 11:30
To form my email address, concatenate my last name with [at] usc [dot] edu
My recent research focuses primarily on educational issues in computer science; in the past, my work touched on computations on large datasets, machine learning, approximation algorithms, streaming algorithms, and data mining.
In semester, I will be teaching:
CSCI 567 -- Machine Learning
- CSCI 170 -- Discrete Methods in Computer Science
- To acquire the textbook:
- Sign in or create an account at learn.zybooks.com
- Enter zyBook code: USCCSCI170Spring2018
A subscription is $58 and will last until after the final exam.
- I am giving lecture and also the four Tuesday discussions sections
- Enrollment is handled through the CSCI Department front office; please do not ask me for a D clearance.
- Streaming k-means on Well-Clusterable Data. With Vladimir Braverman, Adam Meyerson, Rafail Ostrovsky, Alan Roytman, and Brian Tagiku. In SODA, 2011. [ pdf ]
- Fast and Accurate k-means for Large Datasets. With Adam Meyerson and Alex Wong. In NIPS, 2011. [ pdf ] [ code ]
My Erdos number is 3:
I would like to thank the American Mathematical Society's collaboration distance calculator for providing me with an easy way to determine this.
- I co-authored Streaming k-means on Well-Clusterable Data (SODA 2011) with Rafail Ostrovsky (and also with Vladimir Braverman, Adam Meyerson, Alan Roytman, and Brian Tagiku)
- Rafail Ostrovsky co-authored The linear-array conjecture in communication complexity is false (STOC 1996) with Nathan Linial (and also with Eyal Kushilevitz)
- Nathan Linial co-authored Extremal problems on permutations under cyclic equivalence (Discrete Math, 1987) with Paul Erdos (and also with Shlomo Moran)
PhD in Computer Science from UCLA, 2011
Advisor: Adam Meyerson
Master of Science in Computer Science from UCLA, 2008
Advisor: Adam Meyerson
Bachelor of Science in Information and Computer Science from UC Irvine, 2005.