default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAtish Das Sarma
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
[j14]Atish Das Sarma, Michael Dinitz
, Gopal Pandurangan:
Efficient distributed computation of distance sketches in networks. Distributed Comput. 28(5): 309-320 (2015)- [j13]Atish Das Sarma, Anisur Rahaman Molla, Gopal Pandurangan:
Efficient random walk sampling in distributed networks. J. Parallel Distributed Comput. 77: 84-94 (2015) - [j12]Atish Das Sarma, Anisur Rahaman Molla, Gopal Pandurangan, Eli Upfal:
Fast distributed PageRank computation. Theor. Comput. Sci. 561: 113-121 (2015) - [j11]Atish Das Sarma, Anisur Rahaman Molla, Gopal Pandurangan:
Distributed computation in dynamic networks via random walks. Theor. Comput. Sci. 581: 45-66 (2015) - [j10]Jiliang Tang, Huiji Gao, Atish Das Sarma, Yingzhou Bi, Huan Liu:
Trust Evolution: Modeling and Its Applications. IEEE Trans. Knowl. Data Eng. 27(6): 1724-1738 (2015) - [c38]Atish Das Sarma, Anisur Rahaman Molla, Gopal Pandurangan:
Distributed Computation of Sparse Cuts via Random Walks. ICDCN 2015: 6:1-6:10 - [c37]Parinya Chalermsook, Atish Das Sarma, Ashwin Lall, Danupon Nanongkai:
Social Network Monetization via Sponsored Viral Marketing. SIGMETRICS 2015: 259-270 - [c36]Raffay Hamid, Atish Das Sarma, Dennis DeCoste, Neel Sundaresan:
Fast Approximate Matching of Videos from Hand-Held Cameras for Robust Background Subtraction. WACV 2015: 294-301 - 2014
- [c35]Elizabeth F. Churchill, Atish Das Sarma:
Data design for personalization: current challenges and emerging opportunities. WSDM 2014: 693-694 - [c34]Atish Das Sarma, Nish Parikh, Neel Sundaresan:
E-commerce product search: personalization, diversification, and beyond. WWW (Companion Volume) 2014: 189-190 - [c33]Atish Das Sarma, Si Si, Elizabeth F. Churchill, Neel Sundaresan:
The "expression gap": do you like what you share? WWW (Companion Volume) 2014: 247-248 - [c32]Si Si, Atish Das Sarma, Elizabeth F. Churchill, Neel Sundaresan:
Beyond modeling private actions: predicting social shares. WWW (Companion Volume) 2014: 377-378 - [c31]Aditya Khosla, Atish Das Sarma, Raffay Hamid:
What makes an image popular? WWW 2014: 867-876 - [i17]Raffay Hamid, Atish Das Sarma, Dennis DeCoste, Neel Sundaresan:
Fast Approximate Matching of Cell-Phone Videos for Robust Background Subtraction. CoRR abs/1404.5351 (2014) - 2013
- [j9]Atish Das Sarma, Danupon Nanongkai, Gopal Pandurangan, Prasad Tetali:
Distributed Random Walks. J. ACM 60(1): 2:1-2:31 (2013) - [j8]Atish Das Sarma, Amita Gajewar, Richard J. Lipton, Danupon Nanongkai:
An Approximate Restatement of the Four-Color Theorem. J. Graph Algorithms Appl. 17(5): 567-573 (2013) - [j7]Xiaohan Zhao, Adelbert Chang, Atish Das Sarma, Haitao Zheng, Ben Y. Zhao:
On the Embeddability of Random Walk Distances. Proc. VLDB Endow. 6(14): 1690-1701 (2013) - [c30]Atish Das Sarma, Anisur Rahaman Molla, Gopal Pandurangan, Eli Upfal:
Fast Distributed PageRank Computation. ICDCN 2013: 11-26 - [c29]Anurag Bhardwaj, Atish Das Sarma, Wei Di, Raffay Hamid, Robinson Piramuthu, Neel Sundaresan:
Palette power: enabling visual search through colors. KDD 2013: 1321-1329 - [c28]Shaomei Wu, Atish Das Sarma, Alex Fabrikant, Silvio Lattanzi, Andrew Tomkins:
Arrival and departure dynamics in social networks. WSDM 2013: 233-242 - [i16]Atish Das Sarma, Danupon Nanongkai, Gopal Pandurangan, Prasad Tetali:
Distributed Random Walks. CoRR abs/1302.4544 (2013) - [i15]Atish Das Sarma, Anisur Rahaman Molla, Gopal Pandurangan:
Distributed Computation of Sparse Cuts. CoRR abs/1310.5407 (2013) - 2012
- [j6]Atish Das Sarma, Stephan Holzer, Liah Kor, Amos Korman, Danupon Nanongkai, Gopal Pandurangan, David Peleg, Roger Wattenhofer:
Distributed Verification and Hardness of Distributed Approximation. SIAM J. Comput. 41(5): 1235-1265 (2012) - [c27]Atish Das Sarma, Amitabh Trehan:
Edge-preserving self-healing: Keeping network backbones densely connected. INFOCOM Workshops 2012: 226-231 - [c26]Atish Das Sarma, Anisur Rahaman Molla, Gopal Pandurangan:
Near-optimal random walk sampling in distributed networks. INFOCOM 2012: 2906-2910 - [c25]Jiliang Tang, Huiji Gao, Huan Liu, Atish Das Sarma:
eTrust: understanding trust evolution in an online world. KDD 2012: 253-261 - [c24]Atish Das Sarma, Ashwin Lall, Danupon Nanongkai, Amitabh Trehan:
Brief announcement: maintaining large dense subgraphs on dynamic networks. PODC 2012: 229-230 - [c23]Amita Gajewar, Atish Das Sarma:
Multi-skill Collaborative Teams based on Densest Subgraphs. SDM 2012: 165-176 - [c22]Danupon Nanongkai, Ashwin Lall, Atish Das Sarma, Kazuhisa Makino:
Interactive regret minimization. SIGMOD Conference 2012: 109-120 - [c21]Atish Das Sarma, Michael Dinitz, Gopal Pandurangan:
Efficient computation of distance sketches in distributed networks. SPAA 2012: 318-326 - [c20]Atish Das Sarma, Anisur Rahaman Molla, Gopal Pandurangan:
Fast Distributed Computation in Dynamic Networks via Random Walks. DISC 2012: 136-150 - [c19]Atish Das Sarma, Ashwin Lall, Danupon Nanongkai, Amitabh Trehan:
Dense Subgraphs on Dynamic Networks. DISC 2012: 151-165 - [c18]Debmalya Panigrahi, Atish Das Sarma, Gagan Aggarwal, Andrew Tomkins:
Online selection of diverse results. WSDM 2012: 263-272 - [c17]James Cook, Atish Das Sarma, Alex Fabrikant, Andrew Tomkins:
Your two weeks of fame and your grandmother's. WWW 2012: 919-928 - [i14]Atish Das Sarma, Anisur Rahaman Molla, Gopal Pandurangan:
Near-Optimal Random Walk Sampling in Distributed Networks. CoRR abs/1201.1363 (2012) - [i13]James Cook, Atish Das Sarma, Alex Fabrikant, Andrew Tomkins:
Your Two Weeks of Fame and Your Grandmother's. CoRR abs/1204.4346 (2012) - [i12]Atish Das Sarma, Anisur Rahaman Molla, Gopal Pandurangan:
Fast Distributed Computation in Dynamic Networks via Random Walks. CoRR abs/1205.5525 (2012) - [i11]Atish Das Sarma, Ashwin Lall, Danupon Nanongkai, Amitabh Trehan:
Dense Subgraphs on Dynamic Networks. CoRR abs/1208.1454 (2012) - [i10]Atish Das Sarma, Anisur Rahaman Molla, Gopal Pandurangan, Eli Upfal:
Fast Distributed PageRank Computation. CoRR abs/1208.3071 (2012) - 2011
- [j5]Atish Das Sarma, Sreenivas Gollapudi, Rina Panigrahy:
Estimating PageRank on graph streams. J. ACM 58(3): 13:1-13:19 (2011) - [j4]Ashwin Machanavajjhala, Aleksandra Korolova, Atish Das Sarma:
Personalized Social Recommendations - Accurate or Private? Proc. VLDB Endow. 4(7): 440-450 (2011) - [j3]Atish Das Sarma, Richard J. Lipton, Danupon Nanongkai:
Best-order streaming model. Theor. Comput. Sci. 412(23): 2544-2555 (2011) - [c16]Atish Das Sarma, Ashwin Lall, Danupon Nanongkai, Richard J. Lipton, Jun (Jim) Xu:
Representative skylines using threshold-based preference distributions. ICDE 2011: 387-398 - [c15]Danupon Nanongkai, Atish Das Sarma, Gopal Pandurangan:
A tight unconditional lower bound on distributed randomwalk computation. PODC 2011: 257-266 - [c14]Atish Das Sarma, Stephan Holzer, Liah Kor, Amos Korman, Danupon Nanongkai, Gopal Pandurangan, David Peleg, Roger Wattenhofer:
Distributed verification and hardness of distributed approximation. STOC 2011: 363-372 - [i9]Danupon Nanongkai, Atish Das Sarma, Gopal Pandurangan:
A Tight Lower Bound on Distributed Random Walk Computation. CoRR abs/1102.2906 (2011) - [i8]Amita Gajewar, Atish Das Sarma:
Multi-skill Collaborative Teams based on Densest Subgraphs. CoRR abs/1102.3340 (2011) - [i7]Ashwin Machanavajjhala, Aleksandra Korolova, Atish Das Sarma:
Personalized Social Recommendations - Accurate or Private? CoRR abs/1105.4254 (2011) - [i6]Atish Das Sarma, Amitabh Trehan:
Edge-preserving self-healing: keeping network backbones densely connected. CoRR abs/1108.5893 (2011) - [i5]Atish Das Sarma, Michael Dinitz, Gopal Pandurangan:
Efficient Computation of Distance Sketches in Distributed Networks. CoRR abs/1112.1210 (2011) - 2010
- [j2]Danupon Nanongkai, Atish Das Sarma, Ashwin Lall, Richard J. Lipton, Jun (Jim) Xu:
Regret-Minimizing Representative Databases. Proc. VLDB Endow. 3(1): 1114-1124 (2010) - [c13]Atish Das Sarma, Danupon Nanongkai, Gopal Pandurangan, Prasad Tetali:
Efficient distributed random walks with applications. PODC 2010: 201-210 - [c12]Anish Das Sarma, Atish Das Sarma, Sreenivas Gollapudi, Rina Panigrahy:
Ranking mechanisms in twitter-like forums. WSDM 2010: 21-30 - [c11]Atish Das Sarma, Sreenivas Gollapudi, Marc Najork, Rina Panigrahy:
A sketch-based distance oracle for web-scale graphs. WSDM 2010: 401-410 - [i4]Ashwin Machanavajjhala, Aleksandra Korolova, Atish Das Sarma:
On the (Im)possibility of Preserving Utility and Privacy in Personalized Social Recommendations. CoRR abs/1004.5600 (2010) - [i3]Atish Das Sarma, Stephan Holzer, Liah Kor, Amos Korman, Danupon Nanongkai, Gopal Pandurangan, David Peleg, Roger Wattenhofer:
Distributed Verification and Hardness of Distributed Approximation. CoRR abs/1011.3049 (2010)
2000 – 2009
- 2009
- [j1]Atish Das Sarma, Ashwin Lall, Danupon Nanongkai, Jun (Jim) Xu:
Randomized Multi-pass Streaming Skyline Algorithms. Proc. VLDB Endow. 2(1): 85-96 (2009) - [c10]Atish Das Sarma, Sreenivas Gollapudi, Rina Panigrahy:
Sparse Cut Projections in Graph Streams. ESA 2009: 480-491 - [c9]Mostafa H. Ammar, Deeparnab Chakrabarty, Atish Das Sarma, Subrahmanyam Kalyanasundaram, Richard J. Lipton:
Algorithms for Message Ferrying on Mobile ad hoc Networks. FSTTCS 2009: 13-24 - [c8]Atish Das Sarma, Danupon Nanongkai, Gopal Pandurangan:
Fast distributed random walks. PODC 2009: 161-170 - [c7]Atish Das Sarma, Richard J. Lipton, Danupon Nanongkai:
Best-Order Streaming Model. TAMC 2009: 178-191 - [c6]Atish Das Sarma, Amit Deshpande, Ravi Kannan:
Finding Dense Subgraphs in G(n, 1/2). WAOA 2009: 98-103 - [i2]Atish Das Sarma, Danupon Nanongkai, Gopal Pandurangan, Prasad Tetali:
Near-Optimal Sublinear Time Bounds for Distributed Random Walks. CoRR abs/0911.3195 (2009) - 2008
- [c5]Atish Das Sarma, Sreenivas Gollapudi, Samuel Ieong:
Bypass rates: reducing query abandonment using negative inferences. KDD 2008: 177-185 - [c4]Atish Das Sarma, Sreenivas Gollapudi, Rina Panigrahy:
Estimating PageRank on graph streams. PODS 2008: 69-78 - [i1]Atish Das Sarma, Amit Deshpande, Ravi Kannan:
Finding Dense Subgraphs in G(n,1/2). CoRR abs/0807.5111 (2008) - 2007
- [c3]Atish Das Sarma, Deeparnab Chakrabarty, Sreenivas Gollapudi:
Public Advertisement Broker Markets. WINE 2007: 558-563 - 2005
- [c2]Spyros Angelopoulos, Atish Das Sarma, Avner Magen, Anastasios Viglas:
On-Line Algorithms for Market Equilibria. COCOON 2005: 596-607 - 2004
- [c1]Kedar Bellare, Anish Das Sarma, Atish Das Sarma, Navneet Loiwal, Vaibhav Mehta, Ganesh Ramakrishnan, Pushpak Bhattacharyya:
Generic Text Summarization Using WordNet. LREC 2004
Coauthor Index
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-26 18:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
