| Fair algorithms for clustering S Bera, D Chakrabarty, N Flores, M Negahbani Advances in Neural Information Processing Systems, 4955-4966, 2019 | 384 | 2019 |
| Towards tighter space bounds for counting triangles and other substructures in graph streams SK Bera, A Chakrabarti 34th Symposium on Theoretical Aspects of Computer Science, 2017 | 73 | 2017 |
| Streaming quotient filter: A near optimal approximate duplicate detection approach for data streams S Dutta, A Narang, SK Bera Proceedings of the VLDB Endowment 6 (8), 589-600, 2013 | 55 | 2013 |
| Graph coloring via degeneracy in streaming and other space-conscious models SK Bera, A Chakrabarti, P Ghosh 47th International Colloquium on Automata, Languages, and Programming (ICALP …, 2020 | 48 | 2020 |
| Linear time subgraph counting, graph degeneracy, and the chasm at size six SK Bera, N Pashanasangi, C Seshadhri Innovations in Theoretical Computer Science Conference (ITCS 2020), 38:1--38:20, 2020 | 47 | 2020 |
| How the degeneracy helps for triangle counting in graph streams SK Bera, C Seshadhri Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of …, 2020 | 35 | 2020 |
| Counting subgraphs in degenerate graphs SK Bera, L Gishboliner, Y Levanzov, C Seshadhri, A Shapira ACM Journal of the ACM (JACM) 69 (3), 1-21, 2022 | 34 | 2022 |
| How to count triangles, without seeing the whole graph SK Bera, C Seshadhri Proceedings of the 26th ACM SIGKDD international conference on knowledge …, 2020 | 34 | 2020 |
| Approximation algorithms for the partition vertex cover problem SK Bera, S Gupta, A Kumar, S Roy Theoretical Computer Science 555, 2-8, 2014 | 33 | 2014 |
| Near-linear time homomorphism counting in bounded degeneracy graphs: The barrier of long induced cycles SK Bera, N Pashanasangi, C Seshadhri Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021 | 24 | 2021 |
| Distributional individual fairness in clustering N Anderson, SK Bera, S Das, Y Liu arXiv preprint arXiv:2006.12589, 2020 | 22 | 2020 |
| A new dynamic algorithm for densest subhypergraphs SK Bera, S Bhattacharya, J Choudhari, P Ghosh Proceedings of the ACM Web Conference 2022, 1093-1103, 2022 | 20 | 2022 |
| Fair k-center clustering in MapReduce and streaming settings SK Bera, S Das, S Galhotra, SS Kale Proceedings of the ACM Web Conference 2022, 1414-1422, 2022 | 19 | 2022 |
| Coloring in graph streams SK Bera, P Ghosh arXiv preprint arXiv:1807.07640, 2018 | 16 | 2018 |
| A depth-five lower bound for iterated matrix multiplication SK Bera, A Chakrabarti 30th Conference on Computational Complexity (CCC 2015), 183-197, 2015 | 12 | 2015 |
| Advanced bloom filter based algorithms for efficient approximate data de-duplication in streams SK Bera, S Dutta, A Narang, S Bhattacherjee arXiv preprint arXiv:1212.3964, 2012 | 11 | 2012 |
| Syamantak Das, and Yang Liu. Distributional individual fairness in clustering N Anderson, SK Bera arXiv preprint arXiv:2006.12589, 2020 | 6 | 2020 |
| Spectral triadic decompositions of real-world networks S Basu, SK Bera, C Seshadhri SIAM Journal on Mathematics of Data Science 6 (3), 703-730, 2024 | 4 | 2024 |
| Demetris: counting (near)-cliques by crawling S Bera, J Choudhari, S Haddadan, S Ahmadian ACM Transactions on Intelligent Systems and Technology 16 (5), 1-25, 2025 | 2 | 2025 |
| Subgraph Counting and Vertex Coloring in Large Graphs SK Bera Dartmouth College, 2019 | 1 | 2019 |
C. SeshadhriUniversity of California, Santa CruzVerified email at ucsc.edu
