A simplified solution of the n queens' problem. Sandeep N. Bhatt and Stavros S. Cosmadakis . The complexity of minimizing wire lengths in VLSI layouts. A log log n data structure for three-sided range queries. Andrew W. Appel .
Garbage collection can be faster than stack allocation.
Vijay Raghavan and Shankar M. Venkatesan . On bounds for a board covering problem. Stable unmerging in linear time and constant space. Optimal checkpointing and local recording for domino-free rollback recovery. A storage allocation method with invalidating dangling references.