Foundations and Trends® in Theoretical Computer Science Editor-in-Chief: Madhu Sudan, Dept of CS and EE M.I.T Stata Center, Room G640 32 Vassar Street Cambridge, Massachusetts 02139 USA madhu at mit dot edu Print ISSN: 1551-305X Online ISSN: 1551-3068 Americas USD 345 / All other countries EURO 345 (electronic) Americas USD 385 / All other countries EURO 385 (combined) Published Issues Each issue of the journal is available online. If your institution subscribes you will have access to the full text HTML and PDF of the journal. See "Do I have Online Access? If your institution does not subscribe, each issue is available for purchase as a book or e-book. Volume 2, Issue 3 (2006) A Survey of Lower Bounds for Satisfiability and Related Problems By Dieter van Melkebeek (Wisconsin) Volume 2, Issue 2 (2006) Algorithmic Results in List Decoding By Venkatesan Guruswami (U. Washington) Volume 2, Issue 1 (2006) Average-Case Complexity By Andrej Bogdanov (Rutgers) and Luca Trevisan (UC Berkeley) Volume 1, Issue 4 (2005) Pairwise Independence and Derandomization By Mike Luby and Avi Widgerson Volume 1, Issue 3 (2005) Mathematical Aspects of Mixing Times in Markov Chains By Ravi Montenegro (U. Mass, Lowell) and Prasad Tetali (Georgia Inst. of Technology) Volume 1, Issue 2 (2005) Data Streams: Algorithms and Applications By S. Muthukrishnan (Rutgers) Volume 1, Issue 1 (2005) Foundations of Cryptography - A Primer By Oded Goldreich (Weizmann Institute) Upcoming Issues Computational Aspects of Embeddings By Moses Charikar (Princeton) and Piotr Indyk (MIT) and Assaf Naor (Microsoft Research) Computational Complexity of Equilibria By Tim Roughgarden (Stanford) Pseudorandomness By Salil Vadhan (Harvard) Linear Algebra and Computational Complexity By Satya Lokam (Microsoft Research) Algebraic Algorithms / Computation By Manindra Agrawal (IIT Kanpur)