Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Amartya Shankha Biswas
@article{DBLP:journals/corr/abs-2403-00129,
author = {Amartya Shankha Biswas and
Ruidi Cao and
Edward Pyne and
Ronitt Rubinfeld},
title = {Average-Case Local Computation Algorithms},
journal = {CoRR},
volume = {abs/2403.00129},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2403.00129},
doi = {10.48550/ARXIV.2403.00129},
eprinttype = {arXiv},
eprint = {2403.00129},
timestamp = {Tue, 02 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2403-00129.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alt/AliakbarpourBRR23,
author = {Maryam Aliakbarpour and
Amartya Shankha Biswas and
Kavya Ravichandran and
Ronitt Rubinfeld},
editor = {Shipra Agrawal and
Francesco Orabona},
title = {Testing Tail Weight of a Distribution Via Hazard Rate},
booktitle = {International Conference on Algorithmic Learning Theory, February
20-23, 2023, Singapore},
series = {Proceedings of Machine Learning Research},
volume = {201},
pages = {34--81},
publisher = {{PMLR}},
year = {2023},
url = {https://proceedings.mlr.press/v201/aliakbarpour23a.html},
timestamp = {Wed, 15 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/alt/AliakbarpourBRR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/BiswasELRM22,
author = {Amartya Shankha Biswas and
Talya Eden and
Quanquan C. Liu and
Ronitt Rubinfeld and
Slobodan Mitrovic},
editor = {Amit Chakrabarti and
Chaitanya Swamy},
title = {Massively Parallel Algorithms for Small Subgraph Counting},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2022, September 19-21, 2022, University
of Illinois, Urbana-Champaign, {USA} (Virtual Conference)},
series = {LIPIcs},
volume = {245},
pages = {39:1--39:28},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.39},
doi = {10.4230/LIPICS.APPROX/RANDOM.2022.39},
timestamp = {Mon, 26 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/BiswasELRM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/BiswasPR22,
author = {Amartya Shankha Biswas and
Edward Pyne and
Ronitt Rubinfeld},
editor = {Mark Braverman},
title = {Local Access to Random Walks},
booktitle = {13th Innovations in Theoretical Computer Science Conference, {ITCS}
2022, January 31 - February 3, 2022, Berkeley, CA, {USA}},
series = {LIPIcs},
volume = {215},
pages = {24:1--24:22},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2022.24},
doi = {10.4230/LIPICS.ITCS.2022.24},
timestamp = {Wed, 26 Jan 2022 14:33:51 +0100},
biburl = {https://dblp.org/rec/conf/innovations/BiswasPR22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/BiswasER21,
author = {Amartya Shankha Biswas and
Talya Eden and
Ronitt Rubinfeld},
editor = {Mary Wootters and
Laura Sanit{\`{a}}},
title = {Towards a Decomposition-Optimal Algorithm for Counting and Sampling
Arbitrary Motifs in Sublinear Time},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2021, August 16-18, 2021, University
of Washington, Seattle, Washington, {USA} (Virtual Conference)},
series = {LIPIcs},
volume = {207},
pages = {55:1--55:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.55},
doi = {10.4230/LIPICS.APPROX/RANDOM.2021.55},
timestamp = {Tue, 21 Sep 2021 09:36:32 +0200},
biburl = {https://dblp.org/rec/conf/approx/BiswasER21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spaa/BiswasDGMN21,
author = {Amartya Shankha Biswas and
Michal Dory and
Mohsen Ghaffari and
Slobodan Mitrovic and
Yasamin Nazari},
editor = {Kunal Agrawal and
Yossi Azar},
title = {Massively Parallel Algorithms for Distance Approximation and Spanners},
booktitle = {{SPAA} '21: 33rd {ACM} Symposium on Parallelism in Algorithms and
Architectures, Virtual Event, USA, 6-8 July, 2021},
pages = {118--128},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3409964.3461784},
doi = {10.1145/3409964.3461784},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/spaa/BiswasDGMN21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2102-07740,
author = {Amartya Shankha Biswas and
Edward Pyne and
Ronitt Rubinfeld},
title = {Local Access to Random Walks},
journal = {CoRR},
volume = {abs/2102.07740},
year = {2021},
url = {https://arxiv.org/abs/2102.07740},
eprinttype = {arXiv},
eprint = {2102.07740},
timestamp = {Thu, 18 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2102-07740.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2107-06582,
author = {Amartya Shankha Biswas and
Talya Eden and
Ronitt Rubinfeld},
title = {Towards a Decomposition-Optimal Algorithm for Counting and Sampling
Arbitrary Motifs in Sublinear Time},
journal = {CoRR},
volume = {abs/2107.06582},
year = {2021},
url = {https://arxiv.org/abs/2107.06582},
eprinttype = {arXiv},
eprint = {2107.06582},
timestamp = {Wed, 21 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2107-06582.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/BiswasRY20,
author = {Amartya Shankha Biswas and
Ronitt Rubinfeld and
Anak Yodpinyanee},
editor = {Thomas Vidick},
title = {Local Access to Huge Random Objects Through Partial Sampling},
booktitle = {11th Innovations in Theoretical Computer Science Conference, {ITCS}
2020, January 12-14, 2020, Seattle, Washington, {USA}},
series = {LIPIcs},
volume = {151},
pages = {27:1--27:65},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2020.27},
doi = {10.4230/LIPICS.ITCS.2020.27},
timestamp = {Wed, 15 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/BiswasRY20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2002-08299,
author = {Amartya Shankha Biswas and
Talya Eden and
Quanquan C. Liu and
Slobodan Mitrovic and
Ronitt Rubinfeld},
title = {Parallel Algorithms for Small Subgraph Counting},
journal = {CoRR},
volume = {abs/2002.08299},
year = {2020},
url = {https://arxiv.org/abs/2002.08299},
eprinttype = {arXiv},
eprint = {2002.08299},
timestamp = {Mon, 02 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2002-08299.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2003-01254,
author = {Amartya Shankha Biswas and
Michal Dory and
Mohsen Ghaffari and
Slobodan Mitrovic and
Yasamin Nazari},
title = {Massively Parallel Algorithms for Distance Approximation and Spanners},
journal = {CoRR},
volume = {abs/2003.01254},
year = {2020},
url = {https://arxiv.org/abs/2003.01254},
eprinttype = {arXiv},
eprint = {2003.01254},
timestamp = {Mon, 23 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2003-01254.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2010-02888,
author = {Maryam Aliakbarpour and
Amartya Shankha Biswas and
Kavya Ravichandran and
Ronitt Rubinfeld},
title = {Testing Tail Weight of a Distribution Via Hazard Rate},
journal = {CoRR},
volume = {abs/2010.02888},
year = {2020},
url = {https://arxiv.org/abs/2010.02888},
eprinttype = {arXiv},
eprint = {2010.02888},
timestamp = {Tue, 13 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2010-02888.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AliakbarpourBGP18,
author = {Maryam Aliakbarpour and
Amartya Shankha Biswas and
Themis Gouleakis and
John Peebles and
Ronitt Rubinfeld and
Anak Yodpinyanee},
title = {Sublinear-Time Algorithms for Counting Star Subgraphs via Edge Sampling},
journal = {Algorithmica},
volume = {80},
number = {2},
pages = {668--697},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0287-3},
doi = {10.1007/S00453-017-0287-3},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AliakbarpourBGP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/BiswasD17,
author = {Amartya Shankha Biswas and
Erik D. Demaine},
editor = {Joachim Gudmundsson and
Michiel H. M. Smid},
title = {Common Development of Prisms, Anti-Prisms, Tetrahedra, and Wedges},
booktitle = {Proceedings of the 29th Canadian Conference on Computational Geometry,
{CCCG} 2017, July 26-28, 2017, Carleton University, Ottawa, Ontario,
Canada},
pages = {202--207},
year = {2017},
timestamp = {Thu, 12 Mar 2020 11:28:08 +0100},
biburl = {https://dblp.org/rec/conf/cccg/BiswasD17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1711-10692,
author = {Amartya Shankha Biswas and
Ronitt Rubinfeld and
Anak Yodpinyanee},
title = {Local-Access Generators for Basic Random Graph Models},
journal = {CoRR},
volume = {abs/1711.10692},
year = {2017},
url = {http://arxiv.org/abs/1711.10692},
eprinttype = {arXiv},
eprint = {1711.10692},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1711-10692.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AliakbarpourBGP16,
author = {Maryam Aliakbarpour and
Amartya Shankha Biswas and
Themistoklis Gouleakis and
John Peebles and
Ronitt Rubinfeld and
Anak Yodpinyanee},
title = {Sublinear-Time Algorithms for Counting Star Subgraphs with Applications
to Join Selectivity Estimation},
journal = {CoRR},
volume = {abs/1601.04233},
year = {2016},
url = {http://arxiv.org/abs/1601.04233},
eprinttype = {arXiv},
eprint = {1601.04233},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AliakbarpourBGP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
last updated on 2024-04-25 02:09 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
