Computer Science Department professor Greg Wasilkowski’s paper
“Tractability of infinite-dimensional integration in the worst case and randomized settings” has been selected as a co-winner of the 2011 Best Paper Award from the Journal of Complexity.