Michael Shindler

I am a post-doctoral scholar at Oregon State University, working with Thomas Dietterich.

Office: 3079 Kelley Engineering Center

To form my email address, concatenate my last name with [at] eecs [dot] oregonstate [dot] edu

Research interests: Computations on large datasets, Machine Learning, Approximation Algorithms, Streaming Algorithms, Data Mining, Game Theory, Sustainable Computing, Power Management


 Picture of Michael Shindler

Papers

  • 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 ]
  • I wrote a survey entitled "Approximation Algorithms for the Metric k-Median Problem" for my Written Qualifying Exam paper.
    If you are looking for it, the relevant portions are expanded upon and appear in Chapter 2, "A Brief History of Clustering," in my dissertation.
  • Dissertation: "Clustering For Information Analysis and Retrieval: Algorithms and Applications". [ pdf ]

Tech Reports

  • Energy-Efficient Online Scheduling with Deadlines. With Aaron Cote, Adam Meyerson, Alan Roytman, and Brian Tagiku. UCLA Computer Science Department Tech Report 100029, 2010. [ pdf ]

Educational Background

  • 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.
    • Undergraduate Specializations in Implementation and Analysis of Algorithms, Artificial Intelligence, and Computer Systems.

Erdos Number

My Erdos number is 3:
  • 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)
I would like to thank the American Mathematical Society's collaboration distance calculator for providing me with an easy way to determine this.

CV

  • My CV -- slightly outdated. My physical address and mobile phone number are available upon request.