C2 - Ed. Board
Guest Editors’ foreword
A sharp threshold in proof complexity yields lower bounds for satisfiability search
Lower bounds for intersection searching and fractional cascading in higher dimension
Computing crossing numbers in quadratic time
Learning DNF in time 2Õ(n1/3)
Decidability of string graphs
Optimal outlier removal in high-dimensional spaces
Quantitative solution of omega-regular games
A new protocol and lower bounds for quantum coin flipping
Clustering to minimize the sum of cluster diameters
Approximation algorithms for Max-3-Cut and other problems via complex semidefinite programming
Papers to Appear
C4 - TOC