Computer Science

Assessing the advantages of tagged architectures

Computer Studies Program, North Carolina State University.

The integer manipulation techniques can compete with the linear algebra methods for solving sparse linear systems

(Technical Report No. 85-6). State University of New York at Albany, Computer Science Department.

Granularity of parallel computation

In E. L. Galizzi (Ed.), Proceedings of the 18th Hawaii Conference on Systems Sciences (Vol. 1, pp. 249–256).

Superlinear speedup through randomized algorithms

Proceedings of the 14th International Conference on Parallel Processing, 291–300.

Factorization of multivariate polynomials over finite fields

Mathematics of Computation, 45(171), 251–251.

Effective Hilbert irreducibility

Information and Control, 66(3), 123–137.

Fast parallel absolute irreducibility testing

Journal of Symbolic Computation, 1(1), 57–67.

Computing with polynomials given by straight-line programs II sparse factorization

26th Annual Symposium on Foundations of Computer Science (sfcs 1985). Presented at the 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

Computing with polynomials given by straight-line programs I: greatest common divisors

Proceedings of the seventeenth annual ACM symposium on Theory of computing - STOC '85. Presented at the the seventeenth annual ACM symposium.

Polynomial-Time Reductions from Multivariate to Bi- and Univariate Integral Polynomial Factorization

SIAM Journal on Computing, 14(2), 469–489.

Factoring sparse multivariate polynomials

Journal of Computer and System Sciences, 31(2), 265–287.

Sparse hensel lifting

In EUROCAL '85 (pp. 4–17).

Expert Systems and the “Myth” of Symbolic Reasoning

IEEE Transactions on Software Engineering, SE-11(11), 1386–1390.

Using PQ-trees for planar embedding problems

North Carolina State University. Dept. of Computer Science.

Efficient algorithms for graphic matroid intersection and parity

International Colloquium on Automata, Languages, and Programming, 210–220.

Circumscription and implicit definability

J Autom Reasoning, 1(4), 391–405.

Assessing the advantages of tagged architectures

(Technical Report No. TR-85-08). Raleigh, NC: Computer Studies Program, North Carolina State University.

The influence of parallel decomposition strategies on the performance of multiprocessor systems

ACM SIGARCH Computer Architecture News, 13(3), 396–405.

Tagged architecture

ACM SIGARCH Computer Architecture News, 13(3), 162–170.

Food Animal Residue Avoidance Databank

Proceedings of the Food Science Symposium VI: Assuring Meat Wholesomeness, The Residue Avoidance Issue, G1–5.