The search found the following entries:
[abra67] John Abramowich. Storage allocation in a certain iterative process. Communications of the ACM, 10(6):368-370, June 1967.
[berz65] A. T. Bertziss. A note on the storage of strings. Communications of the ACM, 8(8):512-513, August 1965.
[bobr67] Daniel G. Bobrow and Daniel L. Murphy. Structure of a LISP system using two-level storage. Communications of the ACM, 10(3):155-159, March 1967.
[bobr68b] Daniel G. Bobrow and Daniel L. Murphy. A note on the efficiency of a LISP computation in a paged machine. Communications of the ACM, 11(8):558-560, August 1968.
[bobr64] Daniel G. Bobrow and Bertram Raphael. A comparison of list-processing computer languages. Communications of the ACM, 7(4):231-240, April 1964.
[bobr68a] Daniel G. Bobrow. Storage management in Lisp. Symbol manipulation languages and techniques, 1968.
[cohe13] Nachshon Cohen and Erez Petrank. Limitations of partial compaction: Towards practical bounds. In PLDI 2013 [PLDI13], 2013. Available here.
[cohe67b] Jacques Cohen and Laurent Trilling. Remarks on garbage collection using a two level storage. BIT, 7(1):22-30, 1967.
[cohe67a] Jacques Cohen. A use of fast and slow memories in list-processing languages. Communications of the ACM, 10(2):82-86, February 1967.
[coll60] George E. Collins. A method for overlapping and erasure of lists. Communications of the ACM, 3(12):655-657, December 1960. Available here.
[coll61] George E. Collins. Experience in automatic storage allocation. Communications of the ACM, 4(10):436-440, October 1961.
[coll65] George E. Collins. REFCO III, a reference count list processing system for the IBM 7094. Research Report RC-1436, IBM Corp., May 1965.
[comf64] W. T. Comfort. Multiword list items. Communications of the ACM, 7(6):357-362, June 1964. Available here.
[dahl66] O. J. Dahl and K. Nygaard. Simula - an Algol-based simulation language. Communications of the ACM, 9:671-678, 1966.
[dahl63] O. J. Dahl. The SIMULA storage allocation scheme. NCC Document 62, Norsk Regnesentral, November 1963.
[denn68a] P. J. Denning. Thrashing: Its causes and prevention. In AFIPS 1968 Fall Joint Computer Conference, volume 33, pages 915-922, June 1968.
[denn68] P. J. Denning. The working set model for program behaviour. Communications of the ACM, 11:323-333, 1968.
[ersh58] A. P. Ershov. On programming of arithmetic operations. Communications of the ACM, 1(8):3-6, August 1958. Available here.
[feni69] Robert R. Fenichel and Jerome C. Yochelson. A Lisp garbage collector for virtual memory computer systems. Communications of the ACM, 12(11):611-612, November 1969. Available here.
[fost68] J. M. Foster. List Processing. Elsevier Computer Monographs. Elsevier-North Holland, New York, 1968.
[foth] J. A. Fotheringham. Dynamic storage allocation in the Atlas computer including an automatic use of the backing store. Communications of the ACM, 4:435, 1961.
[gele60] H. Gelernter, J. R. Hansen, and C. L. Gerberich. A Fortran-compiled list processing language. Journal of the ACM, 7(2):87-101, April 1960.
[hadd67] B. K. Haddon and W. M. Waite. A compaction procedure for variable length storage elements. Computer Journal, 10:162-165, August 1967.
[hans69] Wilfred J. Hansen. Compact list representation: Definition, garbage collection, and system implementation. Communications of the ACM, 12(9):499-507, September 1969.
[hoar69] C. A. R. Hoare. An axiomatic basis for computer programming. Communications of the ACM, 12, October 1969.
[holt61] Anatol W. Holt. Program organization and record keeping for dynamic storage allocaton. Communications of the ACM, 4(10), October 1961.
[illi62] J. K. Iliffe and J. G. Jodeit. A dynamic storage allocation scheme. Computer Journal, 5(3):200-209, October 1962.
[kain69] Y. Kain. Block structures, indirect addressing, and garbage collection. Communications of the ACM, 12(7):395-398, July 1969.
[know65] Kenneth C. Knowlton. A fast storage allocator. Communications of the ACM, 8(10):623-625, October 1965. Available here.
[LCTES11] ACM SIGPLAN/SIGBED Conference on Languages, Compilers, and Tools for Embedded Systems, Chicago, IL, April 2011. ACM Press. Available here.
[mahe61] R. J. Maher. Problems of storage allocation in a multiprocessor multiprogrammed system. Communications of the ACM, 4(10):421-422, October 1961.
[mcbe63] J. Harold McBeth. On the reference counter method. Communications of the ACM, 6(9):575, September 1963.
[mcca59] John McCarthy and Marvin Minsky. Artificial intelligence, quarterly progress report no. 53. Technical report, Research Laboratory of Electronics at MIT, April 1959.
[mcca62] John McCarthy et al.. Lisp 1.5 Programmer's Manual, 1962.
[mcca60] John McCarthy. Recursive functions of symbolic expressions and their computation by machine, Part I. Communications of the ACM, 3(4):184-195, April 1960. Available here.
[mcil76] M. Douglas McIlroy. Mass-produced software components. In J. M. Buxton, Peter Naur, and Brian Randell, editors, Software Engineering Concepts and Techniques (1968 NATO Conference of Software Engineering), pages 88-98, 1976.
[mins63] Marvin L. Minsky. A Lisp garbage collector algorithm using serial secondary storage. Technical Report Memo 58 (rev.), Project MAC, MIT, Cambridge, MA, December 1963.
[newe57] A. Newell and J. C. Shaw. Programming the logic theory machine. In Western Joint Computing Conference, pages 230-240, 1957.
[newe60] A. Newell and F. M. Tonge. An introduction to information processing language V. Communications of the ACM, 3(4):205-211, April 1960.
[pare68] R. J. Parents. A simulation oriented memory allocation algorithm. In J. M. Buxton, editor, Simulation Programming Languages, pages 199-209. North-Holland, Amsterdam, 1968.
[rand68] Brian Randell and C. J. Kuehner. Dynamic storage allocation systems. Communications of the ACM, 12(7):297-306, May 1968.
[rand69] Brian Randell. A note on storage fragmentation and program segmentation. Communications of the ACM, 12(7):365-372, July 1969.
[ross67] D. T. Ross. The AED free storage package. Communications of the ACM, 10(8):481-492, August 1967.
[schm94] William J. Schmidt and Kelvin D. Nilsen. Performance of a hardware-assisted real-time garbage collector. In ASPLOS 1994 [ASPLOS94], 1994, pages 76-85. Available here.
[scho67] H. Schorr and W. Waite. An efficient machine independent procedure for garbage collection in various list structures. Communications of the ACM, 10(8):501-506, August 1967.
[styg67] P. Stygar. LISP 2 garbage collector specifications. Technical Report TN-3417/500/00, System Development Corporation, April 1967.
[VEE11] Erez Petrank and Doug Lea, editors. 7th ACM SIGPLAN/SIGOPS International Conference on Virtual Execution Environments, Newport Beach, CA, March 2011. ACM Press. Available here.
[weis67] C. Weissman. Lisp 1.5 Primer. Dickenson Publ., Belmont, CA, 1967.
[weiz62] J. Weizenbaum. Knotted list structures. Communications of the ACM, 5(3):161-165, 1962.
[weiz63] J. Weizenbaum. Symmetric list processor. Communications of the ACM, 6(9):524-544, September 1963.
[weiz64] J. Weizenbaum. More on the reference counter method. Communications of the ACM, 7(1):38, 1964.
[weiz69] J. Weizenbaum. Recovery of reentrant list structures in SLIP. Communications of the ACM, 12(7):370-372, July 1969. Available here.
[wilk64] Maurice V. Wilkes. An experiment with a self-compiling compiler for a simple list-processing language. Annual Review in Automatic Programming, 4:1-48, 1964.
[wilk64a] Maurice V. Wilkes. Lists and why they are useful. In 19th ACM National Conference. ACM Press, August 1964.
[wise66] N. E. Wiseman. A simple list processing package for the PDP-7. In DECUS 2nd European Seminar, pages 37-42, Aachen, October 1966.
[wodo69] P. L. Wodon. Data structure and storage allocation. BIT, 9(3):270-282, 1969.
There were 56 matches.
Please send any comments or error reports concerning this search engine toRichard Jones.