49 citations · 287 across the 45 of their papers we have counts for
4 papers · 1 filter
Avoiding the Global Sort: A Faster Contour Tree Algorithm
Benjamin Raichel, C. Seshadhri
We revisit the classical problem of computing the \emph{contour tree} of a scalar field , where is a triangulated simplicial mesh in $\mat…
Characterizing short-term stability for Boolean networks over any distribution of transfer functions
C. Seshadhri, Andrew M. Smith, Yevgeniy Vorobeychik +2
We present a characterization of short-term stability of random Boolean networks under \emph{arbitrary} distributions of transfer functions. Given any distribution of transfer func…
Why do simple algorithms for triangle enumeration work in the real world?
Jonathan W. Berry, Luke A. Fostvedt, Daniel J. Nordman +3
Listing all triangles is a fundamental graph operation. Triangles can have important interpretations in real-world graphs, especially social and other interaction networks. Despite…
Property Testing on Product Distributions: Optimal Testers for Bounded Derivative Properties
Deeparnab Chakrabarty, Kashyap Dixit, Madhav Jha +1
The primary problem in property testing is to decide whether a given function satisfies a certain property, or is far from any function satisfying it. This crucially requires a not…