default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSuman Kalyan Bera
Person information
- affiliation: University of California at Santa Cruz, CA, USA
- affiliation (former): Dartmouth College, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c13]Suman K. Bera
, Jayesh Choudhari, Shahrzad Haddadan, Sara Ahmadian:
DeMEtRIS: Counting (near)-Cliques by Crawling. WSDM 2023: 312-320- 2022
- [j4]Suman K. Bera, Lior Gishboliner, Yevgeny Levanzov, C. Seshadhri, Asaf Shapira:
Counting Subgraphs in Degenerate Graphs. J. ACM 69(3): 23:1-23:21 (2022) - [c12]Suman K. Bera, Sayan Bhattacharya, Jayesh Choudhari, Prantar Ghosh:
A New Dynamic Algorithm for Densest Subhypergraphs. WWW 2022: 1093-1103 - [c11]Suman K. Bera, Syamantak Das, Sainyam Galhotra, Sagar Sudhir Kale:
Fair k-Center Clustering in MapReduce and Streaming Settings. WWW 2022: 1414-1422 - [i14]Suman K. Bera, Sayan Bhattacharya, Jayesh Choudhari, Prantar Ghosh:
A New Dynamic Algorithm for Densest Subhypergraphs. CoRR abs/2204.08106 (2022) - [i13]Sabyasachi Basu, Suman Kalyan Bera, C. Seshadhri:
Spectral Triadic Decompositions of Real-World Networks. CoRR abs/2211.06352 (2022) - [i12]Suman K. Bera, Jayesh Choudhari, Shahrzad Haddadan, Sara Ahmadian:
DeMEtRIS: Counting (near)-Cliques by Crawling. CoRR abs/2212.03957 (2022) - 2021
- [c10]Suman K. Bera, Noujan Pashanasangi, C. Seshadhri:
Near-Linear Time Homomorphism Counting in Bounded Degeneracy Graphs: The Barrier of Long Induced Cycles. SODA 2021: 2315-2332 - 2020
- [c9]Suman K. Bera, Amit Chakrabarti, Prantar Ghosh:
Graph Coloring via Degeneracy in Streaming and Other Space-Conscious Models. ICALP 2020: 11:1-11:21 - [c8]Suman K. Bera, Noujan Pashanasangi, C. Seshadhri:
Linear Time Subgraph Counting, Graph Degeneracy, and the Chasm at Size Six. ITCS 2020: 38:1-38:20 - [c7]Suman K. Bera, C. Seshadhri:
How to Count Triangles, without Seeing the Whole Graph. KDD 2020: 306-316 - [c6]Suman K. Bera, C. Seshadhri:
How the Degeneracy Helps for Triangle Counting in Graph Streams. PODS 2020: 457-467 - [i11]Suman K. Bera, C. Seshadhri:
How the Degeneracy Helps for Triangle Counting in Graph Streams. CoRR abs/2003.13151 (2020) - [i10]Suman K. Bera, C. Seshadhri:
How to Count Triangles, without Seeing the Whole Graph. CoRR abs/2006.11947 (2020) - [i9]Nihesh Anderson, Suman K. Bera, Syamantak Das, Yang Liu:
Distributional Individual Fairness in Clustering. CoRR abs/2006.12589 (2020) - [i8]Suman K. Bera, Noujan Pashanasangi, C. Seshadhri:
Near-Linear Time Homomorphism Counting in Bounded Degeneracy Graphs: The Barrier of Long Induced Cycles. CoRR abs/2010.08083 (2020)
2010 – 2019
- 2019
- [c5]Suman Kalyan Bera, Deeparnab Chakrabarty, Nicolas Flores, Maryam Negahbani:
Fair Algorithms for Clustering. NeurIPS 2019: 4955-4966 - [i7]Suman K. Bera, Deeparnab Chakrabarty, Maryam Negahbani:
Fair Algorithms for Clustering. CoRR abs/1901.02393 (2019) - [i6]Suman K. Bera, Amit Chakrabarti, Prantar Ghosh:
Graph Coloring via Degeneracy in Streaming and Other Space-Conscious Models. CoRR abs/1905.00566 (2019) - [i5]Suman K. Bera, Noujan Pashanasangi, C. Seshadhri:
Linear Time Subgraph Counting, Graph Degeneracy, and the Chasm at Size Six. CoRR abs/1911.05896 (2019) - 2018
- [i4]Suman Kalyan Bera, Prantar Ghosh:
Coloring in Graph Streams. CoRR abs/1807.07640 (2018) - 2017
- [c4]Suman K. Bera, Amit Chakrabarti:
Towards Tighter Space Bounds for Counting Triangles and Other Substructures in Graph Streams. STACS 2017: 11:1-11:14 - 2016
- [j3]Suman Kalyan Bera, Syamantak Das, Amit Kumar:
Minimizing average flow-time under knapsack constraint. Theor. Comput. Sci. 609: 516-525 (2016) - 2015
- [c3]Suman K. Bera, Amit Chakrabarti:
A Depth-Five Lower Bound for Iterated Matrix Multiplication. CCC 2015: 183-197 - 2014
- [j2]Suman Kalyan Bera, Shalmoli Gupta, Amit Kumar, Sambuddha Roy:
Approximation algorithms for the partition vertex cover problem. Theor. Comput. Sci. 555: 2-8 (2014) - [c2]Suman Kalyan Bera, Syamantak Das, Amit Kumar:
Minimizing Average Flow-Time under Knapsack Constraint. COCOON 2014: 584-595 - 2013
- [j1]Sourav Dutta, Ankur Narang, Suman K. Bera:
Streaming Quotient Filter: A Near Optimal Approximate Duplicate Detection Approach for Data Streams. Proc. VLDB Endow. 6(8): 589-600 (2013) - [c1]Suman Kalyan Bera, Shalmoli Gupta, Amit Kumar, Sambuddha Roy:
Approximation Algorithms for the Partition Vertex Cover Problem. WALCOM 2013: 137-145 - [i3]Suman Kalyan Bera, Anamitra R. Choudhury, Syamantak Das, Sambuddha Roy, Jayram S. Thatchachar:
Fenchel Duals for Drifting Adversaries. CoRR abs/1309.5904 (2013) - 2012
- [i2]Suman K. Bera, Sourav Dutta, Ankur Narang, Souvik Bhattacherjee:
Advanced Bloom Filter Based Algorithms for Efficient Approximate Data De-Duplication in Streams. CoRR abs/1212.3964 (2012) - 2011
- [i1]Suman Kalyan Bera, Shalmoli Gupta, Amit Kumar, Sambuddha Roy:
Approximation Algorithms for Edge Partitioned Vertex Cover Problems. CoRR abs/1112.1945 (2011)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-10 01:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
