On the multi-threaded computation of integral polynomial greatest common divisors

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	ABB+86	Mike Accetta, Robert Baron, William Bolosky, David Gohb, Richard Rashid, Avadis Tevanian, and Michael Young. Mach: A new kernel foundation for UNIX development. In Proc. Summer USENIX Conference, July 1986.
	AG89	G. S. Almasi , A. Gottlieb, Highly parallel computing, Benjamin-Cummings Publishing Co., Inc., Redwood City, CA, 1989
	Bro71	W. S. Brown, On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors, Journal of the ACM (JACM), v.18 n.4, p.478-504, Oct. 1971 [doi>10.1145/321662.321664]
	BvzGH82	Alan Borodin, Joachim yon zur Gathen, and John H opcroft. Fast parallel matrix and GCD computations. Information and Control, 52:241-256, 1982.
	CD87	Eric C. Cooper and Richard P. Draves. C threads. Technical report, Computer Science Department, Carnegie Mellon University, Pittsburgh, PA 15213, July 1987.
	CG89	Nicholas Carriero , David Gelernter, Linda in context, Communications of the ACM, v.32 n.4, p.444-458, April 1989 [doi>10.1145/63334.63337]
	CGG84	Bruce W. Char , Keith O. Geddes , Gaston H. Gonnet, GCDHEU: Heuristic Polynomial GCD Algorithm Based on Integer GCD Computation, Proceedings of the International Symposium on Symbolic and Algebraic Computation, p.285-296, July 09-11, 1984
	Cha90	B. W. Char, Progress report on a system for general-purpose parallel symbolic algebraic computation, Proceedings of the international symposium on Symbolic and algebraic computation, p.96-103, August 20-24, 1990, Tokyo, Japan [doi>10.1145/96877.96902]
	CJK90	G. E. Collins , J. R. Johnson , Wolfgang Küchlin, Parallel Real Root Isolation Using the Coefficient Sign Variation Method, Proceedings of the Second International Workshop on Computer Algebra and Parallelism, p.71-87, May 09-11, 1990
	CL	G.E. Collins and R. G. K. Loos. SAC-2 system documentation. On-line documentation and program documentation. In Europe available from: Prof. R. Loos, Universit~t Tiibingen, Informatik, D-7400 Tiibingen, W-Germany. In the U.S.A. available from: Prof. G. E. Collins, Ohio State University, Computer Science, Columbus, OH 43210.
	Col71	George E. Collins, The Calculation of Multivariate Polynomial Resultants, Journal of the ACM (JACM), v.18 n.4, p.515-532, Oct. 1971 [doi>10.1145/321662.321666]
	DDF89	J. Della Dora and J. Fitch, editors. Computer Algebra and Parallelism. Computational Mathematics and Applications. Academic Press, London, 1989. (Proc. CAP'88, Grenoble, France, June 1988).
	Doe87	Thomas W. Doeppner. Threads, a system for the support of concurrent programming. Technical Report CS-87-11, Department of Computer Science, Brown University, June 1987.
	DR85	J.H. Davenport and Y. Robert. VLSI and Computer Algebra: the g.c.d, example. In Dynamical Systems and Cellular Automata, pages 359-367. Academic Press, London-New York, 1985.
	DST88	J. H. Davenport , Y. Siret , E. Tournier, Computer algebra: systems and algorithms for algebraic computation, Academic Press Ltd., London, UK, 1988
	Kal85	E Kaltofen, Computing with polynomials given by straight-line programs I: greatest common divisors, Proceedings of the seventeenth annual ACM symposium on Theory of computing, p.131-142, May 06-08, 1985, Providence, Rhode Island, United States [doi>10.1145/22145.22160]
	Kal89	Erich Kaltofen. Parallel algebraic algorithm design. Technical report, Department of Computer Science, Rensselaer Polytechnic Institute, November 1989.
	KLN91	Wolfgang W. Kiichlin, David Lutz, and Nicholas J. Nevin. Integer multiplication in PARSAC-2 on stock microprocessors. Preprint, February 1991.
	KN91	Wolfgang W. Kiichlin and Nicholas J. Nevin. On multi-threaded list-processing and garbage collection. Technical Report OSU-CISRC- 3/91-TRll, Computer and Information Science Research Center, The Ohio State University, Columbus, OH 43210-1277, March 1991. Preprint.
	Küc90a	Wolfgang Kuechlin, PARSAC-2: A Parallel SAC-2 Based on Threads, Proceedings of the 8th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, p.341-353, August 20-24, 1990
	Küc90b	Wolfgang W. Kfichlin. The S-threads environment for parallel symbolic computation. In Richard Zippel, editor, Computer Algebra and Parallelism, Ithaca, NY, June 1990. Academic Press. To appear.
	Küc91	Wolfgang W. Kiichlin. PARSAC-2 and the multi-threaded computation of modular polynomial greatest common divisors. March 1991.
	Lip81	John D. Lipson. Elements of Algebra and Alge. braic Computing. Benjamin/Cummings, 1981.
	Loo76	Rüdiger G. K. Loos, The algorithm description language ALDES (report), ACM SIGSAM Bulletin, v.10 n.1, p.14-38, February 1976 [doi>10.1145/1093390.1093395]
	MN87	Herbert Melenk and Winfried Neun. REDUCE user's guide for CItAY 1/X-MP series running COS. Technical Report Tit 87-4, Konrad-Zuse- Zentrum f~r informationstechnik Berlin, 1987.
	MY73	Joel Moses , David Y. Y. Yun, The EZ GCD algorithm, Proceedings of the annual conference, p.159-166, August 27-29, 1973, Atlanta, Georgia, United States [doi>10.1145/800192.805698]
	Ng79	Proceedings of the International Symposiumon on Symbolic and Algebraic Computation, June 1979
	Pon88a	Carl Glen Ponder, Evaluation of "performance enhancements" in algebraic manipulation systems, 1988
	Pon88b	Carl G. Ponder, Parallel processors and systems for algebraic manipulation: current work, ACM SIGSAM Bulletin, v.22 n.3, p.15-21, July 1988 [doi>10.1145/49456.49458]
	Pon88c	Carl G. Ponder, Parallelism and algorithms for algebraic manipulation: current work, ACM SIGSAM Bulletin, v.22 n.3, p.7-14, July 1988 [doi>10.1145/49456.49457]
	Pon89	Carl G. Ponder. Evaluation of "performance enhancements in algebraic manipulation systems. In Della Dora and Fitch {DDF89}, pages 51-73. (Proc. CAP'88, Grenoble, France, June 1988).
	Roc89a	Jean-Louis Roch. L'Architecture du Systeme PA C et son Arithmetique Rationnelle. PhD thesis, Institut National Polytechnique de Grenoble, Grenoble, France, December 1989.
	Roc89b	Jean-Louis Roch. PAC: Towards a parallel Computer Algebra co-processor. In Della Dora and Fitch {DDF89}, pages 33-50. (Proc. CAP'88, Grenoble, France, June 1988).
	Sei89	Steffen Seitz. Parallel algorithm development. In Della Dora and Fitch {DDF89}, pages 223- 232. (Proc. CAP'88, Grenoble, France, June 1988).
	Sei90	Steffen Seitz. Verteiltes Rechnen in SA C-2. PhD thesis, Universit~t TSbingen, 1990.
	Ski90	David B. Skillicorn, Architecture-Independent Parallel Computation, Computer, v.23 n.12, p.38-50, December 1990 [doi>10.1109/2.62092]
	SLA89	B. D. Saunders , H. R. Lee , S. K. Abdali, A parallel implementation of the cylindrical algebraic decomposition algorithm, Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation, p.298-307, July 17-19, 1989, Portland, Oregon, United States [doi>10.1145/74540.74576]
	Wan79	Paul S. Wang. Analysis of the p-adic construction of multivariate correction coefficients in polynomial factorization: iteration vs. recursion. In Ng {Ng79}, pages 291-300. (Proc. EU- ROSAM'79).
	Wan80	Paul S. Wang, The EEZ-GCD algorithm, ACM SIGSAM Bulletin, v.14 n.2, p.50-60, May 1980 [doi>10.1145/1089220.1089228]
	Wan90	P. S. Wang, Parallel univariate polynomial factorization on shared-memory multiprocessors, Proceedings of the international symposium on Symbolic and algebraic computation, p.145-151, August 20-24, 1990, Tokyo, Japan [doi>10.1145/96877.96915]
	Wat85	Stephen M. Watt, A System for Parallel Computer Algebra Programs, Research Contributions from the European Conference on Computer Algebra-Volume 2, p.537-538, April 01-03, 1985
	Wat86	Stephen Michael Watt, Bounded parallelism in computer algebra, University of Waterloo, Waterloo, Ont., Canada, 1986
	Web91	Ken Weber. A heuristic parallel algorithm to compute univariate polynomial GCD's. Preprint, February 1991.
	WN90	Shunro Watanabe and Morio Nagata, editors. Tokyo, Japan, August 1990. ACM-SIGSAM, ACM Press.
	Zip79	Richard Zippel, Probabilistic algorithms for sparse polynomials, Proceedings of the International Symposiumon on Symbolic and Algebraic Computation, p.216-226, June 01, 1979
	Zip81	Richard Zippel, Newton's iteration and the sparse Hensel algorithm (Extended Abstract), Proceedings of the fourth ACM symposium on Symbolic and algebraic computation, p.68-72, August 05-07, 1981, Snowbird, Utah, United States [doi>10.1145/800206.806372]