Suman Kalyan Bera
Cytowane przez
Cytowane przez
Fair algorithms for clustering
S Bera, D Chakrabarty, N Flores, M Negahbani
Advances in Neural Information Processing Systems, 4955-4966, 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 (STACS 2017), 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
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
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
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
How to count triangles, without seeing the whole graph
SK Bera, C Seshadhri
Proceedings of the 26th ACM SIGKDD international conference on knowledge …, 2020
Approximation algorithms for the partition vertex cover problem
SK Bera, S Gupta, A Kumar, S Roy
Theoretical Computer Science 555, 2-8, 2014
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
Distributional individual fairness in clustering
N Anderson, SK Bera, S Das, Y Liu
arXiv preprint arXiv:2006.12589, 2020
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
Coloring in graph streams
SK Bera, P Ghosh
arXiv preprint arXiv:1807.07640, 2018
A depth-five lower bound for iterated matrix multiplication
SK Bera, A Chakrabarti
30th Conference on Computational Complexity (CCC 2015), 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
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
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
Syamantak Das, and Yang Liu. Distributional individual fairness in clustering
N Anderson, SK Bera
arXiv preprint arXiv:2006.12589, 2020
Fenchel duals for drifting adversaries
SK Bera, AR Choudhury, S Das, S Roy, JS Thatchachar
arXiv preprint arXiv:1309.5904, 2013
DeMEtRIS: Counting (near)-Cliques by Crawling
SK Bera, J Choudhari, S Haddadan, S Ahmadian
Proceedings of the Sixteenth ACM International Conference on Web Search and …, 2023
Spectral Triadic Decompositions of Real-World Networks
S Basu, SK Bera, C Seshadhri
arXiv preprint arXiv:2211.06352, 2022
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20