Amartya Shankha Biswas

Orcid: 0000-0002-5068-1524

According to our database1, Amartya Shankha Biswas authored at least 12 papers between 2016 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Average-Case Local Computation Algorithms.
CoRR, 2024

2023
Testing Tail Weight of a Distribution Via Hazard Rate.
Proceedings of the International Conference on Algorithmic Learning Theory, 2023

2022
Local Access to Random Walks.
Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

Massively Parallel Algorithms for Small Subgraph Counting.
Proceedings of the Approximation, 2022

2021
Massively Parallel Algorithms for Distance Approximation and Spanners.
Proceedings of the SPAA '21: 33rd ACM Symposium on Parallelism in Algorithms and Architectures, 2021

Towards a Decomposition-Optimal Algorithm for Counting and Sampling Arbitrary Motifs in Sublinear Time.
Proceedings of the Approximation, 2021

2020
Parallel Algorithms for Small Subgraph Counting.
CoRR, 2020

Local Access to Huge Random Objects Through Partial Sampling.
Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020

2018
Sublinear-Time Algorithms for Counting Star Subgraphs via Edge Sampling.
Algorithmica, 2018

2017
Local-Access Generators for Basic Random Graph Models.
CoRR, 2017

Common Development of Prisms, Anti-Prisms, Tetrahedra, and Wedges.
Proceedings of the 29th Canadian Conference on Computational Geometry, 2017

2016
Sublinear-Time Algorithms for Counting Star Subgraphs with Applications to Join Selectivity Estimation.
CoRR, 2016


  Loading...