Computer Science - 1982

Gehringer, E. F. (1982). MONADS: a computer architecture to support software engineering. Department of Computer Science, Monash University.

Kaltofen, E. (1982). On the complexity of factoring polynomials with integer coefficients (PhD thesis). Rensselaer Polytechnic Institute, Troy, NY.

Keedy, J. L., Gehringer, E. F., & Thomson, J. V. (1982). Dynamic data structure management in MONADS III. Proceedings of the Fifth Australian Computer Science Conference. Presented at the The Fifth Australian Computer Science Conference, Perth, Australia.

Kaltofen, E. (1982). Factorization of Polynomials. In B. Buchberger, G. E. Collins, & R. Loos (Eds.), Computing Supplementum (pp. 95–113). https://doi.org/10.1007/978-3-7091-3406-1_8

Kaltofen, E. (1982). A polynomial reduction from multivariate to bivariate integral polynomial factorization. Proceedings of the fourteenth annual ACM symposium on Theory of computing  - STOC '82. Presented at the the fourteenth annual ACM symposium. https://doi.org/10.1145/800070.802200

Kaltofen, E. (1982). A polynomial-time reduction from bivariate to univariate integral polynomial factorization. 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982). Presented at the 23rd Annual Symposium on Foundations of Computer Science. https://doi.org/10.1109/sfcs.1982.56

Gehringer, E. F. (1982). MONADS: a computer architecture to support software engineering (MONADS Report No. 13). Department of Computer Science, Monash University.

Gehringer, E. F. (1982). Capability Architectures and Small Objects. UMI Research Press.

Gehringer, E. F., Jones, A. K., & Segall, Z. Z. (1982). The Cm* Testbed. Computer, 15(10), 40–53. https://doi.org/10.1109/mc.1982.1653858