Suman K. Bera

23 papers A* 6A 4Journal 13
YearRankTypeTitle / Venue / Authors
2025 J jnl
DeMEtRIS: Counting (near)-Cliques by Crawling.
ACM Trans. Intell. Syst. Technol.
Suman K. Bera, Jayesh Choudhari, Shahrzad Haddadan, Sara Ahmadian
2023 A conf
DeMEtRIS: Counting (near)-Cliques by Crawling.
WSDM
Suman K. Bera, Jayesh Choudhari, Shahrzad Haddadan, Sara Ahmadian
2022 A* conf
A New Dynamic Algorithm for Densest Subhypergraphs.
WWW
Suman K. Bera, Sayan Bhattacharya, Jayesh Choudhari, Prantar Ghosh
2022 J jnl
A New Dynamic Algorithm for Densest Subhypergraphs.
CoRR
Suman K. Bera, Sayan Bhattacharya, Jayesh Choudhari, Prantar Ghosh
2022 J jnl
Counting Subgraphs in Degenerate Graphs.
J. ACM
Suman K. Bera, Lior Gishboliner, Yevgeny Levanzov, C. Seshadhri, Asaf Shapira
2022 J jnl
DeMEtRIS: Counting (near)-Cliques by Crawling.
CoRR
Suman K. Bera, Jayesh Choudhari, Shahrzad Haddadan, Sara Ahmadian
2022 A* conf
Fair k-Center Clustering in MapReduce and Streaming Settings.
WWW
Suman K. Bera, Syamantak Das, Sainyam Galhotra, Sagar Sudhir Kale
2021 A* conf
Near-Linear Time Homomorphism Counting in Bounded Degeneracy Graphs: The Barrier of Long Induced Cycles.
SODA
Suman K. Bera, Noujan Pashanasangi, C. Seshadhri
2020 J jnl
Distributional Individual Fairness in Clustering.
CoRR
Nihesh Anderson, Suman K. Bera, Syamantak Das, Yang Liu
2020 A* conf
Graph Coloring via Degeneracy in Streaming and Other Space-Conscious Models.
ICALP
Suman K. Bera, Amit Chakrabarti, Prantar Ghosh
2020 A* conf
How the Degeneracy Helps for Triangle Counting in Graph Streams.
PODS
Suman K. Bera, C. Seshadhri
2020 J jnl
How the Degeneracy Helps for Triangle Counting in Graph Streams.
CoRR
Suman K. Bera, C. Seshadhri
2020 A* conf
How to Count Triangles, without Seeing the Whole Graph.
KDD
Suman K. Bera, C. Seshadhri
2020 J jnl
How to Count Triangles, without Seeing the Whole Graph.
CoRR
Suman K. Bera, C. Seshadhri
2020 A conf
Linear Time Subgraph Counting, Graph Degeneracy, and the Chasm at Size Six.
ITCS
Suman K. Bera, Noujan Pashanasangi, C. Seshadhri
2020 J jnl
Near-Linear Time Homomorphism Counting in Bounded Degeneracy Graphs: The Barrier of Long Induced Cycles.
CoRR
Suman K. Bera, Noujan Pashanasangi, C. Seshadhri
2019 J jnl
Fair Algorithms for Clustering.
CoRR
Suman K. Bera, Deeparnab Chakrabarty, Maryam Negahbani
2019 J jnl
Graph Coloring via Degeneracy in Streaming and Other Space-Conscious Models.
CoRR
Suman K. Bera, Amit Chakrabarti, Prantar Ghosh
2019 J jnl
Linear Time Subgraph Counting, Graph Degeneracy, and the Chasm at Size Six.
CoRR
Suman K. Bera, Noujan Pashanasangi, C. Seshadhri
2017 A conf
Towards Tighter Space Bounds for Counting Triangles and Other Substructures in Graph Streams.
STACS
Suman K. Bera, Amit Chakrabarti
2015 A conf
A Depth-Five Lower Bound for Iterated Matrix Multiplication.
CCC
Suman K. Bera, Amit Chakrabarti
2013 J jnl
Streaming Quotient Filter: A Near Optimal Approximate Duplicate Detection Approach for Data Streams.
Proc. VLDB Endow.
Sourav Dutta, Ankur Narang, Suman K. Bera
2012 J jnl
Advanced Bloom Filter Based Algorithms for Efficient Approximate Data De-Duplication in Streams
CoRR
Suman K. Bera, Sourav Dutta, Ankur Narang, Souvik Bhattacherjee