List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Efficient distributed computation of distance sketches in networks Distributed Computing | 2015-10-20 | Paper |
| A tight unconditional lower bound on distributed randomwalk computation Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing | 2015-09-11 | Paper |
| Distributed computation in dynamic networks via random walks Theoretical Computer Science | 2015-05-22 | Paper |
| Efficient distributed random walks with applications Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing | 2015-03-02 | Paper |
| Brief announcement Proceedings of the 2012 ACM symposium on Principles of distributed computing | 2014-12-05 | Paper |
| Fast distributed PageRank computation Theoretical Computer Science | 2014-12-02 | Paper |
| Fast distributed random walks Proceedings of the 28th ACM symposium on Principles of distributed computing | 2014-07-23 | Paper |
| Distributed verification and hardness of distributed approximation Proceedings of the forty-third annual ACM symposium on Theory of computing | 2014-06-05 | Paper |
| Distributed random walks Journal of the ACM | 2014-02-17 | Paper |
| An approximate restatement of the Four-Color Theorem Journal of Graph Algorithms and Applications | 2013-10-29 | Paper |
| Fast distributed computation in dynamic networks via random walks Lecture Notes in Computer Science | 2013-03-13 | Paper |
| Dense subgraphs on dynamic networks Lecture Notes in Computer Science | 2013-03-13 | Paper |
| Distributed verification and hardness of distributed approximation SIAM Journal on Computing | 2013-02-04 | Paper |
| Algorithms for message ferrying on mobile ad hoc networks | 2012-10-24 | Paper |
| Estimating PageRank on graph streams Journal of the ACM | 2011-07-14 | Paper |
| Best-order streaming model Theoretical Computer Science | 2011-05-18 | Paper |
| Finding dense subgraphs in \(G(n,1/2)\) Approximation and Online Algorithms | 2010-05-11 | Paper |
| Sparse Cut Projections in Graph Streams Lecture Notes in Computer Science | 2009-10-29 | Paper |
| Best-Order Streaming Model Lecture Notes in Computer Science | 2009-06-03 | Paper |
| Computing and Combinatorics Lecture Notes in Computer Science | 2006-01-11 | Paper |
Research outcomes over time
This page was built for person: Atish Das Sarma
