Search the dblp DataBase
Carl Sturtivant: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Kenneth L. Clarkson, David Eppstein, Gary L. Miller, Carl Sturtivant, Shang-Hua Teng
Approximating Center Points with Iterated Radon Points. [Citation Graph (0, 0)][DBLP]
Symposium on Computational Geometry, 1993, pp:91-98 [Conf] - Carl Sturtivant
Generalised Symmetries of Polynomials in Algebraic Complexity [Citation Graph (0, 0)][DBLP]
FOCS, 1982, pp:72-79 [Conf] - Carl Sturtivant, Zhi-Li Zhang
Efficiently Inverting Bijections Given by Straight Line Programs [Citation Graph (0, 0)][DBLP]
FOCS, 1990, pp:327-334 [Conf] - Gudmund Skovbjerg Frandsen, Carl Sturtivant
What is an Efficient Implementation of the \lambda-calculus? [Citation Graph (0, 0)][DBLP]
FPCA, 1991, pp:289-312 [Conf] - Kenneth L. Clarkson, David Eppstein, Gary L. Miller, Carl Sturtivant, Shang-Hua Teng
Approximating center points with iterative Radon points. [Citation Graph (0, 0)][DBLP]
Int. J. Comput. Geometry Appl., 1996, v:6, n:3, pp:357-377 [Journal] - Joan Boyar, Gudmund Skovbjerg Frandsen, Carl Sturtivant
An Arithmetic Model of Computation Equivalent to Threshold Circuits. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 1992, v:93, n:2, pp:303-319 [Journal] - Carl Sturtivant, Gudmund Skovbjerg Frandsen
The Computational Efficacy of Finite-Field Arithmetic. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 1993, v:112, n:2, pp:291-309 [Journal]
Search in 0.001secs, Finished in 0.001secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002