Author

Cooper LaPorte

h-index 0 View on Semantic Scholar

We have 1 of 1 papers

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Aug 2026

Sublinear Algorithms for Estimating the Number of Hyperedges in Arbitrary Hypergraphs

A randomized algorithm is given that returns a $(1+\varepsilon)-approximation to $m$ with high probability, making $O(\varepsilon^{-2}\sqrt{n} + \sqrt{n}\log n)$ queries, and it is proved that $\Omega(\sqrt{n})$ queries are necessary for any algorithm that obtains a constant factor approximation to $m$.

Deeparnab Chakrabarty, Cooper LaPorte, C. Seshadhri · 0 citations