FoCS News
Mike Paterson and Uri Zwick's article on 'Overhang' wins prize at Mathematical Association of America
The MAA has awarded Mike Paterson and his collaborator Uri Zwick the Lester R. Ford Award for their article Overhang in the American Mathematical Monthly. The problem of how far off the edge of a table one can reach by stacking n identical blocks first appeared in the American Mathematical Monthly in 1923. A classical solution achieving an overhang logarithmic in n was widely believed to be optimal. The article clarifies the problem and shows that the overhang can be made exponentially larger than this.
Rajagopal Nagarajan gives an invited talk in Tokyo
Rajagopal Nagarajan gave an invited talk at the Hypercomputation Workshop (Hypernet '10)
held in conjunction with the 9th International Conference on Unconventional Computation (UC 2010) in Tokyo, Japan, 21-25 June, 2010. His talk was titled Formal Methods for Quantum Information Science. A paper based on this work has been accepted to the special issue of the International Journal of Unconventional Computation.