Corrigendum: `` Allocating Storage for Extendible Arrays''

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Corrigendum: `` Allocating Storage for Extendible Arrays''

Full text

Pdf (63 KB)

Source

Journal of the ACM (JACM) archive
Volume 22 , Issue 2 (April 1975) table of contents

Page: 308

Year of Publication: 1975

ISSN:0004-5411

Author

Arnold L. Rosenberg

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 2, Downloads (12 Months): 13, Citation Count: 0

Additional Information:

references index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/321879.321891 What is a DOI?

REFERENCES

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.

	1	BERLEKAMP, E R Algebrazc Coding Theory. McGraw-Hill, New York, 1968
	2	BERLEKAMP, E.R.Factoring polynomzals over large finite fields Math. Comput 24, 111 (July 1970), 713-735
	3	CHARLETON, R T A Pascal ~mplementatlon of algorithms for the factorizatlon and greatest common diwsor calculatma of multivariate polynomJals. Master's Th , U. of Texas, Austin, Texas, Aug 1973
	4	George E. Collins, The SAC-1 system: An introduction and survey, Proceedings of the second ACM symposium on Symbolic and algebraic manipulation, p.144-152, March 23-25, 1971, Los Angeles, California, United States [doi>10.1145/800204.806279]
	5	COLLJNS, G. E Computer algebra of polynomials and rationM functions. Amer. Math Mon. 80, 7 (Aug-Sept 1973), 725-755
	6	COLLINS, GEORGE E , HEINDEL, L E , }-IoRowITz, E , MCCLELLAN, M T, AND MUSSER, D R. The SAC-1 modular arithmetic system. Tech Rep. No. 10, U of Wisconsin, Madison, Wlsc, June 1969.
	7	COLLINS, GEORGE E, AND MVSSER, D R. The SAC-1 polynomial factorizat,on system Comput. Scmnces Tech Rep No 157, U of Wisconsin, Madison, Wlsc , March 1972
	8	FLOYD, ROBERT W. Assigning meamngs to programs Proc of a Symp in Apphed Mathematics, Vol. 19. Mathematical Aspects of Computer Scmnce, J. T Schwartz, Ed, Amer Math Soc , Providence, R I, 1967, pp 19-32
	9	GELFOND, A O. Transcendental and Algebraic Numbers Dover, New York, 1960.
	10	HOROWITZ, ELLIS Algorithms for symbohc integratmn of ratmnal functions Ph D. Th, Comput Scmnces Dep , U of WlsconsJn, Madison, Wlsc , 1969
	11	Donald E. Knuth, The art of computer programming, volume 1 (3rd ed.): fundamental algorithms, Addison Wesley Longman Publishing Co., Inc., Redwood City, CA, 1997
	12	Donald E. Knuth, The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1997
	13	MIGNOTTE, M An ,nequahty about factors of polynomials Math Comput (to appear)
	14	David Rea Musser, Algorithms for polynomial factorization., 1971
	15	RAn~N, MICHAEL O Computable algebra, general theory and theory of computable fields Trans Amer Math Soc ~5 (1960),341-360
	16	VAN DER WAERDEN, B L Modern Algebra, Vol I (transl by Fred Blum). Ungar, New York, 1949
	17	Paul S. Wang , L. Preiss Rothschild, Factoring multivariate polynomials over the integers, ACM SIGSAM Bulletin [doi>10.1145/1086814.1086819]
	18	ZASSr~SH.~US, HANS On Hensel factorlzatlon, I J Numer Theory I (1969), 291-311.