Atish Das Sarma

According to our database1, Atish Das Sarma authored at least 54 papers between 2004 and 2015.

Collaborative distances:
  • Dijkstra number2 of two.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2015
Trust Evolution: Modeling and Its Applications.
IEEE Trans. Knowl. Data Eng., 2015

Fast distributed PageRank computation.
Theor. Comput. Sci., 2015

Distributed computation in dynamic networks via random walks.
Theor. Comput. Sci., 2015

Efficient random walk sampling in distributed networks.
J. Parallel Distributed Comput., 2015

Efficient distributed computation of distance sketches in networks.
Distributed Comput., 2015

Fast Approximate Matching of Videos from Hand-Held Cameras for Robust Background Subtraction.
Proceedings of the 2015 IEEE Winter Conference on Applications of Computer Vision, 2015

Social Network Monetization via Sponsored Viral Marketing.
Proceedings of the 2015 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, 2015

Distributed Computation of Sparse Cuts via Random Walks.
Proceedings of the 2015 International Conference on Distributed Computing and Networking, 2015

2014
Fast Approximate Matching of Cell-Phone Videos for Robust Background Subtraction.
CoRR, 2014

Beyond modeling private actions: predicting social shares.
Proceedings of the 23rd International World Wide Web Conference, 2014

The "expression gap": do you like what you share?
Proceedings of the 23rd International World Wide Web Conference, 2014

E-commerce product search: personalization, diversification, and beyond.
Proceedings of the 23rd International World Wide Web Conference, 2014

What makes an image popular?
Proceedings of the 23rd International World Wide Web Conference, 2014

Data design for personalization: current challenges and emerging opportunities.
Proceedings of the Seventh ACM International Conference on Web Search and Data Mining, 2014

2013
On the Embeddability of Random Walk Distances.
Proc. VLDB Endow., 2013

An Approximate Restatement of the Four-Color Theorem.
J. Graph Algorithms Appl., 2013

Distributed Random Walks.
J. ACM, 2013

Distributed Computation of Sparse Cuts.
CoRR, 2013

Arrival and departure dynamics in social networks.
Proceedings of the Sixth ACM International Conference on Web Search and Data Mining, 2013

Palette power: enabling visual search through colors.
Proceedings of the 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2013

2012
Distributed Verification and Hardness of Distributed Approximation.
SIAM J. Comput., 2012

Your two weeks of fame and your grandmother's.
Proceedings of the 21st World Wide Web Conference 2012, 2012

Online selection of diverse results.
Proceedings of the Fifth International Conference on Web Search and Web Data Mining, 2012

Fast Distributed Computation in Dynamic Networks via Random Walks.
Proceedings of the Distributed Computing - 26th International Symposium, 2012

Dense Subgraphs on Dynamic Networks.
Proceedings of the Distributed Computing - 26th International Symposium, 2012

Efficient computation of distance sketches in distributed networks.
Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architectures, 2012

Interactive regret minimization.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2012

Multi-skill Collaborative Teams based on Densest Subgraphs.
Proceedings of the Twelfth SIAM International Conference on Data Mining, 2012

Brief announcement: maintaining large dense subgraphs on dynamic networks.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2012

eTrust: understanding trust evolution in an online world.
Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2012

Edge-preserving self-healing: Keeping network backbones densely connected.
Proceedings of the 2012 Proceedings IEEE INFOCOM Workshops, 2012

Near-optimal random walk sampling in distributed networks.
Proceedings of the IEEE INFOCOM 2012, Orlando, FL, USA, March 25-30, 2012, 2012

2011
Best-order streaming model.
Theor. Comput. Sci., 2011

Personalized Social Recommendations - Accurate or Private?
Proc. VLDB Endow., 2011

Estimating PageRank on graph streams.
J. ACM, 2011

A Tight Lower Bound on Distributed Random Walk Computation
CoRR, 2011

A tight unconditional lower bound on distributed randomwalk computation.
Proceedings of the 30th Annual ACM Symposium on Principles of Distributed Computing, 2011

Representative skylines using threshold-based preference distributions.
Proceedings of the 27th International Conference on Data Engineering, 2011

2010
Regret-Minimizing Representative Databases.
Proc. VLDB Endow., 2010

On the (Im)possibility of Preserving Utility and Privacy in Personalized Social Recommendations.
CoRR, 2010

Ranking mechanisms in twitter-like forums.
Proceedings of the Third International Conference on Web Search and Web Data Mining, 2010

A sketch-based distance oracle for web-scale graphs.
Proceedings of the Third International Conference on Web Search and Web Data Mining, 2010

Efficient distributed random walks with applications.
Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

2009
Randomized Multi-pass Streaming Skyline Algorithms.
Proc. VLDB Endow., 2009

Near-Optimal Sublinear Time Bounds for Distributed Random Walks
CoRR, 2009

Finding Dense Subgraphs in <i>G</i>(<i>n</i>, 1/2).
Proceedings of the Approximation and Online Algorithms, 7th International Workshop, 2009

Fast distributed random walks.
Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, 2009

Algorithms for Message Ferrying on Mobile ad hoc Networks.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2009

Sparse Cut Projections in Graph Streams.
Proceedings of the Algorithms, 2009

2008
Finding Dense Subgraphs in G(n,1/2)
CoRR, 2008

Bypass rates: reducing query abandonment using negative inferences.
Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2008

2007
Public Advertisement Broker Markets.
Proceedings of the Internet and Network Economics, Third International Workshop, 2007

2005
On-Line Algorithms for Market Equilibria.
Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

2004
Generic Text Summarization Using WordNet.
Proceedings of the Fourth International Conference on Language Resources and Evaluation, 2004


  Loading...