@Article{	  appel87garbage,
  author	= {Andrew W. Appel},
  title		= {Garbage Collection can be Faster than Stack Allocation},
  journal	= {Information Processing Letters},
  volume	= {25},
  number	= {4},
  publisher	= {North Holland},
  address	= {Princeton University, Dept. Computer Science, Princeton,
		  NJ, 08544},
  pages		= {275--279},
  year		= {1987},
  urlbib	= {http://www.cs.ucsb.edu/~grze/papers/gc/appel87garbage.bib}
		  ,
  url		= {http://www.cs.ucsb.edu/~grze/papers/gc/appel87garbage.bib}
		  ,
  pdf		= {http://www.cs.ucsb.edu/~grze/papers/gc/appel87garbage.pdf}
		  ,
  abstract	= {An old and simple algorithm for garbage collection gives
		  very good results when the physical memory is much larger
		  than the number of reachable cells. In fact, the overhead
		  associated with allocating and collecting cells from the
		  heap can be reduced to less than one instruction per cell
		  by increasing the size of physical memory. Special
		  hardware, intricate garbage-collection algorithms, and
		  fancy compiler analysis become unnecessary.},
  keyword	= {Garbage Collection}
}