My research area is algorithms and complexity with applications to databases and data mining, networking monitoring, and learning. Specific topics include processing massive data sets and data streams, clustering, approximation algorithms, coding and information theory. Feel free to check out my research papers or my cv.
Prior to coming to MSR, I was at the wonderful Information Theory and Applications Center at UCSD. In 2007, I received my Ph.D. from the University of Pennsylvania where my advisor was Sampath Kannan. During graduate school, I spent a summer at DIMACS and three summers at the Fundamental Maths Department at Bell Labs. In the dim and distant past, I received the Certificate of Advanced Study in Mathematics (2001) and a B.A. in Mathematics (2000) from the University of Cambridge.
Since you're here, maybe you'd like to...
- attempt some open questions about data streams?
- peruse an entry on graph mining in streams from the Encyclopedia of Database Systems?
- find out more about an intriguing DIMACS Workshop on Streaming, Coding, and Compressive Sensing?
- submit a great paper to one of the following
conferences:
- 4th IEEE/ACM International Conference on Distributed Computing (DCOSS 2008)
- 17th ACM Conference on Information and Knowledge Management (CIKM 2008)
- review some slides from recent talks on:
- "Streaming and sketching for distributions" (NIPS 2007)
- "The order of the stream" (MIT, UMich, UIUC 2007)
- "Robust lower bounds for communication" (Yahoo! Research, IBM Almaden 2007)
- "Declaring independence via the sketching of sketches" (SODA, ITA Workshop 2008)
"We know that five minus four is one
But a cloud minus a sailboat
Have no idea what it is."
-- Another Kind of Mathematics, Nichita
Stanescu