Sreenivas Gollapudi
RESEARCHER
.
Sreenivas Gollapudi joined Search labs in July 2006. Prior to joining Search Labs, he worked as a Software Architect at Ebrary in the Advanced Technologies Group and before that as a principal member of technical staff in the distributed database group at Oracle. He obtained his B.Tech from IIT Bombay, and his Ph.D. from the State University of New York at Buffalo. He is a holder of eleven US patents. His current research interests include web algorithms, hashing and sketching algorithms for large data sets, and game theoretic approaches to social network analysis.
Publications
- Atish Das Sarma, Sreenivas Gollapudi, and Rina Panigrahy, Sparse Cut Projections in Graph Streams, in 17th Annual European Symposium on Algorithms (ESA), European Association for Theoretical Computer Science, September 2009
- Sreenivas Gollapudi and Aneesh Sharma, An Axiomatic Approach for Result Diversification, in Proc. of 18th World Wide Web Conference (WWW), 20 April 2009
- Marc Najork, Sreenivas Gollapudi, and Rina Panigrahy, Less is More: Sampling the Neighborhood Graph Makes SALSA Better and Faster, in 2nd ACM International Conference on Web Search and Data Mining (WSDM), Association for Computing Machinery, Inc., February 2009
- Rakesh Agrawal, Sreenivas Gollapudi, Alan Halverson, and Samuel Ieong, Diversifying Search Results, in Proceedings of ACM International Conference on Web Search and Data Mining (WSDM), Association for Computing Machinery, Inc., 2009
- Atish Das Sarma, Sreenivas Gollapudi, and Samuel Ieong, Bypass Rates: Reducing Query Abandonment using Negative Inferences, in Proc. of 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Association for Computing Machinery, Inc., August 2008
- Atish Das Sarma, Sreenivas Gollapudi, and Rina Panigrahy, Estimating PageRank on Graph Streams, in Proceedings of the Twenty-Seventh ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, Association for Computing Machinery, Inc., June 2008
- Sreenivas Gollapudi, Marc Najork, and Rina Panigrahy, Using Bloom Filters to Speed Up HITS-like Ranking Algorithms, in 5th Workshop on Algorithms and Models for the Web Graph (WAW), Springer-Verlag, December 2007
- Atish Das Sarma, Deeparnab Chakrabarty, and Sreenivas Gollapudi, Public Advertisement Broker Markets, in Workshop on Internet and Network Economics, December 2007
