Partitions and Clifford algebras. - René Schott; G. Stacey Staples (Eur. J. Comb., 2008)

Computational Complexity Reductions Using Clifford Algebras. - René Schott; G. Stacey Staples (Geometric Algebra Computing, 2010)

On the Complexity of Cycle Enumeration for Simple Graphs. - René Schott; G. Stacey Staples (Guide to Geometric Algebra in Practice, 2011)

Nilpotent Adjacency Matrices and Random Graphs. - René Schott; G. Stacey Staples (Ars Comb., 2011)

Complexity of counting cycles using zeons. - René Schott; G. Stacey Staples (Comput. Math. Appl., 2011)

Operator calculus approach to minimal paths: Precomputed routing in a store and forward satellite constellation. - Hugo Cruz-Sanchez; G. Stacey Staples; René Schott; Yeqiong Song (GLOBECOM, 2012)

An Operator Calculus Approach for Multi-constrained Routing in Wireless Sensor Networks. - Bilel Nefzi; René Schott; Yeqiong Song; George Stacey Staples; Evangelia Tsiontsiou (MobiHoc, 2015)

Zeons, orthozeons, and processes on colored graphs. - G. Stacey Staples (CGI, 2017)

Clifford Algebras and Zeons - Geometry to Combinatorics and Beyond - George Stacey Staples (Clifford Algebras and Zeons, 2019)

New Path Centrality Based on Operator Calculus Approach for Wireless Sensor Network Deployment. - Abdusy Syarif; Abdelhafid Abouaissa; Lhassane Idoumghar; Pascal Lorenz; René Schott; G. Stacey Staples (IEEE Trans. Emerg. Top. Comput., 2019)

Zeon and Idem-Clifford Formulations of Hypergraph Problems. - Samuel Ewing; G. Stacey Staples (CoRR, 2022)