- Online First™
Lower Bounds for k-DNF Resolution on Random 3-CNFs
Michael Alekhnovich
Online First™, 3 February 2012
- Online First™
Special issue from RANDOM’09: Editors’ Foreword
Oded Goldreich and Salil Vadhan
Online First™, 3 February 2012
- Online First™
Pseudorandom generators for combinatorial checkerboards
Thomas Watson
Online First™, 3 February 2012
- Online First™
On the security of Goldreich’s one-way function
Andrej Bogdanov and Youming Qiao
Online First™, 2 February 2012
- Online First™
Hardness of Approximating the Closest Vector Problem with Pre-Processing
Mikhail Alekhnovich, Subhash A. Khot, Guy Kindler and Nisheeth K. Vishnoi
Online First™, 2 January 2012
- Online First™
Special Issue In Memory of Misha Alekhnovich. Foreword
A. Borodin, T. Pitassi and A. Razborov
Online First™, 12 December 2011
- Online First™
Satisfiability, Branch-Width and Tseitin tautologies
Michael Alekhnovich and Alexander Razborov
Online First™, 24 November 2011
- Online First™
Towards Strong Nonapproximability Results in the Lovász-Schrijver Hierarchy
Mikhail Alekhnovich, Sanjeev Arora and Iannis Tourlakis
Online First™, 21 November 2011
- Online First™
Toward a Model for Backtracking and Dynamic Programming
Michael Alekhnovich, Allan Borodin, Joshua Buresh-Oppenheim, Russell Impagliazzo and Avner Magen, et al.
Online First™, 21 November 2011
- Online First™
Low-Depth Witnesses are Easy to Find
Luís Antunes, Lance Fortnow, Alexandre Pinto and André Souto
Online First™, 9 November 2011