Optimizing query execution for variable-aligned length compression of bitmap indices. - Ryan Slechta; Jason Sawin; Ben McCamish; David Chiu 001; Guadalupe Canahuate (IDEAS, 2014)

Automatic Reassembly of Three-Dimensional Jigsaw Puzzles. - Anna Grim; Timothy O'Connor; Peter J. Olver; Chehrzad Shakiban; Ryan Slechta; Robert Thompson 007 (Int. J. Image Graph., 2016)

Resilience Analysis of Top K Selection Algorithms. - Ryan Slechta; Laura Monroe; Nathan DeBardeleben; Qiang Guan; Joanne Wendelberger; Sarah Michalak (EDCC, 2017)

Edge contraction in persistence-generated discrete Morse vector fields. - Tamal K. Dey; Ryan Slechta (Comput. Graph., 2018)

Persistence of the Conley Index in Combinatorial Dynamical Systems. - Tamal K. Dey; Marian Mrozek; Ryan Slechta (SoCG, 2020)

Filtration Simplification for Persistent Homology via Edge Contraction. - Tamal K. Dey; Ryan Slechta (J. Math. Imaging Vis., 2020)

Approximating lower-star persistence via 2D combinatorial map simplification. - Guillaume Damiand; Eduardo Paluzo-Hidalgo; Ryan Slechta; Rocío González-Díaz (Pattern Recognit. Lett., 2020)

Tracking Dynamical Features via Continuation and Persistence. - Tamal K. Dey; Michal Lipinski; Marian Mrozek; Ryan Slechta (SoCG, 2022)

Persistence of Conley-Morse Graphs in Combinatorial Dynamical Systems. - Tamal K. Dey; Marian Mrozek; Ryan Slechta (SIAM J. Appl. Dyn. Syst., 2022)

Computing Connection Matrices via Persistence-Like Reductions. - Tamal K. Dey; Michal Lipinski; Marian Mrozek; Ryan Slechta (SIAM J. Appl. Dyn. Syst., 2024)