( en | de | ru )

 

Disambiguation of "Bera, Suman K."

Author of the publication

copydeleteadd this publication to your clipboard
Towards Tighter Space Bounds for Counting Triangles and Other Substructures in Graph Streams.

, and . STACS, volume 66 of LIPIcs, page 11:1-11:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Agnieszka Bera

Soumya Bera

Nimisha Suman

Hazem Suman

Suman Baidya

 

Other publications of authors with the same name

A New Dynamic Algorithm for Densest Subhypergraphs., , , and . WWW, page 1093-1103. ACM, (2022)A Depth-Five Lower Bound for Iterated Matrix Multiplication., and . CCC, volume 33 of LIPIcs, page 183-197. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)How the Degeneracy Helps for Triangle Counting in Graph Streams., and . PODS, page 457-467. ACM, (2020)DeMEtRIS: Counting (near)-Cliques by Crawling., , , and . WSDM, page 312-320. ACM, (2023)Linear Time Subgraph Counting, Graph Degeneracy, and the Chasm at Size Six., , and . ITCS, volume 151 of LIPIcs, page 38:1-38:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Near-Linear Time Homomorphism Counting in Bounded Degeneracy Graphs: The Barrier of Long Induced Cycles., , and . SODA, page 2315-2332. SIAM, (2021)Graph Coloring via Degeneracy in Streaming and Other Space-Conscious Models., , and . CoRR, (2019)How to Count Triangles, without Seeing the Whole Graph., and . KDD, page 306-316. ACM, (2020)Towards Tighter Space Bounds for Counting Triangles and Other Substructures in Graph Streams., and . STACS, volume 66 of LIPIcs, page 11:1-11:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Fair k-Center Clustering in MapReduce and Streaming Settings., , , and . WWW, page 1414-1422. ACM, (2022)