The memory storage requirements of complex programs are extremely difficult to manage correctly by hand. A single error may lead to indeterminate and inexplicable program crashes. This text shows how dynamic memory can be recycled automatically to guarantee error-free memory management. Each of the most important algorithms is explained in detail, with illustrations of characteristic features. Techniques are presented for declarative and imperative styles (and in hostile environments like C++), for supporting most modern object-oriented languages, and for uniprocessors, shared memory...