11 citations · 29 across the 10 of their papers we have counts for
11 papers
Parametric Shortest Paths in a Linearly Interpolated Graph
Jacob Sriraman, Eli Barton, Brittany Terese Fasy +6
We consider the parametric shortest paths problem in a linearly interpolated graph. Given two positively-weighted directed graphs and the linearly…
ZipperChain: Transmuting Trusted Third-Party Services Into Trustless Atomic Broadcast
Matteo Bjornsson, Taylor Hardin, Taylor Heinecke +3
Distributed ledger technologies (DLTs) rely on distributed consensus mechanisms to reach agreement over the order of transactions and to provide immutability and availability of tr…
How Small Can Faithful Sets Be? Ordering Topological Descriptors
Brittany Terese Fasy, David L. Millman, Anna Schenfisch
Recent developments in shape reconstruction and comparison call for the use of many different (topological) descriptor types, such as persistence diagrams and Euler characteristic…
From Curves to Words and Back Again: Geometric Computation of Minimum-Area Homotopy
Hsien-Chih Chang, Brittany Terese Fasy, Bradley McCoy +2
Let be a generic closed curve in the plane. Samuel Blank, in his 1967 Ph.D. thesis, determined if is self-overlapping by geometrically constructing a combinatorial word fro…
Efficient Graph Reconstruction and Representation Using Augmented Persistence Diagrams
Brittany Terese Fasy, Samuel Micka, David L. Millman +2
Persistent homology is a tool that can be employed to summarize the shape of data by quantifying homological features. When the data is an object in , the (augmented)…
If You Must Choose Among Your Children, Pick the Right One
Benjamin Holmgren, Bradley McCoy, Brittany Fasy +1
Given a simplicial complex and an injective function from the vertices of to , we consider algorithms that extend to a discrete Morse function on . W…