Awards [2 awards]

2005 Ronald V. Book Prize for Best Student Paper: The program committee of the 2005 Conference on computational complexity is delighted to present the 2005 Ronald V. Book Prize for Best Student Paper to Ryan Williams of Carnegie Mellon University, for his paper "Better Time-Space Lower Bounds for SAT and Related Problems" This award is given annually to an outstanding paper written solely by one or more students. 2005 Best Paper Award: The program committee is delighted to present the 2005 Complexity Best Paper Award to Ronen Shaltiel of the University of Haifa and to Chris Umans of the California Institute of Technology for their paper "Pseudorandomness for Approximate Counting and Sampling."