Numerical Tic-Tac-Toe on the 4×4 Board. - Bryce Sandlund; Kerrick Staley; Michael Dixon; Steve Butler (COCOON, 2014)

Offline Dynamic Higher Connectivity. - Richard Peng; Bryce Sandlund; Daniel Dominic Sleator (CoRR, 2017)

Improved Time and Space Bounds for Dynamic Range Mode. - Hicham El-Zein; Meng He 001; J. Ian Munro; Bryce Sandlund (ESA, 2018)

On Euclidean Methods for Cubic and Quartic Jacobi Symbols. - Eric Bach 001; Bryce Sandlund (CoRR, 2018)

Baby-step giant-step algorithms for the symmetric group. - Eric Bach 001; Bryce Sandlund (J. Symb. Comput., 2018)

On Approximate Range Mode and Range Selection. - Hicham El-Zein; Meng He 001; J. Ian Munro; Yakov Nekrich; Bryce Sandlund (ISAAC, 2019)

Optimal Offline Dynamic 2, 3-Edge/Vertex Connectivity. - Richard Peng; Bryce Sandlund; Daniel Dominic Sleator (WADS, 2019)

A Simple Algorithm for Minimum Cuts in Near-Linear Time. - Antonio Molina Lovett; Bryce Sandlund (CoRR, 2019)

Lazy Search Trees. - Bryce Sandlund; Sebastian Wild (FOCS, 2020)

Faster Dynamic Range Mode. - Bryce Sandlund; Yinzhan Xu (ICALP, 2020)

A Simple Algorithm for Minimum Cuts in Near-Linear Time. - Nalin Bhardwaj; Antonio Molina Lovett; Bryce Sandlund (SWAT, 2020)

Space-Efficient Data Structures for Lattices. - J. Ian Munro; Bryce Sandlund; Corwin Sinnamon (SWAT, 2020)

Efficient Data Structures for Partial Orders, Range Modes, and Graph Cuts. - Bryce Sandlund (2021)

Selectable Heaps and Optimal Lazy Search Trees. - Bryce Sandlund; Lingyi Zhang (SODA, 2022)