Computer Science - 1985 Gehringer, E. F., & Keedy, J. L. (1985). Assessing the advantages of tagged architectures. Computer Studies Program, North Carolina State University. Kaltofen, E., & Pan, V. (1985). 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. Mohan, J., Jones, A. K., Gehringer, E. F., & Segall, Z. Z. (1985). Granularity of parallel computation. In E. L. Galizzi (Ed.), Proceedings of the 18th Hawaii Conference on Systems Sciences (Vol. 1, pp. 249–256). Mehrotra, R., & Gehringer, E. F. (1985). Superlinear speedup through randomized algorithms. Proceedings of the 14th International Conference on Parallel Processing, 291–300. von zur Gathen, J., & Kaltofen, E. (1985). Factorization of multivariate polynomials over finite fields. Mathematics of Computation, 45(171), 251–251. https://doi.org/10.1090/s0025-5718-1985-0790658-x Kaltofen, E. (1985). Effective Hilbert irreducibility. Information and Control, 66(3), 123–137. https://doi.org/10.1016/s0019-9958(85)80056-5 Kaltofen, E. (1985). Fast parallel absolute irreducibility testing. Journal of Symbolic Computation, 1(1), 57–67. https://doi.org/10.1016/s0747-7171(85)80029-8 Kaltofen, E. (1985). 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). https://doi.org/10.1109/sfcs.1985.17 Kaltofen, E. (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. https://doi.org/10.1145/22145.22160 Kaltofen, E. (1985). Polynomial-Time Reductions from Multivariate to Bi- and Univariate Integral Polynomial Factorization. SIAM Journal on Computing, 14(2), 469–489. https://doi.org/10.1137/0214035 von zur Gathen, J., & Kaltofen, E. (1985). Factoring sparse multivariate polynomials. Journal of Computer and System Sciences, 31(2), 265–287. https://doi.org/10.1016/0022-0000(85)90044-3 Kaltofen, E. (1985). Sparse hensel lifting. In EUROCAL '85 (pp. 4–17). https://doi.org/10.1007/3-540-15984-3_230 Doyle, J. (1985). Expert Systems and the “Myth” of Symbolic Reasoning. IEEE Transactions on Software Engineering, SE-11(11), 1386–1390. https://doi.org/10.1109/TSE.1985.231886 Stallmann, M. (1985). Using PQ-trees for planar embedding problems. North Carolina State University. Dept. of Computer Science. Gabow, H. N., & Stallmann, M. (1985). Efficient algorithms for graphic matroid intersection and parity. International Colloquium on Automata, Languages, and Programming, 210–220. Doyle, J. (1985). Circumscription and implicit definability. J Autom Reasoning, 1(4), 391–405. https://doi.org/10.1007/bf00244277 Gehringer, E. F., & Keedy, J. L. (1985). Assessing the advantages of tagged architectures (Technical Report No. TR-85-08). Raleigh, NC: Computer Studies Program, North Carolina State University. Vrsalovic, D., Gehringer, E. F., Segall, Z. Z., & Siewiorek, D. P. (1985). The influence of parallel decomposition strategies on the performance of multiprocessor systems. ACM SIGARCH Computer Architecture News, 13(3), 396–405. https://doi.org/10.1145/327070.327372 Gehringer, E. F., & Keedy, J. L. (1985). Tagged architecture. ACM SIGARCH Computer Architecture News, 13(3), 162–170. https://doi.org/10.1145/327070.327153 Riviere, J. E., Craigmill, A. L., & Sundlof, S. F. (1985). Food Animal Residue Avoidance Databank. Proceedings of the Food Science Symposium VI: Assuring Meat Wholesomeness, The Residue Avoidance Issue, G1–5.