Journal of the ACM Bibliography

Selected papers that cite this one

• Amir M. Ben-Amram. When can we sort in o(n log n) time? Journal of Computer and System Sciences, 54(2):345-370, April 1997.

• Amir M. Ben-Amram and Zvi Galil. On the power of the shift instruction. Information and Computation, 117(1):19-36, 15 February 1995.

• Patrick W. Dymond, Faith E. Fich, Naomi Nishimura, Prabhakar Ragde, and Walter L. Ruzzo. Pointers versus arithmetic in PRAMs. Journal of Computer and System Sciences, 53(2):218-232, October 1996.

• Nicholas Pippenger. Pure versus impure LISP. In Conference Record of POPL '96: The 23rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 104-109, St. Petersburg Beach, Florida, 21-24 January 1996.

Selected references

• Alok Aggarwal, Bowen Alpern, Ashok K. Chandra, and Marc Snir. A model for hierarchical memory. In Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, pages 305-314, New York City, 25-27 May 1987.

• Amir M. Ben-Amram and Zvi Galil. On pointers versus addresses (extended abstract). In 29th Annual Symposium on Foundations of Computer Science, pages 532-538, White Plains, New York, 24-26 October 1988. IEEE.

• Amir M. Ben-Amram and Zvi Galil. On the power of the shift instruction. Information and Computation, 117(1):19-36, 15 February 1995.

• Michael Ben-Or. Lower bounds for algebraic computation trees (preliminary report). In Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing, pages 80-86, Boston, Massachusetts, 25-27 April 1983.

• Lenore Blum, Mike Shub, and Steve Smale. On a theory of computation over the real numbers; NP completeness, recursive functions and universal machines (extended abstract). In 29th Annual Symposium on Foundations of Computer Science, pages 387-397, White Plains, New York, 24-26 October 1988. IEEE.

• Bernard Chazelle. Lower bounds on the complexity of multidimensional searching (extended abstract). In 27th Annual Symposium on Foundations of Computer Science, pages 87-96, Toronto, Ontario, Canada, 27-29 October 1986. IEEE.

• Pavol D\=uri\=s, Zvi Galil, Wolfgang Paul, and Ruediger Reischuk. Two nonlinear lower bounds for on-line computations. Information and Control, 60(1-3):1-11, January/February/March 1984.

• Juris Hartmanis and Janos Simon. On the power of multiplication in random access machines. In 15th Annual Symposium on Switching and Automata Theory, pages 13-23, The University of New Orleans, 14-16 October 1974. IEEE.

• Sergiu Hart and Micha Sharir. Nonlinearity of Davenport-Schinzel sequences and of a generalized path compression scheme. In 25th Annual Symposium on Foundations of Computer Science, pages 313-319, Singer Island, Florida, 24-26 October 1984. IEEE.

• Vaughan R. Pratt, Michael O. Rabin, and Larry J. Stockmeyer. A characterization of the power of vector machines. In Conference Record of Sixth Annual ACM Symposium on Theory of Computing, pages 122-134, Seattle, Washington, 30 April-2 May 1974.

• Robert Endre Tarjan. Reference machines require non-linear time to maintain disjoint sets. In Conference Record of the Ninth Annual ACM Symposium on Theory of Computing, pages 18-29, Boulder, Colorado, 2-4 May 1977.

Shortcuts: