1

Henry G. Baker, Jr., List processing in real time on a serial computer, Communications of the ACM, v.21 n.4, p.280-294, April 1978  [doi>10.1145/359460.359470]

2

Henry G. Baker, Jr. , Carl Hewitt, The Incremental Garbage Collection of Processes, Massachusetts Institute of Technology, Cambridge, MA, 1977

3

Baker, H.G, Jr, 0ptlmtzlng Allocation and arbage Collection of Spaces. In: Artificial Intelligence: M HIT Perspective, P.H, kltnston and R.H. Brown (Eds.), HIT Press, 1979, 11/389-396.

4

Btshop, P.B. Computer Systems ~th a Very arge Address Space and Garbage Collection. Ph.D. Thesls, N{T/LCS/TR-178, Ftey 1977.

5

Rodney A. Brooks, Trading data space for reduced time and code space in real-time garbage collection on stock hardware, Proceedings of the 1984 ACM Symposium on LISP and functional programming, p.256-262, August 06-08, 1984, Austin, Texas, United States  [doi>10.1145/800055.802042]

6

D. R. Brownbridge, Cyclic reference counting for combinator machines, Proc. of a conference on Functional programming languages and computer architecture, p.273-288, January 1985, Nancy, France

7

C. J. Cheney, A nonrecursive list compacting algorithm, Communications of the ACM, v.13 n.11, p.677-678, Nov 1970  [doi>10.1145/362790.362798]

8

Jeffrey L. Dawson, Improved effectiveness from a real time LISP garbage collector, Proceedings of the 1982 ACM symposium on LISP and functional programming, p.159-167, August 15-18, 1982, Pittsburgh, Pennsylvania, United States  [doi>10.1145/800068.802146]

9

Edsger W. Dijkstra , Leslie Lamport , A. J. Martin , C. S. Scholten , E. F. M. Steffens, On-the-fly garbage collection: an exercise in cooperation, Communications of the ACM, v.21 n.11, p.966-975, Nov. 1978  [doi>10.1145/359642.359655]

10

Ghoman, S. Storage Reclamat!on to a I~ tul {processor System. H.S. Thest$, Dept. of Comp. Sct., Colorado State Univ., Summer 1980.

11

Dale H. Grit , Rex L. Page, Deleting Irrelevant Tasks in an Expression-Oriented Multiprocessor System, ACM Transactions on Programming Languages and Systems (TOPLAS), v.3 n.1, p.49-59, Jan. 1981  [doi>10.1145/357121.357125]

12

Halstead, R.H.Jr. Reference Tree Networks: trtual i~chtne and Implementation, Ph.D, Thests, #}T/LCS/TR-222, July 1979.

13

Robert H. Halstead, Jr., Implementation of multilisp: Lisp on a multiprocessor, Proceedings of the 1984 ACM Symposium on LISP and functional programming, p.9-17, August 06-08, 1984, Austin, Texas, United States  [doi>10.1145/800055.802017]

14

Yasushi Hibino, A practical parallel garbage collection algorithm and its implementation, Proceedings of the 7th annual symposium on Computer Architecture, p.113-120, May 06-08, 1980, La Baule, United States  [doi>10.1145/800053.801916]

15

Paul Hudak , Robert M. Keller, Garbage collection and task deletion in distributed applicative processing systems, Proceedings of the 1982 ACM symposium on LISP and functional programming, p.168-178, August 15-18, 1982, Pittsburgh, Pennsylvania, United States  [doi>10.1145/800068.802147]

16

Hudak, P. Distributed Graph Marking. R ;es Rep. 268, Dept. of Comp. Sct., Yale Univ., Jan. 1983.

17

Hughes, J. The Design and Implementation of Programming Languages. Ph.D. Thests, Technical Monograph PRG-40, Oxford Univ., July 1983.

18

John Hughes, A distributed garbage collection algorithm, Proc. of a conference on Functional programming languages and computer architecture, p.256-272, January 1985, Nancy, France

19

Johnson, S.D. Storage Allocation for Ltst Nultlprocesstng. Tech. Rep. 168, Dept. of Comp. Sct,, lndtana Un{v,, March 1985.

20

Kung' H.T., and Song, S.#. An Efficient lel Garbage Collection System and lts Correctness Proof. In: Proc. 18th Ann. Syrup. on Foundations of Computer Sctence, IEEE Comp. Soc., Oct. 1977, 120-131.

21

Henry Lieberman , Carl Hewitt, A real-time garbage collector based on the lifetimes of objects, Communications of the ACM, v.26 n.6, p.419-429, June 1983  [doi>10.1145/358141.358147]

22

Hohamed-A11, K.A. Object-oriented Storage nagment and Garbage Collection in Otstrtbuted Processing Systems. Academtc hiss., TR{TA-CS-8406, Dept. of Computer Systems, Roya} Institute of Technology, Stockholm, Dec. 1984.

23

Hohamed-Alt, K.A., and Hartdt, S. Global rbage Collection for fitstrtbuted Heap Storage Systems. internal IBN Rep. RC 11082 (49769) and TRITA-CS-8502, Dept. of Computer Systems, Royal nstftute of Technology, Stockholm, Aprtl 1985,

24

Newman, {.A., Stallard, R.P., and Woodward, C. A Hybrid Iqulttple Processor Garbage Collection Algorithm. Computer Studtes 213, Dept. of Computer Studies, Loughborough Untv. of Technology, Aug. 1984.

25

$ugimoto, S., Agusa, K., Tabata, K.,and Ohno, A I~Jltt-Mtcroprocessor System for Concurrent LISP. In: Proc. 1983 lnt'l Conf. on Parallel Processing, H.J.Stegel and L. Stegel (Eds.), {EEE Comp. Soc., 1983, 135-143.

26

Philip L. Wadler, Analysis of an algorithm for real time garbage collection, Communications of the ACM, v.19 n.9, p.491-500, Sept. 1976  [doi>10.1145/360336.360338]

27

David S. Wise, Design for a multiprocessing heap with on-board reference counting, Proc. of a conference on Functional programming languages and computer architecture, p.289-304, January 1985, Nancy, France

Bernard Lang , Christian Queinnec , José Piquer, Garbage collecting the world, Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.39-50, January 19-22, 1992, Albuquerque, New Mexico, United States

José M. Piquer, Indirect distributed garbage collection: handling object migration, ACM Transactions on Programming Languages and Systems (TOPLAS), v.18 n.5, p.615-647, Sept. 1996

Saleh E. Abdullahi , Graem A. Ringwood, Garbage collecting the Internet: a survey of distributed garbage collection, ACM Computing Surveys (CSUR), v.30 n.3, p.330-373, Sept. 1998

Nandakumar Sankaran, A bibliography on garbage collection and related topics, ACM SIGPLAN Notices, v.29 n.9, p.149-158, Sept. 1994

B. Lang , F. Dupont, Incremental incrementally compacting garbage collection, ACM SIGPLAN Notices, v.22 n.7, p.253-263, July 1987