1. Special Issue In Memory of Misha Alekhnovich. Foreword

   • A. Borodin
   • T. Pitassi
   • A. Razborov

   OriginalPaper 13 December 2011 Pages: 579 - 590

2. Obituary

   • Max Nalsky
   • Michael Ostrovsky

   News 09 February 2012 Pages: 591 - 595

3. Lower Bounds for k-DNF Resolution on Random 3-CNFs

   • Michael Alekhnovich

   OriginalPaper 04 February 2012 Pages: 597 - 614

4. Towards Strong Nonapproximability Results in the Lovász-Schrijver Hierarchy

   • Mikhail Alekhnovich
   • Sanjeev Arora
   • Iannis Tourlakis

   OriginalPaper 22 November 2011 Pages: 615 - 648

5. Satisfiability, Branch-Width and Tseitin tautologies

   • Michael Alekhnovich
   • Alexander Razborov

   OriginalPaper 25 November 2011 Pages: 649 - 678

6. Toward a Model for Backtracking and Dynamic Programming

   • Michael Alekhnovich
   • Allan Borodin
   • Toniann Pitassi

   OriginalPaper 22 November 2011 Pages: 679 - 740

7. Hardness of Approximating the Closest Vector Problem with Pre-Processing

   • Mikhail Alekhnovich
   • Subhash A. Khot
   • Nisheeth K. Vishnoi

   OriginalPaper 03 January 2012 Pages: 741 - 753

8. More on Average Case vs Approximation Complexity

   • Michael Alekhnovich

   OriginalPaper 07 February 2012 Pages: 755 - 786