Abiyaz Chowdhury

According to our database, Abiyaz Chowdhury authored at least 3 papers between 2022 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

GraphZeppelin: How to Find Connected Components (Even When Graphs Are Dense, Dynamic, and Massive).

David Tench, Evan West, Victor Zhang, Michael A. Bender, Abiyaz Chowdhury, Daniel DeLayo, J. Ahmed Dellas, Martín Farach-Colton, Tyler Seip, Kenny Zhang

ACM Trans. Database Syst., September, 2024

2022

GraphZeppelin: Storage-Friendly Sketching for Connected Components on Dynamic Graph Streams.

David Tench, Evan West, Victor Zhang, Michael A. Bender, Abiyaz Chowdhury, J. Ahmed Dellas, Martin Farach-Colton, Tyler Seip, Kenny Zhang

Proceedings of the SIGMOD '22: International Conference on Management of Data, Philadelphia, PA, USA, June 12, 2022

When Are Cache-Oblivious Algorithms Cache Adaptive? A Case Study of Matrix Multiplication and Sorting.

Arghya Bhattacharya, Abiyaz Chowdhury, Helen Xu, Rathish Das, Rezaul Alam Chowdhury, Rob Johnson, Rishab Nithyanand, Michael A. Bender

Proceedings of the 30th Annual European Symposium on Algorithms, 2022