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	AHLFORS, L V Complex Analysis McGraw-Hall, New York, see ed , 1966
	2	BACHMAN, G Introductton to P-adtc Numbers and Valuatton Theory Academic Press, New York, 1964
	3	BLISS, G A Algebratc Functtons, Vol XVI Amer Math Soc Colloqumm Publications, Providence, R I, 1933
	4	BRENT, R P Mult~ple-preclston zero-finding methods and the complexity of elementary function evaluation In Analync Computattonal Complextty, J F Traub, Ed , Academic Press, New York, 1976, pp 151-176
	5	BRF.r~T, R, AND KUNG, H T Fast algorithms for manipulating formal power series Tech Rep, Comptr Scl Dept , Carnegie-Mellon U , P~ttsburgh, Pa , Jan 1976 To appear in 1. ACM.
	6	BRIOr, C , AND BOUQUET, j Thdone des Foncttons Elhpttques Mallet-Bacheher, Pans, 1859
	7	EICHL~R, M Introduction to the Theory of Algebraic Numbers and Functions Transl by G Striker, Academic Press, New York, 1966
	8	HENSEL, K. Theorte der AIgebratschen Zahlen Teubner, Berhn, 1908
	9	JUNG, H W E Emfuhrung m dte Theone der Algebratschen Funkttonen emer Veranderhchen Walter de Gruyter, Berlin, 1923
	10	KtmG, H T On computing reoprocals of power series Numer Math 22 (1974), 341-348
	11	Kur~G, H T, AND TRAUB, J F Fast algorithms for algebraic functions (abstract) In Algortthms and Complexity, J F Traub, Ed , Academic Press, New York, 1976, p 473
	12	LErscr~ETZ, S Algebratc Geometry Princeton U Press, Princeton, N J , 1953
	13	John D. Lipson, Newton's method: a great algebraic algorithm, Proceedings of the third ACM symposium on Symbolic and algebraic computation, p.260-270, August 10-12, 1976, Yorktown Heights, New York, United States  [doi>10.1145/800205.806344]
	14	Joel Moses, MACSYMA - the fifth year, ACM SIGSAM Bulletin, v.8 n.3, p.105-110, August 1974  [doi>10.1145/1086837.1086857]
	15	NEwtoN, I. Methods of serzes and fluxlons In The Mathemaucal Papers of lsaac Newton, 11oi III, D T Whlteside, Ed, Cambridge U Press, 1969
	16	PuIs~ox, V A Recherches sur les fonctlons alg6brlques J. Math. 15 (1850), 365-480
	17	Rrrr, J F. lntegratton tn Ftntte Terms Columbia U Press, New York, 1948
	18	SAKS, S, AND ZYGMUND, A Analytic Functzons American Elsevter, New York, third ed , 1971
	19	TRAUB, J F Iterattve Methods for the Solutton of Equattons Prentice-Hall, Englewood Chffs, N J , 1964
	20	WALKER, R J Algebraw Curves Princeton U Press, Princeton U , Princeton, N J , 1950
	21	YON, D.Y Y Hensel Meets Newton-Algebraic constructions in an analytic setting In Analytic Computattonal Complextty, J F Traub, Ed , Academic Press, New York, 1976, pp 205-216

• Data structures for quadtree approximation and compression Communications of the ACM   28, 9
  Hanan Samet
  
  
• A hierarchical single-key-lock access control using the Chinese remainder theorem Proceedings of the 1992 ACM/SIGAPP Symposium on Applied computing
  Kim S. Lee ,  Huizhu Lu ,  D. D. Fisher
  
  
• The GemStone object database management system Communications of the ACM   34, 10
  Paul Butterworth ,  Allen Otis ,  Jacob Stein
  
  
• Putting innovation to work: adoption strategies for multimedia communication systems Communications of the ACM   34, 12
  Ellen Francik ,  Susan Ehrlich Rudman ,  Donna Cooper ,  Stephen Levine
  
  
• An intelligent component database for behavioral synthesis Proceedings of the 27th ACM/IEEE conference on Design automation
  Gwo-Dong Chen ,  Daniel D. Gajski