Publications

  1. Alexandrs Slivkins, Filip Radlinski, and Sreenivas Gollapudi, Learning optimally diverse rankings
    over large document collections, ICML 2010: 446-453.
  2. Sayan Bhattacharya, Gagan Goel, and Sreenivas Gollapudi, and Kamesh Munagala, Budget
    constrained auctions with heterogeneous items, STOC 2010: 379-387.
  3. Atish Das Sarma, Sreenivas Gollapudi, Marc Najork, and Rina Panigrahy, An Approximate
    Distance Oracle for Web-Scale Graphs, WSDM 2010: 401-410.
  4. Anish Das Sarma, Atish Das Sarma, Sreenivas Gollapudi, and Rina Panigrahy, Ranking
    Mechanisms in Twitter-Like Forums. WSDM 2010: 21-30.
  5. Atish Das Sarma, Sreenivas Gollapudi, and Rina Panigrahy, Sparse Cut Projections on Graph
    Streams, ESA 2009: 480-491.
  6. Sreenivas Gollapudi and Aneesh Sharma, An Axiomatic Approach to Result Diversification,
    WWW 2009: 381-390.
  7. Rakesh Agrawal, Sreenivas Gollapudi, Alan Halverson, and Samuel Ieong, Diversifying Search
    Results, WSDM 2009: 5-14.
  8. Marc Najork, Sreenivas Gollapudi, and Rina Panigrahy, Less is More: Sampling the
    Neighborhood Graph Makes SALSA Better and Faster. WSDM 2009: 242-251 .
  9. Atish Das Sarma, Sreenivas Gollapudi, and Samuel Ieong, Bypass Rates: Reducing Query
    Abandonment using Negative Inferences, KDD 2008: 177-185.
  10. Sreenivas Gollapudi and Rina Panigrahy, The power of two min-hashes in similarity search
    among hierarchical data objects, PODS 2008: 211-220.
  11. Atish Das Sarma, Sreenivas Gollapudi, and Rina Panigrahy, Estimating PageRank on Graph
    Streams, PODS 2008: 69-78 (Best Paper Award).
  12. Atish Das Sarma, Deeparnab Chakrabarty, and Sreenivas Gollapudi, Public Advertisment Broker
    Markets, WINE 2007: 558-563.
  13. Sreenivas Gollapudi, Marc Najork, and Rina Panigrahy, Using Bloom filters to speed-up HITS-
    like ranking algorithms, WAW 2007: 195-201.
  14. S. Gollapudi and R. Panigrahy, Exploiting Asymmetry for Hierarchical Topic Extraction, CIKM
    2006: 475-482.
  15. S. Gollapudi and R. Panigrahy, A Dictionary for Approximate String Search and Longest Prefix
    Match, CIKM 2006: 768-775.
  16. S. Gollapudi and D. Sivakumar, Tree Information Retrieval, 2006, Manuscript.
  17. S. Gollapudi, Ravi Kumar, and D. Sivakumar, Programmable Clustering, PODS 2006: 348-354.
  18. S. Gollapudi, D. Sivakumar, A. Zhang, Exploting Anarchy in Networks: A Game-Theoretic
    Approach to Combining Throughput and Fairness, INFOCOM 2005: .
  19. S. Gollapudi and D. Sivakumar, Framework and algorithms for trend analysis in massive
    temporal data sets. CIKM 2004: 168-177.
  20. S. Gollapudi, D. Sivakumar, A mechanism for equitable bandwidth allocation under QoS and
    budget constraints. IWQoS 2004: 138-147.
  21. S. Gollapudi and D. Sivakumar,  Data Stream Algorithms for Scalable Bandwidth Management,
    ICC 2004: .
  22. S. Gollapudi and D. Sivakumar, Data Stream Approach to Internet QoS, MPDS 2003: .
  23. A. Zhang and S. Gollapudi, QoS Management in Educational Digital Library Environments.
    Multimedia Tools Appl. 10(2/3): 133-156 (2000).  
  24. S. Gollapudi and A. Zhang, Buffer Model and Management in Distributed Multimedia
    Presentation Systems. Multimedia Syst. 6(3): 206-218 (1998).
  25. S. Gollapudi, A. Zhang, Buffer Management in Multimedia Database Systems. ICMCS 1996: 186-
  26. S. Gollapudi and A. Zhang, NetMedia: A Client-Server Distributed Multimedia Environment. IW-
    MMDBMS 1996: 160-167.