Atish Das Sarma

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Prasad Tetali

> Home > Persons > Atish Das Sarma

Publications

2013
[j9]
- view
  authority control:
- export record
  dblp key:
  - journals/jacm/SarmaNPT13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jacm/SarmaNPT13
Atish Das Sarma, Danupon Nanongkai, Gopal Pandurangan, Prasad Tetali:
Distributed Random Walks. J. ACM 60(1): 2:1-2:31 (2013)
[i16]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1302-4544
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1302-4544
Atish Das Sarma, Danupon Nanongkai, Gopal Pandurangan, Prasad Tetali:
Distributed Random Walks. CoRR abs/1302.4544 (2013)
2010
[c13]
- view
  authority control:
- export record
  dblp key:
  - conf/podc/SarmaNPT10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/podc/SarmaNPT10
Atish Das Sarma, Danupon Nanongkai, Gopal Pandurangan, Prasad Tetali:
Efficient distributed random walks with applications. PODC 2010: 201-210
2009
[i2]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-0911-3195
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-0911-3195
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.