Atish Das Sarma, Ph.D. - Publications

Affiliations: 
2010 Georgia Institute of Technology, Atlanta, GA 
Area:
Computer Science

14 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2015 Das Sarma A, Molla AR, Pandurangan G. Distributed computation of sparse cuts via random walks Acm International Conference Proceeding Series. 4. DOI: 10.1145/2684464.2684474  0.382
2015 Das Sarma A, Molla AR, Pandurangan G. Distributed computation in dynamic networks via random walks Theoretical Computer Science. 581: 45-66. DOI: 10.1016/j.tcs.2015.02.044  0.381
2015 Das Sarma A, Molla AR, Pandurangan G, Upfal E. Fast distributed PageRank computation Theoretical Computer Science. 561: 113-121. DOI: 10.1016/j.tcs.2014.04.003  0.374
2015 Das Sarma A, Molla AR, Pandurangan G. Efficient random walk sampling in distributed networks Journal of Parallel and Distributed Computing. 77: 84-94. DOI: 10.1016/j.jpdc.2015.01.002  0.351
2013 Das Sarma A, Gajewar AS, Lipton RJ, Nanongkai D. An approximate restatement of the Four-Color Theorem Journal of Graph Algorithms and Applications. 17: 567-573. DOI: 10.7155/Jgaa.00304  0.582
2013 Das Sarma A, Nanongkai D, Pandurangan G, Tetali P. Distributed random walks Journal of the Acm. 60. DOI: 10.1145/2432622.2432624  0.62
2013 Das Sarma A, Molla AR, Pandurangan G, Upfal E. Fast distributed PageRank computation Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7730: 11-26. DOI: 10.1007/978-3-642-35668-1_2  0.375
2012 Nanongkai D, Lall A, Das Sarma A, Makino K. Interactive regret minimization Proceedings of the Acm Sigmod International Conference On Management of Data. 109-120. DOI: 10.1145/2213836.2213850  0.533
2012 Das Sarma A, Trehan A. Edge-preserving self-healing: Keeping network backbones densely connected Proceedings - Ieee Infocom. 226-231. DOI: 10.1109/INFCOMW.2012.6193496  0.33
2012 Das Sarma A, Lall A, Nanongkai D, Trehan A. Dense subgraphs on dynamic networks Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7611: 151-165. DOI: 10.1007/978-3-642-33651-5_11  0.559
2012 Das Sarma A, Molla AR, Pandurangan G. Fast distributed computation in dynamic networks via random walks Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7611: 136-150. DOI: 10.1007/978-3-642-33651-5_10  0.371
2011 Nanongkai D, Das Sarma A, Pandurangan G. A tight unconditional lower bound on distributed randomwalk computation Proceedings of the Annual Acm Symposium On Principles of Distributed Computing. 257-266. DOI: 10.1145/1993806.1993853  0.61
2011 Das Sarma A, Lall A, Nanongkai D, Lipton RJ, Xu J. Representative skylines using threshold-based preference distributions Proceedings - International Conference On Data Engineering. 387-398. DOI: 10.1109/ICDE.2011.5767873  0.551
2011 Das Sarma A, Lipton RJ, Nanongkai D. Best-order streaming model Theoretical Computer Science. 412: 2544-2555. DOI: 10.1016/j.tcs.2010.10.046  0.594
Show low-probability matches.