Frank McSherry Researcher mcsherry@microsoft.com Tel. +1 650.693.1996

Frank joined the MSR Silicon Valley Lab in 2002, graduating from the University of Washington where he worked with Anna Karlin. His research interests include the design and analysis of algorithms, with particular interests in spectral methods, large graph analysis, and incremental algorithms.

Conference Papers

Yossi Azar, Amos Fiat, Anna Karlin, Frank McSherry, and Jared Saia. Spectral Methods for Data Mining.   STOC 2001, pages 619-626.

Dimitris Achlioptas and Frank McSherry. Fast Computation of Low Rank Matrix Approximations. STOC 2001, pages 611-618.

Dimitris Achlioptas, Amos Fiat, Anna Karlin, and Frank McSherry. Web Search through Hub Synthesis. FOCS 2001, pages 500-509

Frank McSherry. Spectral Partitioning of Random Graphs. FOCS 2001, pages 529-537.

Dimitris Achlioptas, Frank McSherry, and Berhard Schoelkopf. Sampling Techniques for Kernel Methods . NIPS 2001, pages 335-342.

David Kempe and Frank McSherry. A Decentralized Algorithm for Spectral Analysis. STOC 2004, pages 561-568.

Anirban Dasgupta, John Hopcroft, and Frank McSherry. Spectral Analysis of Random Graphs with Skewed Degree Distributions. FOCS 2004, pages 602-610

Frank McSherry. A Uniform Approach to Accelerated PageRank Computation. To appear: WWW 2005