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

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

A secure and verifiable outsourcing scheme for matrix inverse computation - Chunqiang Hu; Abdulrahman Alhothaily; Arwa Alrawais; Xiuzhen Cheng; Carl Sturtivant; Hang Liu (2017 IEEE Conference on Computer Communications, INFOCOM 2017, Atlanta, GA, USA, May 1-4, 2017, 2017)

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)

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

Approximating Center Points with Iterated Radon Points - Kenneth L. Clarkson; David Eppstein; Gary L. Miller; Carl Sturtivant; Shang-Hua Teng (Proceedings of the Ninth Annual Symposium on Computational GeometrySan Diego, CA, USA, May 19-21, 1993, 1993)

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

What is an Efficient Implementation of the \lambda-calculus? - Gudmund Skovbjerg Frandsen; Carl Sturtivant (Functional Programming Languages and Computer Architecture, 5th ACM Conference, Cambridge, MA, USA, August 26-30, 1991, Proceedings, 1991)

Efficiently Inverting Bijections Given by Straight Line Programs - Carl Sturtivant; Zhi-Li Zhang (31st Annual Symposium on Foundations of Computer Science, St. Louis, Missouri, USA, October 22-24, 1990, Volume I, 1990)

Generalised Symmetries of Polynomials in Algebraic Complexity - Carl Sturtivant (23rd Annual Symposium on Foundations of Computer Science, Chicago, Illinois, USA, 3-5 November 1982, 1982)