Generalised Symmetries of Polynomials in Algebraic Complexity - Carl Sturtivant (FOCS, 1982)

Efficiently Inverting Bijections Given by Straight Line Programs - Carl Sturtivant; Zhi-Li Zhang (FOCS, 1990)

What is an Efficient Implementation of the lambda-calculus? - Gudmund Skovbjerg Frandsen; Carl Sturtivant (FPCA, 1991)

An Arithmetic Model of Computation Equivalent to Threshold Circuits. - Joan Boyar; Gudmund Skovbjerg Frandsen; Carl Sturtivant (Theor. Comput. Sci., 1992)

Approximating Center Points with Iterated Radon Points. - Kenneth L. Clarkson; David Eppstein; Gary L. Miller; Carl Sturtivant; Shang-Hua Teng (SCG, 1993)

The Computational Efficacy of Finite-Field Arithmetic. - Carl Sturtivant; Gudmund Skovbjerg Frandsen (Theor. Comput. Sci., 1993)

Approximating center points with iterative Radon points. - Kenneth L. Clarkson; David Eppstein; Gary L. Miller; Carl Sturtivant; Shang-Hua Teng (Int. J. Comput. Geom. Appl., 1996)

A secure and verifiable outsourcing scheme for matrix inverse computation. - Chunqiang Hu; Abdulrahman Alhothaily; Arwa Alrawais; Xiuzhen Cheng 001; Carl Sturtivant; Hang Liu 003 (INFOCOM, 2017)

A Novel Secure and Efficient Data Aggregation Scheme for IoT. - Ruinian Li; Carl Sturtivant; Jiguo Yu; Xiuzhen Cheng 001 (IEEE Internet Things J., 2019)

A Circuit Complexity Formulation of Algorithmic Information Theory. - Cole Wyeth; Carl Sturtivant (CoRR, 2023)