Opportunistic garbage collection. - Paul R. Wilson 001 (ACM SIGPLAN Notices, 1988)

Design of the Opportunistic Garbage Collector. - Paul R. Wilson 001; Thomas G. Moher (OOPSLA, 1989)

Demonic Memories for Process Histories. - Paul R. Wilson 001; Thomas G. Moher (PLDI, 1989)

A simple bucket-brigade advancement mechanism for generation-bases garbage collection. - Paul R. Wilson 001 (ACM SIGPLAN Notices, 1989)

A "card-marking" scheme for controlling intergenerational references in generation-based garbage collection on stock hardware. - Paul R. Wilson 001; Thomas G. Moher (ACM SIGPLAN Notices, 1989)

Effective "Static-Graph" Reorganization to Improve Locality in Garbage-Collected Systems. - Paul R. Wilson 001; Michael S. Lam; Thomas G. Moher (PLDI, 1991)

Garbage collection in object oriented systems. - Paul R. Wilson 001; Barry Hayes (OOPSLA Addendum, 1991)

Pointer swizzling at page fault time: efficiently supporting huge address spaces on standard hardware. - Paul R. Wilson 001 (SIGARCH Comput. Archit. News, 1991)

Some issues and strategies in heap management and memory hierarchies. - Paul R. Wilson 001 (ACM SIGPLAN Notices, 1991)

Offsetting Human Limits With Debugging Technoloy - Guest Editors' Introduction. - Thomas G. Moher; Paul R. Wilson 001 (IEEE Softw., 1991)

Object Type Directed Garbage Collection To Improve Locality. - Michael S. Lam; Paul R. Wilson 001; Thomas G. Moher (IWMM, 1992)

Uniprocessor Garbage Collection Techniques. - Paul R. Wilson 001 (IWMM, 1992)

Caching Considerations for Generational Garbage Collection. - Paul R. Wilson 001; Michael S. Lam; Thomas G. Moher (LISP and Functional Programming, 1992)

Texas: An Efficient, Portable Persistent Store. - Vivek Singhal; Sheetal V. Kakkad; Paul R. Wilson 001 (POS, 1992)

Texas: good, fast, cheap persistence for C++. - Vivek Singhal; Sheetal V. Kakkad; Paul R. Wilson 001 (OOPSLA Addendum, 1992)

Anomalies and adaptation in the analysis and development of prepaging policies. - Paul R. Wilson 001; Sheetal V. Kakkad; Shubhendu S. Mukherjee (J. Syst. Softw., 1994)

Dynamic Storage Allocation: A Survey and Critical Review - Paul R. Wilson 001; Mark S. Johnstone; Michael Neely; David Boles (IWMM, 1995)

The Memory Fragmentation Problem: Solved? - Mark S. Johnstone; Paul R. Wilson 001 (ISMM, 1998)

Portable Run-Time Type Description for Conventional Compilers. - Sheetal V. Kakkad; Mark S. Johnstone; Paul R. Wilson 001 (ISMM, 1998)

Address Translation Strategies in the Texas Persistent Store. - Sheetal V. Kakkad; Paul R. Wilson 001 (COOTS, 1999)

Trace Reduction for Virtual Memory Simulations. - Scott F. Kaplan; Yannis Smaragdakis; Paul R. Wilson 001 (SIGMETRICS, 1999)

EELRU: Simple and Effective Adaptive Page Replacement. - Yannis Smaragdakis; Scott F. Kaplan; Paul R. Wilson 001 (SIGMETRICS, 1999)

The Case for Compressed Caching in Virtual Memory Systems. - Paul R. Wilson 001; Scott F. Kaplan; Yannis Smaragdakis (USENIX ATC, General Track, 1999)

Hoard: A Scalable Memory Allocator for Multithreaded Applications. - Emery D. Berger; Kathryn S. McKinley; Robert D. Blumofe; Paul R. Wilson 001 (ASPLOS, 2000)

Performing Replacement in Modem Pools. - Yannis Smaragdakis; Paul R. Wilson 001 (USENIX ATC, General Track, 2000)

The EELRU adaptive replacement algorithm. - Yannis Smaragdakis; Scott F. Kaplan; Paul R. Wilson 001 (Perform. Evaluation, 2003)

Flexible reference trace reduction for VM simulations. - Scott F. Kaplan; Yannis Smaragdakis; Paul R. Wilson 001 (ACM Trans. Model. Comput. Simul., 2003)