activity
20132026
most citedAn optimal lower bound for monotonicity testing over hypergrids

1 citations · 1 across the 4 of their papers we have counts for

collaborators
Showing 2026 · cs.DSShow all

2 papers · 2 filters

cs.DS2026

Sublinear Algorithms for Estimating the Number of Hyperedges in Arbitrary Hypergraphs

Deeparnab Chakrabarty, Cooper LaPorte, C. Seshadhri

We study the problem of estimating the number of hyperedges in an arbitrary -vertex hypergraph using sublinear in queries. Note that the number of hyperedges, , can be ex…

cs.DS2026

Counting hypertriangles through hypergraph orientations

Daniel Paul-Pena, Vaishali Surianarayanan, Deeparnab Chakrabarty +1

Counting the number of small patterns is a central task in network analysis. While this problem is well studied for graphs, many real-world datasets are naturally modeled as hyperg…