- Michael’s looking for a post doc position. Michael has done some really nice work in the field of data stream algorithms including designing the first graph algorithms for the sliding window model; analyzing space-sample trade-offs in stochastic streams; estimating stream periodicity via linear sketches; and improving the best known results for approximate maximum weighted matching (to appear). Prior to this, he worked in descriptive complexity and built a system for automatically finding reductions between problems. Michael gives great lectures and also has a particular strength when it comes to helping and mentoring more junior students. Which brings me to…
- Dan’s applying to grad school. Dan worked with Michael on the above graph algorithms and separately has a really neat result on sketching the earth-mover distance on graph metrics. Of particular note is that he has just been declared:
This award “recognizes undergraduate students in North American colleges and universities who show outstanding research potential in an area of computing research.” Except, in Dan’s case, I’d skip the word “potential”.
- I’m looking for new students! If you’re applying to grad school and are interested in data stream algorithms, or algorithms in general, please consider submitting your application to UMass Amherst. Details are here and our deadline is December 15th. For more details about my research interests see my website. And check-out the UMass Theory Group.
Email me if you’d like to follow-up on any of the above points.