A Brief Summary of Streams
Martin J. Strauss
Departments of Math and EECS (jointly appointed)
University of Michigan
Thursday, January 25, 2007
A streaming algorithm processes a stream of transactions to maintain a summary from which it can answer queries. It satisfies:
* Each transaction is processed quickly.
* The summary is small.
* Each query is answered quickly.
Over the last decade, there has been a dramatic resurgence of interest in streaming algorithms. In this talk, we scan some of the algorithmic results and
give applications to database, networking, signal processing, and privacy.
Martin J. Strauss is an Assistant Professor at the University of Michigan, jointly appointed in the Departments of Mathematics and Electrical Engineering
and Computer Science. Prior to joining Michigan in the fall of 2004, he spent seven years as a researcher at AT&T Labs. He holds an A.B. degree from Columbia
University and a PhD from Rutgers University, both in mathematics, and did a year of post-doctoral research at Iowa State University before joining AT&T. He has
written several articles in algorithms, complexity theory, cryptography, and computer security, and other topics. Martin is currently interested in algorithmic
problems in harmonic analysis, database and data privacy.
Hosted by: Chuck Stewart (x6731)
Administrative support: Jacky Carley (x8291)