Published by the Department of Computer Science University of Chicago. Copyright CJTCS and the authors.

• 2008 Articles
  1. A Priority-Based Model of Routing by Babak Farzad, Neil Olver and Adrian Vetta. 5 February 2008.
  2. Representing Hard Lattices with O(nlog n) Bits by Miklos Ajtai. 12 May 2008.
  3. Syntactic Characterizations of Polynomial Time Optimization Classes by Prabhu Manyem. 22 May 2008.
  4. Some perfect matchings and perfect half-integral matchings in NC by Raghav Kulkarni, Meena Mahajan, and Kasturi R. Varadarajan. 5 September 2008.
  5. The Phase Transition in Exact Cover by Vamsi Kalapala and Cris Moore, October 1st, 2008
  6. Efficient Fully-Simulatable Oblivious Transfer by Yehuda Lindell, December 2, 2008
  7. Simultaneous Communication Protocols with Quantum and Classical Messages by Dmitry Gavinsky, Oded Regev, and Ronald de Wolf, December 28, 2008
• 2008 Abstracts

Volume 2007

Published articles