Computer Science

College of Engineering

Works Published in 1985

Sorted by most recent date added to the index first, which may not be the same as publication date order.

1985 journal article

Effective Hilbert irreducibility

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

Source: Crossref
Added: August 28, 2020

1985 journal article

Fast parallel absolute irreducibility testing

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

Source: Crossref
Added: August 28, 2020

1985 conference paper

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).

Event: 26th Annual Symposium on Foundations of Computer Science (sfcs 1985)

Source: Crossref
Added: August 28, 2020

1985 conference paper

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.

Event: the seventeenth annual ACM symposium

Source: Crossref
Added: August 28, 2020

1985 journal article

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

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

Source: Crossref
Added: August 28, 2020

1985 journal article

Factoring sparse multivariate polynomials

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

By: J. von zur Gathen & E. Kaltofen

Source: Crossref
Added: August 28, 2020

1985 chapter

Sparse hensel lifting

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

Source: Crossref
Added: August 28, 2020

1985 journal article

Expert Systems and the “Myth” of Symbolic Reasoning

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

By: J. Doyle

Source: ORCID
Added: December 6, 2019

1985 report

Using PQ-trees for planar embedding problems

North Carolina State University. Dept. of Computer Science.

Source: ORCID
Added: December 6, 2019

1985 conference paper

Efficient algorithms for graphic matroid intersection and parity

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

By: H. Gabow & M. Stallmann

Event: Springer, Berlin, Heidelberg

Source: ORCID
Added: December 6, 2019

1985 journal article

Circumscription and implicit definability

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

By: J. Doyle

Source: ORCID
Added: December 5, 2019

1985 report

Assessing the advantages of tagged architectures

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

By: E. Gehringer & J. Keedy

Source: NC State University Libraries
Added: April 14, 2019

1985 journal article

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

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

By: D. Vrsalovic, E. Gehringer, Z. Segall & D. Siewiorek

Sources: Crossref, ORCID
Added: March 30, 2019

1985 journal article

Tagged architecture

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

By: E. Gehringer & J. Keedy

Sources: Crossref, ORCID
Added: March 30, 2019

1985 conference paper

Food Animal Residue Avoidance Databank

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

By: J. Riviere, A. Craigmill & S. Sundlof

Source: NC State University Libraries
Added: August 6, 2018