Volume 276, Number 1-2, April 2002
: A necessary condition for a graph to be the visibility graph of a simple polygon.
J. M. Robson
: Constant bounds on the moments of the height of binary search trees.
: How to decide continuity of rational functions on infinite words.
: A comparison of two approaches to pseudorandomness.