I agree that this site is using cookies. You can find further informations here.
X
Biswas, Amartya Shankha
30  results:
Search for persons X
?
1

Massively Parallel Algorithms for Distance Approximation an..:

, In: Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures,
Biswas, Amartya Shankha ; Dory, Michal ; Ghaffari, Mohsen.. - p. 118-128 , 2021
Link: https://dl.acm.org/doi/1..
 
?
2

Sublinear-Time Algorithms for Counting Star Subgraphs via E..:

Aliakbarpour, Maryam ; Biswas, Amartya Shankha ; Gouleakis, Themis...
Algorithmica.  80 (2017)  2 - p. 668-697 , 2017
Link: https://doi.org/10.1007/..
 
?
3

Local Access to Random Walks:

Biswas, Amartya Shankha ; Pyne, Edward ; Rubinfeld, Ronitt
doi:10.4230/LIPIcs.ITCS.2022.24.  , 2022
Link: https://doi.org/10.4230/..
 
?
4

Massively Parallel Algorithms for Small Subgraph Counting:

Biswas, Amartya Shankha ; Eden, Talya ; Liu, Quanquan C..
doi:10.4230/LIPIcs.APPROX/RANDOM.2022.39.  , 2022
Link: https://doi.org/10.4230/..
 
?
5

Towards a Decomposition-Optimal Algorithm for Counting and ..:

Biswas, Amartya Shankha ; Eden, Talya ; Rubinfeld, Ronitt
http://arxiv.org/abs/2107.06582.  , 2021
Link: http://arxiv.org/abs/210..
 
?
6

Local Access to Random Walks:

Biswas, Amartya Shankha ; Pyne, Edward ; Rubinfeld, Ronitt
http://arxiv.org/abs/2102.07740.  , 2021
Link: http://arxiv.org/abs/210..
 
?
7

Towards a Decomposition-Optimal Algorithm for Counting and ..:

Biswas, Amartya Shankha ; Eden, Talya ; Rubinfeld, Ronitt
doi:10.4230/LIPIcs.APPROX/RANDOM.2021.55.  , 2021
Link: https://doi.org/10.4230/..
 
?
8

Local access to huge random objects through partial samplin:

Yodpinyanee, Anak ; Rubinfeld, Ronitt ; Biswas, Amartya Shankha
10.4230/LIPIcs.ITCS.2020.27.  , 2021
Link: https://hdl.handle.net/1..
 
?
9

Massively Parallel Algorithms for Distance Approximation an..:

Biswas, Amartya Shankha ; Dory, Michal ; Ghaffari, Mohsen..
http://arxiv.org/abs/2003.01254.  , 2020
Link: http://arxiv.org/abs/200..
 
?
10

Massively Parallel Algorithms for Small Subgraph Counting:

Biswas, Amartya Shankha ; Eden, Talya ; Liu, Quanquan C..
http://arxiv.org/abs/2002.08299.  , 2020
Link: http://arxiv.org/abs/200..
 
?
11

Local Access to Huge Random Objects Through Partial Samplin:

Biswas, Amartya Shankha ; Rubinfeld, Ronitt ; Yodpinyanee, Anak
doi:10.4230/LIPIcs.ITCS.2020.27.  , 2020
Link: https://doi.org/10.4230/..
 
?
12

Testing Tail Weight of a Distribution Via Hazard Rate:

Aliakbarpour, Maryam ; Biswas, Amartya Shankha ; Ravichandran, Kavya.
http://arxiv.org/abs/2010.02888.  , 2020
Link: http://arxiv.org/abs/201..
 
?
13

Sublinear-Time Algorithms for Counting Star Subgraphs via E..:

Aliakbarpour, Maryam ; Biswas, Amartya Shankha ; Gouleakis, Themistoklis...
http://dx.doi.org/10.1007/s00453-017-0287-3.  , 2018
Link: http://hdl.handle.net/17..
 
?
14

Local-access generators for basic random graph models:

Biswas, Amartya Shankha
http://hdl.handle.net/1721.1/119600.  , 2018
Link: http://hdl.handle.net/17..
 
?
15

Local Access to Huge Random Objects through Partial Samplin:

Biswas, Amartya Shankha ; Rubinfeld, Ronitt ; Yodpinyanee, Anak
http://arxiv.org/abs/1711.10692.  , 2017
Link: http://arxiv.org/abs/171..
 
1-15