Остановите войну!
for scientists:
default search action
Rina Panigrahy
- > Home > Persons > Rina Panigrahy
Publications
- 2020
- [c67]Abhimanyu Das, Sreenivas Gollapudi, Ravi Kumar, Rina Panigrahy:
On the Learnability of Random Deep Networks. SODA 2020: 398-410 - 2019
- [i24]Abhimanyu Das, Sreenivas Gollapudi, Ravi Kumar, Rina Panigrahy:
On the Learnability of Deep Random Networks. CoRR abs/1904.03866 (2019) - 2017
- [c63]Sreenivas Gollapudi, Ravi Kumar, Debmalya Panigrahi, Rina Panigrahy:
Partitioning Orders in Online Shopping Services. CIKM 2017: 1319-1328 - [c62]Flavio Chierichetti, Sreenivas Gollapudi, Ravi Kumar, Silvio Lattanzi, Rina Panigrahy, David P. Woodruff:
Algorithms for $\ell_p$ Low-Rank Approximation. ICML 2017: 806-814 - [i20]Flavio Chierichetti, Sreenivas Gollapudi, Ravi Kumar, Silvio Lattanzi, Rina Panigrahy, David P. Woodruff:
Algorithms for $\ell_p$ Low Rank Approximation. CoRR abs/1705.06730 (2017) - 2013
- [c57]Abhimanyu Das, Sreenivas Gollapudi, Rina Panigrahy, Mahyar Salek:
Debiasing social wisdom. KDD 2013: 500-508 - 2012
- [c53]Anish Das Sarma, Sreenivas Gollapudi, Rina Panigrahy, Li Zhang:
Understanding cyclic trends in social choices. WSDM 2012: 593-602 - 2011
- [j16]Atish Das Sarma, Sreenivas Gollapudi, Rina Panigrahy:
Estimating PageRank on graph streams. J. ACM 58(3): 13:1-13:19 (2011) - 2010
- [c47]Anish Das Sarma, Atish Das Sarma, Sreenivas Gollapudi, Rina Panigrahy:
Ranking mechanisms in twitter-like forums. WSDM 2010: 21-30 - [c46]Atish Das Sarma, Sreenivas Gollapudi, Marc Najork, Rina Panigrahy:
A sketch-based distance oracle for web-scale graphs. WSDM 2010: 401-410 - [i14]Sreenivas Gollapudi, Rina Panigrahy:
Revisiting the Examination Hypothesis with Query Specific Position Bias. CoRR abs/1003.2458 (2010) - [i11]Anish Das Sarma, Sreenivas Gollapudi, Rina Panigrahy, Li Zhang:
Understanding Fashion Cycles as a Social Choice. CoRR abs/1009.2617 (2010) - 2009
- [c44]Atish Das Sarma, Sreenivas Gollapudi, Rina Panigrahy:
Sparse Cut Projections in Graph Streams. ESA 2009: 480-491 - [c41]Marc Najork, Sreenivas Gollapudi, Rina Panigrahy:
Less is more: sampling the neighborhood graph makes SALSA better and faster. WSDM 2009: 242-251 - 2008
- [c38]Atish Das Sarma, Sreenivas Gollapudi, Rina Panigrahy:
Estimating PageRank on graph streams. PODS 2008: 69-78 - [c37]Sreenivas Gollapudi, Rina Panigrahy:
The power of two min-hashes for similarity search among hierarchical data objects. PODS 2008: 211-220 - 2007
- [c29]Sreenivas Gollapudi, Marc Najork, Rina Panigrahy:
Using Bloom Filters to Speed Up HITS-Like Ranking Algorithms. WAW 2007: 195-201 - 2006
- [c27]Sreenivas Gollapudi, Rina Panigrahy:
Exploiting asymmetry in hierarchical topic extraction. CIKM 2006: 475-482 - [c25]Sreenivas Gollapudi, Rina Panigrahy:
A dictionary for approximate string search and longest prefix search. CIKM 2006: 768-775
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-18 20:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint