Approximately Counting Triangles in Sublinear Time - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Talya Eden, Amit Levi, Dana Ron, C. Seshadhri. Approximately Counting Triangles in Sublinear Time. In Venkatesan Guruswami, editor, IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015, Berkeley, CA, USA, 17-20 October, 2015. pages 614-633, IEEE, 2015. [doi]

The following publications are possibly variants of this publication:

Approximately Counting Triangles in Sublinear TimeTalya Eden, Amit Levi, Dana Ron. eccc, 22:46, 2015. [doi]

Approximately Counting Triangles in Sublinear TimeTalya Eden, Amit Levi, Dana Ron, C. Seshadhri. SICOMP, 46(5):1603-1646, 2017. [doi]

Approximating the Arboricity in Sublinear TimeTalya Eden, Saleet Mossel, Dana Ron. soda 2022: 2404-2425 [doi]

runs on WebDSL