Uni-Logo
Algorithms and Complexity
 


Anisur Rahaman Molla


Anisur Rahaman Molla Postdoc Researcher (2014 - 2016)

Research interests

My research focuses on distributed graph algorithms. Generally, I am interested in designing and analysis of algorithms, randomized algorithms and probabilistic analysis of algorithms. Recently, I am more involved with problems in distributed dynamic graphs.


Please visit my detailed and regularly updated homepage here!




Publications

Years: 2017 | 2015

    2017


    Conference papers
    • Karl Bringmann, Ralph Keusch, Johannes Lengler, Yannic Maus, Anisur Rahaman Molla
      Greedy Routing and the Algorithmic Small-World Phenomenon
      2017 Principles of Distributed Computing (PODC), July 25-27, 2017, Washington, DC, USA

    2015


    Conference papers
    • Fabian Kuhn, Anisur Rahaman Molla
      Distributed Sparse Cut Approximation
      2015 19th Int. Conf. on Principles of Distributed Systems (OPODIS), Rennes, France
    • Mohamad Ahmadi, Abdolhamid Ghodselahi, Fabian Kuhn, Anisur Rahaman Molla
      The Cost of Global Broadcast in Dynamic Radio Networks
      2015 19th Int. Conf. on Principles of Distributed Systems (OPODIS), Rennes, France
    • Atish Das Sarma, Anisur Rahaman Molla, Gopal Pandurangan
      Distributed Computation of Sparse Cuts via Random Walks
      2015 16th International Conference on Distributed Computing and Networking (ICDCN), Goa, India
    Journal Papers
    • Atish Das Sarma, Anisur Rahaman Molla, Gopal Pandurangan
      Distributed computation in dynamic networks via random walks.
      2015 Theor Comput Sci, volume: 581, pages: 45 - 66
    • Atish Das Sarma, Anisur Rahaman Molla, Gopal Pandurangan
      Efficient random walk sampling in distributed networks.
      2015 J Parallel Distr Com, volume: 77, pages: 84 - 94
    • Atish Das Sarma, Anisur Rahaman Molla, Gopal Pandurangan, Eli Upfal
      Fast distributed PageRank computation.
      2015 Theor Comput Sci, volume: 561, pages: 113 - 121