I agree that this site is using cookies. You can find further informations
here
.
X
Login
My folder (
0
)
Home
About us
Home About us
Our history
Profile
Press & public relations
Friends
The library in figures
Exhibitions
Projects
Training, internships, careers
Films
Services & Information
Home Services & Information
Lending and interlibrary loans
Returns and renewals
Training and library tours
My Account
Library cards
New to the library?
Download Information
Opening hours
Learning spaces
PC, WLAN, copy, scan and print
Catalogs and collections
Home Catalogs and Collections
Rare books and manuscripts
Digital collections
Subject Areas
Our sites
Home Our sites
Central Library
Law Library (Juridicum)
BB Business and Economics (BB11)
BB Physics and Electrical Engineering
TB Engineering and Social Sciences
TB Economics and Nautical Sciences
TB Music
TB Art & Design
TB Bremerhaven
Contact the library
Home Contact the library
Staff Directory
Open access & publishing
Home Open access & publishing
Reference management: Citavi & RefWorks
Publishing documents
Open Access in Bremen
Show Desktop-Version
Toggle navigation
Biswas, Amartya Shankha
14
results:
OpenAccess-fulltext X
Search for persons
X
Sorted by: Relevance
Sorted by: Year
?
1
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/..
?
2
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/..
?
3
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..
?
4
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..
?
5
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/..
?
6
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..
?
7
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..
?
8
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..
?
9
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/..
?
10
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..
?
11
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..
?
12
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..
?
13
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..
?
14
Sublinear-Time Algorithms for Counting Star Subgraphs with ..:
Aliakbarpour, Maryam
;
Biswas, Amartya Shankha
;
Gouleakis, Themistoklis
...
http://arxiv.org/abs/1601.04233. , 2016
Link:
http://arxiv.org/abs/160..
1-14