Carl Sturtivant

According to our database, Carl Sturtivant authored at least 10 papers between 1982 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

A Circuit Complexity Formulation of Algorithmic Information Theory.

Cole Wyeth, Carl Sturtivant

CoRR, 2023

2019

A Novel Secure and Efficient Data Aggregation Scheme for IoT.

Ruinian Li, Carl Sturtivant, Jiguo Yu, Xiuzhen Cheng

IEEE Internet Things J., 2019

2017

A secure and verifiable outsourcing scheme for matrix inverse computation.

Chunqiang Hu, Abdulrahman Alhothaily, Arwa Alrawais, Xiuzhen Cheng, Carl Sturtivant, Hang Liu

Proceedings of the 2017 IEEE Conference on Computer Communications, 2017

1996

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

1993

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, 1993

1992

An Arithmetic Model of Computation Equivalent to Threshold Circuits.

Joan Boyar, Gudmund Skovbjerg Frandsen, Carl Sturtivant

Theor. Comput. Sci., 1992

1991

What is an Efficient Implementation of the \lambda-calculus?

Gudmund Skovbjerg Frandsen, Carl Sturtivant

Proceedings of the Functional Programming Languages and Computer Architecture, 1991

1990

Efficiently Inverting Bijections Given by Straight Line Programs

Carl Sturtivant, Zhi-Li Zhang

Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990

1982

Generalised Symmetries of Polynomials in Algebraic Complexity

Carl Sturtivant

Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, 1982