Awards [2 awards]

Summary form only given, as follows. The 2007 Ronald V. Book Prize for Best Student Paper: The program committee of the 2007 Conference on Computational Complexity is delighted to present the Ronald V. Book Prize for Best Student Paper to Alexander A. Sherstov of the University of Texas at Austin and to Ryan Williams of Carnegie Mellon University. This award is given annually to the most outstanding paper written solely by one or more students. The title of the paper by Sherstov is ??Halfspace Matrices" and the title of the paper by Williams is "Time-Space Tradeoffs for Counting NP Solutions Modulo Integers." The 2007 Best Paper Award: The program committee of the 2007 Conference on Computational Complexity is delighted to present the 2007 Complexity Best Paper Award to Venkatesan Guruswami of the University of Washington, Christopher Umans of California Institute of Technology and Salil Vadhan of Harvard University for their paper "Unbalanced Expanders and Randomness Extractors from Parvaresh-Vardy Codes."