Остановите войну!
for scientists:
default search action
Atish Das Sarma
- > Home > Persons > Atish Das Sarma
Publications
- 2015
- [c37]Parinya Chalermsook, Atish Das Sarma, Ashwin Lall, Danupon Nanongkai:
Social Network Monetization via Sponsored Viral Marketing. SIGMETRICS 2015: 259-270 - 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) - [i16]Atish Das Sarma, Danupon Nanongkai, Gopal Pandurangan, Prasad Tetali:
Distributed Random Walks. CoRR abs/1302.4544 (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) - [c24]Atish Das Sarma, Ashwin Lall, Danupon Nanongkai, Amitabh Trehan:
Brief announcement: maintaining large dense subgraphs on dynamic networks. PODC 2012: 229-230 - [c22]Danupon Nanongkai, Ashwin Lall, Atish Das Sarma, Kazuhisa Makino:
Interactive regret minimization. SIGMOD Conference 2012: 109-120 - [c19]Atish Das Sarma, Ashwin Lall, Danupon Nanongkai, Amitabh Trehan:
Dense Subgraphs on Dynamic Networks. DISC 2012: 151-165 - [i11]Atish Das Sarma, Ashwin Lall, Danupon Nanongkai, Amitabh Trehan:
Dense Subgraphs on Dynamic Networks. CoRR abs/1208.1454 (2012) - 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) - 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 - [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) - 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) - [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 - [i2]Atish Das Sarma, Danupon Nanongkai, Gopal Pandurangan, Prasad Tetali:
Near-Optimal Sublinear Time Bounds for Distributed Random Walks. CoRR abs/0911.3195 (2009)
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-02-06 23:47 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint