Wolfgang Küchlin
- 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.Google Scholar
- AG89.George Almasi and Alan Gottlieb. Highly Parallel Computing. Benjamin/Cummings Publishing Company, 1989. Google ScholarDigital Library
- Bro71.W.S. Brown. On Euclid's algorithm and t:he computation of polynomial greatest common divisors. Journal of the A GM, 18(4):478-504, October 1971. Google ScholarDigital Library
- BvzGH82.Alan Borodin, Joachim yon zur Gathen, and John H opcroft. Fast parallel matrix and GCD computations. Information and Control, 52:241-256, 1982.Google ScholarCross Ref
- CD87.Eric C. Cooper and Richard P. Draves. C threads. Technical report, Computer Science Department, Carnegie Mellon University, Pittsburgh, PA 15213, July 1987.Google Scholar
- CG89.Nicholas Carriero and David Gelernter. Linda in context. Communications of the A CM, 32(4), April 1989. Google ScholarDigital Library
- CGG84.Bruce Char, Keith Geddes, and Gaston Gonnet. GCDHEU: Heuristic polynomial GCD algorithm based on integer GCD computation. In John Fitch, editor, International Symposium on Symbolic and Algebraic Computation, volume 174 of LNCS, pages 285-296, Cambridge, England, July 1984. Springer-Verlag. (Proc. EU- ROSAM'84). Google Scholar
- Cha90.Bruce Char. Progress report on a system for general-purpose parallel symbolic algebraic computation. In Watanabe and Nagata {WN90}, pages 96-103. Google Scholar
- CJK90.George E. Collins, Jeremy Johnson, and Wolfgang Kuechlin. Parallel real root isolation using the coefficient sign variation method. In Richard Zippel, editor, Computer Algebra and Parallelism, Ithaca, NY, June 1990. Academic Press. To appear. Google ScholarDigital Library
- 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.Google Scholar
- Col71.George E. Collins. The calculation of multivariate polynomial resultants. Journal of the A CM, 19:515-532, 1971. Google ScholarDigital Library
- 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).Google Scholar
- 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.Google Scholar
- 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.Google Scholar
- DST88.J.H. Davenport, Y. Siret, and E. Tournier. Computer Algebra, Systems and Algorithms for Algebraic Computation. Academic Press, 1988. Google ScholarDigital Library
- Kal85.Erich Kaltofen. Computing with polynomials given by straight-line programs I: Greatest common divisors. In Proc. 17th A CM STOC, pages 131-142. Providence, RI, May 1985. Google ScholarDigital Library
- Kal89.Erich Kaltofen. Parallel algebraic algorithm design. Technical report, Department of Computer Science, Rensselaer Polytechnic Institute, November 1989.Google Scholar
- KLN91.Wolfgang W. Kiichlin, David Lutz, and Nicholas J. Nevin. Integer multiplication in PARSAC-2 on stock microprocessors. Preprint, February 1991.Google ScholarCross Ref
- 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.Google ScholarDigital Library
- Küc90a.Wolfgang W. Kfichlin. PARSAC-2: A parallel SAC-2 based on threads. In Proc. AAECC-8, LNCS, Tokyo, Japan, August 1990. Springer- Verlag. To appear. Google ScholarDigital Library
- 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.Google Scholar
- Küc91.Wolfgang W. Kiichlin. PARSAC-2 and the multi-threaded computation of modular polynomial greatest common divisors. March 1991.Google Scholar
- Lip81.John D. Lipson. Elements of Algebra and Alge. braic Computing. Benjamin/Cummings, 1981.Google Scholar
- Loo76.It. G. K. Loos. The algorithm description language ALDES (Report). A CM SIGSAM Bull., 10(1):15-39, 1976. Google ScholarDigital Library
- 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.Google Scholar
- MY73.J. Moses and D. Yun. The EZ-GCD algorithm. In Proc. o~ the A CM Annual ConJerence, pages 159-166, Atlanta, GA, 1973. Google ScholarDigital Library
- Ng79.Edward W. Ng, editor. Symbolic and Algebraic Computation, volume 72 of LNCS, Marseille, France, June 1979. Springer-Verlag. (Proc. EU- ROSAM'79). Google ScholarDigital Library
- Pon88a.Carl G. Ponder. Evaluation of "Perlormance Enhancements" in Algebraic Manipulation Systems. PhD thesis, Computer Science Division, University of California, Berkeley, CA 94720, U.S.A., August 1988. Google ScholarDigital Library
- Pon88b.Carl G. Ponder. Parallel processors and systems for algebraic manipulation: Current work. A CM SIGSAM Bull., 22(3):15-21, July 1988. Google ScholarDigital Library
- Pon88c.Carl G. Ponder. Parallelism and algorithms for algebraic manipulation: Current work. A CM SIGSAM Bull., 22(3):7-14, July 1988. Google ScholarDigital Library
- 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).Google Scholar
- 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.Google Scholar
- 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).Google Scholar
- Sei89.Steffen Seitz. Parallel algorithm development. In Della Dora and Fitch {DDF89}, pages 223- 232. (Proc. CAP'88, Grenoble, France, June 1988).Google Scholar
- Sei90.Steffen Seitz. Verteiltes Rechnen in SA C-2. PhD thesis, Universit~t TSbingen, 1990.Google Scholar
- Ski90.David B. Skillicorn. Architecture-independent parallel computation. Computer, 23(12):38-50, December 1990. Google ScholarDigital Library
- SLA89.B.D. Saunders, H. R. Lee, and S. K. Abdali. A parallel implementation of the cylindrical algebraic decomposition algorithm. In Gaston H. Gonnet, editor, ISSAC'89, pages 298-307, Portland, Oregon, July 1989. ACM-SIGSAM, ACM Press. Google ScholarDigital Library
- 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).Google Scholar
- Wan80.Paul S. Wang. The EEZ-GCD algorithm. SIGSAM Bulletin, 14(2):50-60, 1980. Google ScholarDigital Library
- Wan90.Paul S. Wang. Parallel univariate polynomial factorization on shared-memory multiprocessots. In Watanabe and Nagata {WN90}, pages 145-151. Google Scholar
- Wat85.Stephen M. Watt. A system for parallel computer algebra programs. In B. F. Caviness, editor, Eurocal'85, volume 204 of LNCS, pages 537-538, Linz, Austria, April 1985. Springer- Verlag. (Proc. European Conference on Computer Algebra, Volume Ii: Research Contributions). Google ScholarDigital Library
- Wat86.Stephen M. Watt. Bounded Parallelism in Computer Algebra. PhD thesis, University of Waterloo, Waterloo, Canada, 1986. Also Technical Report CS-86-12. Google ScholarDigital Library
- Web91.Ken Weber. A heuristic parallel algorithm to compute univariate polynomial GCD's. Preprint, February 1991.Google Scholar
- WN90.Shunro Watanabe and Morio Nagata, editors. Tokyo, Japan, August 1990. ACM-SIGSAM, ACM Press.Google Scholar
- Zip79.Richard Zippel. Probabilistic algorithms for sparse polynomials. In Ng {Ng79}, pages 216- 226. (Proc. EUItOSAM'79). Google Scholar
- Zip81.Richard Zippel. Newton's iteration and the sparse Hensel algorithm. In Paul Wang, editor, Proc. SYMSAC'81, pages 68-72, 1981. Google ScholarDigital Library
Index Terms
- On the multi-threaded computation of integral polynomial greatest common divisors
Recommendations
Greatest common divisors of polynomials given by straight-line programs
Algorithms on multivariate polynomials represented by straight-line programs are developed. First, it is shown that most algebraic algorithms can be probabilistically applied to data that are given by a straight-line computation. Testing such rational ...
On Euclid's algorithm and the computation of polynomial greatest common divisors
SYMSAC '71: Proceedings of the second ACM symposium on Symbolic and algebraic manipulationThis paper examines the computation of polynomial greatest common divisors by various generalizations of Euclid's algorithm. The phenomenon of coefficient growth is described, and the history of successful efforts first to control it and then to ...
Parametric Greatest Common Divisors using Comprehensive Gröbner Systems
ISSAC '17: Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic ComputationComputing the greatest common divisor (GCD) of polynomials can be done by computing the Grobner basis instead of the well-known Euclidean algorithm, studied by Gianni and Trager in 1985, and Sasaki and Suzuki in 1992. In this paper, we extend their ...
Comments