On pointers versus addresses

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	A. Aggarwal , B. Alpern , A. Chandra , M. Snir, A model for hierarchical memory, Proceedings of the nineteenth annual ACM conference on Theory of computing, p.305-314, January 1987, New York, New York, United States [doi>10.1145/28395.28428]
	2	A. Aggarwal , J. S. Vitter, The I/O complexity of sorting and related problems, 14th International Colloquium on Automata, languages and programming, p.467-478, July 1987, Karlsruhe, Germany
	3	Alfred V. Aho , John E. Hopcroft, The Design and Analysis of Computer Algorithms, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1974
	4	BEN-AMRAM, A, M. On addresses versus pointers. Tech. Rep. 173/90. Tel Aviv Univ., Tel Avlv, Israel.
	5	BEN-AMRAM, A. M. On pointers versus addresses. MS dissertation. Dept. Comput. So., Tel-Aviv University, Tel-Aviv, Israel, 1988.
	6	BEN-AMRAM, A. M., AND GALm, Z. On pointers versus addresses. In Proceedings of the 29th Annual IEEE Symposium on Foundations of Computer Science (White Plains, N.Y.). IEEE, New York, 1988, pp. 532-538.
	7	Amir M. Ben-Amram , Zvi Galil, On the power of the shift instruction, Information and Computation, v.117 n.1, p.19-36, Feb. 15, 1995 [doi>10.1006/inco.1995.1026]
	8	Michael Ben-Or, Lower bounds for algebraic computation trees, Proceedings of the fifteenth annual ACM symposium on Theory of computing, p.80-86, December 1983 [doi>10.1145/800061.808735]
	9	BLUM, L., SHUB, M., AND SMALE, S. On a theory of computation over the real numbers; NP completeness, recursive functions and universal machines. In Proceedings of the 29th Annual 1EEE Symposium on Foundations of Computer Science (White Plains, N.Y.). IEEE, New York, 1988.
	10	Norbert Blum, On the single-operation worst-case time complexity of the disjoint set union problem, SIAM Journal on Computing, v.15 n.4, p.1021-1024, Nov. 1986 [doi>10.1137/0215072]
	11	CHAZELLE, B. Lower bounds on the complexity of multidimensional searching. In Proceedings of the 27th Annual 1EEE Symposium on Foundations of Computer Science. IEEE, New York, 1986, pp. 87-96.
	12	CnAZELLE, B. A functional approach to data structures and its use in multidimensional searching. Tech. Rep. TR CS-85-16, Brown Univ., 1985.
	13	COOK, S. A., AND RECKHOW, R.A. Time bounded random access machines. J. Comput. Syst. Sci. 7, 4 (1973), 354-375.
	14	Pavol Dūris , Zvi Galil , Wolfgang Paul , Ruediger Reischuk, Two nonlinear lower bounds for on-line computations, Information and Control, v.60 n.1-3, p.1-11, Jan./Feb./Mar. 1984 [doi>10.1016/S0019-9958(84)80019-4]
	15	Dov Harel , Robert Endre Tarjan, Fast algorithms for finding nearest common ancestors, SIAM Journal on Computing, v.13 n.2, p.338-355, May 1984 [doi>10.1137/0213024]
	16	HAaa', S., AND NHARIR, M. Nonlinearity of Davenport-Schlnzel sequences and of a generalized path compression scheme. In Proceedings of the 25th Annual IEEE Symposium on Foundations of Computer Science (Stager Island, Fla.). IEEE, New York, 1984, pp 313-319.
	17	HARa'MANIS, J., AND SIMON, J. On the power of multiphcatlon in random access machines. In Proceedings of the 15th Annual Symposium on Switching and Automata Theory (New Orleans, La.). IEEE, New York, 1974, pp. 13-23.
	18	HunEw~cz, W., AND WALLMA~, H. Dtmension Theory. Princeton Umversity Press, Princeton, N.J., 1948.
	19	Donald E. Knuth, The art of computer programming, volume 1 (3rd ed.): fundamental algorithms, Addison Wesley Longman Publishing Co., Inc., Redwood City, CA, 1997
	20	Donald E. Knuth, The art of computer programming, volume 3: (2nd ed.) sorting and searching, Addison Wesley Longman Publishing Co., Inc., Redwood City, CA, 1998
	21	KOLMO~OROV, A.N. On the notion of algorithm Uspehi Mat. Nauk. 3 (1953), 175-176.
	22	KOLMOGOROV, A.N. Three approaches to the defimtion of the concept of "amount of informanon." Problemy PeredaOi Informacii 1, 1 (1965), 3-11 English translation in Selected Transl. in Math. Statistics and Probability, 7 (1965), 293-302.
	23	KOLMOGOROV, A. N., AND USPENSKII, V.A. On the definition of an algorithm. Uspehi Mat. Nauk. 13 (1958), 3-28. English translation in AMS Transl. H 29 (1963), 217-245.
	24	KURATOWSKI, K. Introduction to Set Theory and Topology {BoRoN, L. F. (transl.)}. Addison-Wesley, Reading, Mass., 1962.
	25	K. Mehlhorn , S. Näher , H. Alt, A lower bound for the complexity of the union-split-find problem, 14th International Colloquium on Automata, languages and programming, p.479-488, July 1987, Karlsruhe, Germany
	26	PAIGE, R. Real-time simulation of a set machine on a RAM. In W. Koczkodaj, ed., International Conference on Computing and Informatton (ICC{ '89) (Toronto, Ont., Canada). Comput. Inf. 2, (1989), 69-73.
	27	PAUL, W.J. Kolmogorov complexity and lower bounds. In Lothar Budach, ed., Fundamentals of Computation Theory (FCT '79), Akademie-Vertag, Berlin, 1979, pp. 325-334.
	28	PAUL, W.J., SFIFF.aAS, J. I., AND SIMON, J. An information-theoretic approach to time bounds for on-line computation. J. Comput. Syst. Set. 23, 2 (1981), 108-126.
	29	Vaughan R. Pratt , Michael O. Rabin , Larry J. Stockmeyer, A characterization of the power of vector machines, Proceedings of the sixth annual ACM symposium on Theory of computing, p.122-134, April 30-May 02, 1974, Seattle, Washington, United States [doi>10.1145/800119.803892]
	30	Franco P. Preparata , Michael I. Shamos, Computational geometry: an introduction, Springer-Verlag New York, Inc., New York, NY, 1985
	31	Neil Sarnak , Robert E. Tarjan, Planar point location using persistent search trees, Communications of the ACM, v.29 n.7, p.669-679, July 1986 [doi>10.1145/6138.6151]
	32	SCHNOaR, C.P. Rekursive Funktionen und ihre Komplexttiit. Teubner, Stuttgart, 1974.
	33	A. Schonage, REAL-TIME SIMULATION OF MULTIDIMENSIONAL TURING MACHINES BY STORAGE MODIFICATION MACHINES, Massachusetts Institute of Technology, Cambridge, MA, 1973
	34	Arnold Schönhage, Storage Modification Machines, Proceedings of the 4th GI-Conference on Theoretical Computer Science, p.36-37, March 26-28, 1979
	35	SCH6NHA~F,, A. Storage modification machines. SIAM J. Comput. 9, 3 (1980), 490-508.
	36	SHAKOS, M.I. Computational Geometry, Ph.D. dissertation. Yale, Cambridge, Mass., 1978.
	37	SIKLOSSY, L. Let's Talk LISP. Prentme-Hall, Englewood Cliffs, N.J., 1976.
	38	Robert Endre Tarjan, Reference machines require non-linear time to maintain disjoint sets, Proceedings of the ninth annual ACM symposium on Theory of computing, p.18-29, May 04-04, 1977, Boulder, Colorado, United States [doi>10.1145/800105.803392]
	39	TARJAN, R.E. A class of algorithms whlch require nonlinear time to maintain disjoint sets. J. Comput. Syst. Scz. 18 (1979), 110-127.